./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22d9a6832a4080412e38f5d573b63985f3b10b3c2009b6559595c7c0bbda414f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:19:38,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:19:38,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:19:38,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:19:38,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:19:38,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:19:38,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:19:38,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:19:38,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:19:38,561 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:19:38,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:19:38,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:19:38,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:19:38,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:19:38,564 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:19:38,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:19:38,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:19:38,565 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:19:38,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:19:38,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:19:38,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:19:38,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:19:38,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:19:38,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:19:38,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:19:38,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:19:38,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:19:38,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:19:38,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:19:38,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:19:38,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:19:38,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:19:38,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:19:38,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:19:38,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:19:38,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:19:38,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:19:38,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:19:38,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:19:38,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:19:38,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:19:38,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:19:38,573 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 -> 22d9a6832a4080412e38f5d573b63985f3b10b3c2009b6559595c7c0bbda414f [2024-11-08 15:19:38,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:19:38,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:19:38,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:19:38,869 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:19:38,869 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:19:38,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c [2024-11-08 15:19:40,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:19:40,530 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:19:40,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_4-2.c [2024-11-08 15:19:40,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d8ae70d/768bd9bad23f46a4a0dccd8263ab4a82/FLAG29823d766 [2024-11-08 15:19:40,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d8ae70d/768bd9bad23f46a4a0dccd8263ab4a82 [2024-11-08 15:19:40,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:19:40,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:19:40,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:19:40,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:19:40,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:19:40,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:19:40" (1/1) ... [2024-11-08 15:19:40,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d06e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:40, skipping insertion in model container [2024-11-08 15:19:40,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:19:40" (1/1) ... [2024-11-08 15:19:40,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:19:41,145 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_2calls_4-2.c[946,959] [2024-11-08 15:19:41,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:19:41,161 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:19:41,179 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_2calls_4-2.c[946,959] [2024-11-08 15:19:41,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:19:41,197 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:19:41,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41 WrapperNode [2024-11-08 15:19:41,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:19:41,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:19:41,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:19:41,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:19:41,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (1/1) ... [2024-11-08 15:19:41,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (1/1) ... [2024-11-08 15:19:41,227 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-08 15:19:41,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:19:41,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:19:41,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:19:41,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:19:41,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (1/1) ... [2024-11-08 15:19:41,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (1/1) ... [2024-11-08 15:19:41,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (1/1) ... [2024-11-08 15:19:41,255 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-08 15:19:41,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (1/1) ... [2024-11-08 15:19:41,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (1/1) ... [2024-11-08 15:19:41,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (1/1) ... [2024-11-08 15:19:41,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (1/1) ... [2024-11-08 15:19:41,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (1/1) ... [2024-11-08 15:19:41,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (1/1) ... [2024-11-08 15:19:41,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:19:41,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:19:41,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:19:41,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:19:41,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (1/1) ... [2024-11-08 15:19:41,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:19:41,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:19:41,304 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-08 15:19:41,308 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-08 15:19:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:19:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:19:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-08 15:19:41,361 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-08 15:19:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-08 15:19:41,362 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-08 15:19:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:19:41,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:19:41,428 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:19:41,431 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:19:41,577 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 15:19:41,577 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:19:41,592 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:19:41,593 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:19:41,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:19:41 BoogieIcfgContainer [2024-11-08 15:19:41,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:19:41,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:19:41,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:19:41,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:19:41,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:19:40" (1/3) ... [2024-11-08 15:19:41,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5842533e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:19:41, skipping insertion in model container [2024-11-08 15:19:41,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:19:41" (2/3) ... [2024-11-08 15:19:41,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5842533e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:19:41, skipping insertion in model container [2024-11-08 15:19:41,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:19:41" (3/3) ... [2024-11-08 15:19:41,604 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-2.c [2024-11-08 15:19:41,621 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:19:41,621 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:19:41,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:19:41,696 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;@664854e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:19:41,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:19:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 15:19:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 15:19:41,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:19:41,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:19:41,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:19:41,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:19:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2024-11-08 15:19:41,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:19:41,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067066304] [2024-11-08 15:19:41,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:41,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:19:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:41,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:19:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:42,046 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-08 15:19:42,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:19:42,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067066304] [2024-11-08 15:19:42,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067066304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:19:42,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:19:42,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:19:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395550198] [2024-11-08 15:19:42,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:19:42,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:19:42,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:19:42,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:19:42,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:19:42,082 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-08 15:19:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:19:42,137 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-08 15:19:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:19:42,140 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-08 15:19:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:19:42,147 INFO L225 Difference]: With dead ends: 39 [2024-11-08 15:19:42,148 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 15:19:42,151 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-08 15:19:42,154 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 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-08 15:19:42,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:19:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 15:19:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 15:19:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-08 15:19:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-08 15:19:42,203 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2024-11-08 15:19:42,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:19:42,204 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-08 15:19:42,204 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-08 15:19:42,204 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-08 15:19:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 15:19:42,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:19:42,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:19:42,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:19:42,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:19:42,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:19:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2024-11-08 15:19:42,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:19:42,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266761560] [2024-11-08 15:19:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:42,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:19:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:42,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:19:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:42,306 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-08 15:19:42,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:19:42,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266761560] [2024-11-08 15:19:42,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266761560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:19:42,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:19:42,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:19:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871506157] [2024-11-08 15:19:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:19:42,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:19:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:19:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:19:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:19:42,314 INFO L87 Difference]: Start difference. First operand 27 states and 34 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-08 15:19:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:19:42,338 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-11-08 15:19:42,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:19:42,338 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-08 15:19:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:19:42,340 INFO L225 Difference]: With dead ends: 33 [2024-11-08 15:19:42,340 INFO L226 Difference]: Without dead ends: 29 [2024-11-08 15:19:42,340 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-08 15:19:42,342 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 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-08 15:19:42,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:19:42,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-08 15:19:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-08 15:19:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-08 15:19:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-08 15:19:42,350 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2024-11-08 15:19:42,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:19:42,350 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-08 15:19:42,350 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-08 15:19:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-08 15:19:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 15:19:42,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:19:42,352 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:19:42,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:19:42,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:19:42,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:19:42,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2024-11-08 15:19:42,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:19:42,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467248737] [2024-11-08 15:19:42,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:42,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:19:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:42,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:19:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:42,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 15:19:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:19:42,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:19:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467248737] [2024-11-08 15:19:42,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467248737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:19:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134276852] [2024-11-08 15:19:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:42,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:19:42,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:19:42,599 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-08 15:19:42,602 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-08 15:19:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:42,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:19:42,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:19:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:19:42,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:19:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:19:43,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134276852] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:19:43,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:19:43,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-08 15:19:43,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740399275] [2024-11-08 15:19:43,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:19:43,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:19:43,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:19:43,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:19:43,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:19:43,079 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 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-08 15:19:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:19:43,247 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2024-11-08 15:19:43,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:19:43,248 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 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-08 15:19:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:19:43,249 INFO L225 Difference]: With dead ends: 55 [2024-11-08 15:19:43,250 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 15:19:43,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:19:43,253 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:19:43,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:19:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 15:19:43,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-08 15:19:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-08 15:19:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-08 15:19:43,264 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2024-11-08 15:19:43,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:19:43,264 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-08 15:19:43,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 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-08 15:19:43,265 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-08 15:19:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 15:19:43,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:19:43,266 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:19:43,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:19:43,467 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-08 15:19:43,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:19:43,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:19:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2024-11-08 15:19:43,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:19:43,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669052144] [2024-11-08 15:19:43,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:19:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:43,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:19:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:43,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:43,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:19:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:19:43,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:19:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669052144] [2024-11-08 15:19:43,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669052144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:19:43,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062464493] [2024-11-08 15:19:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:43,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:19:43,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:19:43,694 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-08 15:19:43,696 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-08 15:19:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:43,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:19:43,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:19:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:19:43,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:19:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:19:43,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062464493] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:19:43,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:19:43,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-11-08 15:19:43,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159565488] [2024-11-08 15:19:43,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:19:44,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:19:44,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:19:44,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:19:44,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:19:44,003 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 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-08 15:19:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:19:44,197 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2024-11-08 15:19:44,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:19:44,198 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 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-08 15:19:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:19:44,201 INFO L225 Difference]: With dead ends: 53 [2024-11-08 15:19:44,203 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 15:19:44,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:19:44,205 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:19:44,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 120 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:19:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 15:19:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-08 15:19:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-08 15:19:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-08 15:19:44,233 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 24 [2024-11-08 15:19:44,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:19:44,235 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-08 15:19:44,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 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-08 15:19:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-08 15:19:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 15:19:44,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:19:44,237 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:19:44,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 15:19:44,438 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-08 15:19:44,438 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:19:44,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:19:44,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2024-11-08 15:19:44,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:19:44,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825794233] [2024-11-08 15:19:44,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:44,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:19:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:44,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:19:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:44,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:44,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 15:19:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:44,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 15:19:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:19:44,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:19:44,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825794233] [2024-11-08 15:19:44,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825794233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:19:44,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726822152] [2024-11-08 15:19:44,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:44,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:19:44,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:19:44,597 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-08 15:19:44,598 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-08 15:19:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:44,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:19:44,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:19:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 15:19:44,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:19:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:19:45,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726822152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:19:45,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:19:45,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-11-08 15:19:45,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802384129] [2024-11-08 15:19:45,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:19:45,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 15:19:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:19:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 15:19:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:19:45,150 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 15:19:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:19:45,390 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2024-11-08 15:19:45,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:19:45,391 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2024-11-08 15:19:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:19:45,393 INFO L225 Difference]: With dead ends: 109 [2024-11-08 15:19:45,393 INFO L226 Difference]: Without dead ends: 65 [2024-11-08 15:19:45,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-08 15:19:45,398 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:19:45,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 164 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:19:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-08 15:19:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-08 15:19:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2024-11-08 15:19:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2024-11-08 15:19:45,419 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2024-11-08 15:19:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:19:45,420 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2024-11-08 15:19:45,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 15:19:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2024-11-08 15:19:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 15:19:45,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:19:45,424 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:19:45,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 15:19:45,629 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-08 15:19:45,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:19:45,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:19:45,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2024-11-08 15:19:45,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:19:45,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412885054] [2024-11-08 15:19:45,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:19:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:45,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:19:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:45,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:45,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:45,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:19:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:45,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:19:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 15:19:45,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:19:45,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412885054] [2024-11-08 15:19:45,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412885054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:19:45,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436920207] [2024-11-08 15:19:45,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:45,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:19:45,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:19:45,828 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-08 15:19:45,829 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-08 15:19:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:45,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:19:45,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:19:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:19:45,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:19:46,271 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:19:46,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436920207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:19:46,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:19:46,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2024-11-08 15:19:46,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610201958] [2024-11-08 15:19:46,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:19:46,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 15:19:46,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:19:46,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 15:19:46,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:19:46,274 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-08 15:19:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:19:46,581 INFO L93 Difference]: Finished difference Result 179 states and 325 transitions. [2024-11-08 15:19:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 15:19:46,581 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) Word has length 37 [2024-11-08 15:19:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:19:46,584 INFO L225 Difference]: With dead ends: 179 [2024-11-08 15:19:46,584 INFO L226 Difference]: Without dead ends: 119 [2024-11-08 15:19:46,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:19:46,586 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 35 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:19:46,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 248 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:19:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-08 15:19:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2024-11-08 15:19:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 64 states have (on average 1.21875) internal successors, (78), 67 states have internal predecessors, (78), 21 states have call successors, (21), 7 states have call predecessors, (21), 14 states have return successors, (63), 25 states have call predecessors, (63), 21 states have call successors, (63) [2024-11-08 15:19:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2024-11-08 15:19:46,607 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 37 [2024-11-08 15:19:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:19:46,607 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2024-11-08 15:19:46,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-08 15:19:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2024-11-08 15:19:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 15:19:46,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:19:46,610 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:19:46,628 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-08 15:19:46,810 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-08 15:19:46,811 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:19:46,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:19:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2024-11-08 15:19:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:19:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471517279] [2024-11-08 15:19:46,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:19:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:46,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:19:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:46,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:46,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:47,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:19:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:19:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:47,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:19:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 15:19:47,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:19:47,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471517279] [2024-11-08 15:19:47,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471517279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:19:47,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442240495] [2024-11-08 15:19:47,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:47,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:19:47,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:19:47,029 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-08 15:19:47,030 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-08 15:19:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:47,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:19:47,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:19:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 15:19:47,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:19:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 15:19:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442240495] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:19:47,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:19:47,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2024-11-08 15:19:47,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338875347] [2024-11-08 15:19:47,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:19:47,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 15:19:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:19:47,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 15:19:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:19:47,487 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-08 15:19:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:19:47,753 INFO L93 Difference]: Finished difference Result 262 states and 510 transitions. [2024-11-08 15:19:47,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:19:47,753 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) Word has length 51 [2024-11-08 15:19:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:19:47,756 INFO L225 Difference]: With dead ends: 262 [2024-11-08 15:19:47,756 INFO L226 Difference]: Without dead ends: 165 [2024-11-08 15:19:47,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:19:47,758 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:19:47,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 191 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:19:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-08 15:19:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 139. [2024-11-08 15:19:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 31 states have call successors, (31), 10 states have call predecessors, (31), 18 states have return successors, (103), 37 states have call predecessors, (103), 31 states have call successors, (103) [2024-11-08 15:19:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 241 transitions. [2024-11-08 15:19:47,800 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 241 transitions. Word has length 51 [2024-11-08 15:19:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:19:47,800 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 241 transitions. [2024-11-08 15:19:47,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-08 15:19:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2024-11-08 15:19:47,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:19:47,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:19:47,802 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:19:47,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 15:19:48,003 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-08 15:19:48,004 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:19:48,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:19:48,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1130362923, now seen corresponding path program 1 times [2024-11-08 15:19:48,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:19:48,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678702151] [2024-11-08 15:19:48,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:48,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:19:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:48,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:19:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:48,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:48,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:48,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:48,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:19:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:48,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:19:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:19:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 15:19:48,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:19:48,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678702151] [2024-11-08 15:19:48,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678702151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:19:48,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729462192] [2024-11-08 15:19:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:48,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:19:48,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:19:48,230 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-08 15:19:48,232 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-08 15:19:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:48,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:19:48,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:19:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-08 15:19:48,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:19:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-08 15:19:48,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729462192] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:19:48,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:19:48,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2024-11-08 15:19:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174124784] [2024-11-08 15:19:48,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:19:48,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 15:19:48,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:19:48,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 15:19:48,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:19:48,540 INFO L87 Difference]: Start difference. First operand 139 states and 241 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-08 15:19:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:19:48,831 INFO L93 Difference]: Finished difference Result 344 states and 697 transitions. [2024-11-08 15:19:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 15:19:48,832 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Word has length 52 [2024-11-08 15:19:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:19:48,834 INFO L225 Difference]: With dead ends: 344 [2024-11-08 15:19:48,834 INFO L226 Difference]: Without dead ends: 117 [2024-11-08 15:19:48,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:19:48,837 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 36 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:19:48,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 227 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:19:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-08 15:19:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2024-11-08 15:19:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 61 states have (on average 1.180327868852459) internal successors, (72), 62 states have internal predecessors, (72), 20 states have call successors, (20), 7 states have call predecessors, (20), 12 states have return successors, (64), 24 states have call predecessors, (64), 20 states have call successors, (64) [2024-11-08 15:19:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 156 transitions. [2024-11-08 15:19:48,859 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 156 transitions. Word has length 52 [2024-11-08 15:19:48,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:19:48,859 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 156 transitions. [2024-11-08 15:19:48,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-08 15:19:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 156 transitions. [2024-11-08 15:19:48,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 15:19:48,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:19:48,863 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:19:48,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 15:19:49,064 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-08 15:19:49,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:19:49,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:19:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash -492645000, now seen corresponding path program 2 times [2024-11-08 15:19:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:19:49,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080358494] [2024-11-08 15:19:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:19:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:19:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:49,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:49,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:49,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:49,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:19:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:49,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:19:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:49,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:19:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:49,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:19:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:49,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:19:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:19:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 37 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 15:19:49,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:19:49,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080358494] [2024-11-08 15:19:49,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080358494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:19:49,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989344873] [2024-11-08 15:19:49,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:19:49,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:19:49,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:19:49,328 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-08 15:19:49,329 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-08 15:19:49,384 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:19:49,384 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:19:49,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:19:49,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:19:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 15:19:49,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:19:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 15:19:49,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989344873] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:19:49,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:19:49,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 9] total 22 [2024-11-08 15:19:49,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413154265] [2024-11-08 15:19:49,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:19:49,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 15:19:49,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:19:49,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 15:19:49,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:19:49,825 INFO L87 Difference]: Start difference. First operand 94 states and 156 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) [2024-11-08 15:19:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:19:50,216 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2024-11-08 15:19:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 15:19:50,217 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) Word has length 66 [2024-11-08 15:19:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:19:50,218 INFO L225 Difference]: With dead ends: 189 [2024-11-08 15:19:50,219 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 15:19:50,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:19:50,220 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 65 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:19:50,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 266 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:19:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 15:19:50,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2024-11-08 15:19:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (31), 16 states have call predecessors, (31), 12 states have call successors, (31) [2024-11-08 15:19:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2024-11-08 15:19:50,229 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 66 [2024-11-08 15:19:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:19:50,230 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2024-11-08 15:19:50,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) [2024-11-08 15:19:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2024-11-08 15:19:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 15:19:50,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:19:50,231 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:19:50,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 15:19:50,431 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-08 15:19:50,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:19:50,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:19:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash 780870354, now seen corresponding path program 1 times [2024-11-08 15:19:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:19:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289405685] [2024-11-08 15:19:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:19:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:19:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:19:50,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:19:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:19:50,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:19:50,467 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:19:50,468 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:19:50,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:19:50,471 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:19:50,496 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:19:50,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:19:50 BoogieIcfgContainer [2024-11-08 15:19:50,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:19:50,500 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:19:50,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:19:50,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:19:50,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:19:41" (3/4) ... [2024-11-08 15:19:50,501 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:19:50,560 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:19:50,560 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:19:50,561 INFO L158 Benchmark]: Toolchain (without parser) took 9643.81ms. Allocated memory was 144.7MB in the beginning and 213.9MB in the end (delta: 69.2MB). Free memory was 90.0MB in the beginning and 124.9MB in the end (delta: -34.9MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2024-11-08 15:19:50,561 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 144.7MB. Free memory was 106.7MB in the beginning and 106.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:19:50,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.25ms. Allocated memory is still 144.7MB. Free memory was 90.0MB in the beginning and 77.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 15:19:50,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.04ms. Allocated memory is still 144.7MB. Free memory was 77.8MB in the beginning and 76.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:19:50,561 INFO L158 Benchmark]: Boogie Preprocessor took 37.47ms. Allocated memory is still 144.7MB. Free memory was 76.2MB in the beginning and 74.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:19:50,562 INFO L158 Benchmark]: RCFGBuilder took 327.27ms. Allocated memory is still 144.7MB. Free memory was 74.6MB in the beginning and 64.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 15:19:50,562 INFO L158 Benchmark]: TraceAbstraction took 8904.18ms. Allocated memory was 144.7MB in the beginning and 213.9MB in the end (delta: 69.2MB). Free memory was 63.2MB in the beginning and 128.1MB in the end (delta: -64.9MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-11-08 15:19:50,562 INFO L158 Benchmark]: Witness Printer took 59.79ms. Allocated memory is still 213.9MB. Free memory was 128.1MB in the beginning and 124.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:19:50,564 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.21ms. Allocated memory is still 144.7MB. Free memory was 106.7MB in the beginning and 106.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.25ms. Allocated memory is still 144.7MB. Free memory was 90.0MB in the beginning and 77.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.04ms. Allocated memory is still 144.7MB. Free memory was 77.8MB in the beginning and 76.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.47ms. Allocated memory is still 144.7MB. Free memory was 76.2MB in the beginning and 74.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 327.27ms. Allocated memory is still 144.7MB. Free memory was 74.6MB in the beginning and 64.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8904.18ms. Allocated memory was 144.7MB in the beginning and 213.9MB in the end (delta: 69.2MB). Free memory was 63.2MB in the beginning and 128.1MB in the end (delta: -64.9MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Witness Printer took 59.79ms. Allocated memory is still 213.9MB. Free memory was 128.1MB in the beginning and 124.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 4; VAL [x=4] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=4] [L39] int result = fibo1(x); [L40] COND TRUE result == 3 VAL [x=4] [L41] reach_error() VAL [x=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 1628 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1373 mSDsCounter, 241 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1968 IncrementalHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 241 mSolverCounterUnsat, 255 mSDtfsCounter, 1968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 768 GetRequests, 607 SyntacticMatches, 22 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=7, InterpolantAutomatonStates: 112, 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, 9 MinimizatonAttempts, 85 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 664 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 865 ConstructedInterpolants, 0 QuantifiedInterpolants, 1861 SizeOfPredicates, 12 NumberOfNonLiveVariables, 780 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 494/648 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-08 15:19:50,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE