./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i15_o15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/id_i15_o15-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 715908359373978289cc76ce2f00faf49f4d4a3c6ddae64771646fc969bea981 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:35:42,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:35:42,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:35:42,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:35:42,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:35:42,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:35:42,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:35:42,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:35:42,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:35:42,265 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:35:42,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:35:42,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:35:42,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:35:42,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:35:42,266 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:35:42,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:35:42,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:35:42,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:35:42,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:35:42,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:35:42,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:35:42,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:35:42,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:35:42,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:35:42,267 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:35:42,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:35:42,267 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:35:42,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:35:42,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:35:42,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:35:42,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:35:42,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:35:42,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:35:42,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:35:42,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:35:42,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:35:42,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:35:42,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:35:42,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:35:42,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:35:42,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:35:42,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:35:42,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:35:42,269 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 715908359373978289cc76ce2f00faf49f4d4a3c6ddae64771646fc969bea981 [2025-03-03 14:35:42,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:35:42,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:35:42,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:35:42,520 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:35:42,520 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:35:42,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i15_o15-1.c [2025-03-03 14:35:43,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489376b77/4ed067b002f740c1a55b25d7fad02731/FLAGd13724c3e [2025-03-03 14:35:43,817 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:35:43,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-1.c [2025-03-03 14:35:43,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489376b77/4ed067b002f740c1a55b25d7fad02731/FLAGd13724c3e [2025-03-03 14:35:44,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489376b77/4ed067b002f740c1a55b25d7fad02731 [2025-03-03 14:35:44,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:35:44,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:35:44,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:35:44,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:35:44,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:35:44,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f0161b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44, skipping insertion in model container [2025-03-03 14:35:44,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:35:44,324 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/id_i15_o15-1.c[454,467] [2025-03-03 14:35:44,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:35:44,344 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:35:44,354 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/id_i15_o15-1.c[454,467] [2025-03-03 14:35:44,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:35:44,366 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:35:44,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44 WrapperNode [2025-03-03 14:35:44,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:35:44,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:35:44,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:35:44,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:35:44,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,389 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-03-03 14:35:44,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:35:44,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:35:44,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:35:44,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:35:44,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,405 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]. [2025-03-03 14:35:44,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:35:44,413 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:35:44,414 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:35:44,414 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:35:44,414 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (1/1) ... [2025-03-03 14:35:44,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:35:44,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:44,443 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) [2025-03-03 14:35:44,445 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 [2025-03-03 14:35:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:35:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:35:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:35:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:35:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-03-03 14:35:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-03-03 14:35:44,495 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:35:44,497 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:35:44,559 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: havoc #t~ret4; [2025-03-03 14:35:44,566 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-03 14:35:44,566 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:35:44,573 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:35:44,574 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:35:44,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:35:44 BoogieIcfgContainer [2025-03-03 14:35:44,575 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:35:44,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:35:44,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:35:44,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:35:44,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:35:44" (1/3) ... [2025-03-03 14:35:44,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ed76cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:35:44, skipping insertion in model container [2025-03-03 14:35:44,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:44" (2/3) ... [2025-03-03 14:35:44,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ed76cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:35:44, skipping insertion in model container [2025-03-03 14:35:44,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:35:44" (3/3) ... [2025-03-03 14:35:44,583 INFO L128 eAbstractionObserver]: Analyzing ICFG id_i15_o15-1.c [2025-03-03 14:35:44,594 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:35:44,595 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id_i15_o15-1.c that has 2 procedures, 16 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:35:44,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:35:44,637 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;@29f91091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:35:44,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:35:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:35:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 14:35:44,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:44,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:44,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:44,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:44,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1536782931, now seen corresponding path program 1 times [2025-03-03 14:35:44,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:44,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959196696] [2025-03-03 14:35:44,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:44,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:44,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 14:35:44,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 14:35:44,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:44,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:35:44,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:44,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959196696] [2025-03-03 14:35:44,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959196696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:35:44,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:35:44,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:35:44,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416028567] [2025-03-03 14:35:44,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:35:44,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:35:44,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:44,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:35:44,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:35:44,814 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2025-03-03 14:35:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:44,864 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-03-03 14:35:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:35:44,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 [2025-03-03 14:35:44,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:44,871 INFO L225 Difference]: With dead ends: 25 [2025-03-03 14:35:44,871 INFO L226 Difference]: Without dead ends: 15 [2025-03-03 14:35:44,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:35:44,876 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:44,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:35:44,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-03 14:35:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-03 14:35:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:35:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-03 14:35:44,901 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2025-03-03 14:35:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:44,902 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-03 14:35:44,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2025-03-03 14:35:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-03 14:35:44,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 14:35:44,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:44,903 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:44,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:35:44,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:44,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:44,904 INFO L85 PathProgramCache]: Analyzing trace with hash -808024836, now seen corresponding path program 1 times [2025-03-03 14:35:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:44,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845750129] [2025-03-03 14:35:44,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:44,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:44,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 14:35:44,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 14:35:44,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:44,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:35:45,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:45,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845750129] [2025-03-03 14:35:45,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845750129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:45,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481242492] [2025-03-03 14:35:45,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:45,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:45,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:45,021 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) [2025-03-03 14:35:45,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:35:45,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 14:35:45,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 14:35:45,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:45,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:45,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:35:45,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:35:45,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:35:45,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481242492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:45,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:45,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 14 [2025-03-03 14:35:45,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227896240] [2025-03-03 14:35:45,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:45,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 14:35:45,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:45,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 14:35:45,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:35:45,292 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 14 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 14:35:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:45,377 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-03 14:35:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:35:45,377 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 14 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 16 [2025-03-03 14:35:45,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:45,378 INFO L225 Difference]: With dead ends: 34 [2025-03-03 14:35:45,378 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 14:35:45,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:35:45,381 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:45,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 60 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:35:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 14:35:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-03-03 14:35:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:35:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-03-03 14:35:45,388 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2025-03-03 14:35:45,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:45,388 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-03-03 14:35:45,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 14 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 14:35:45,389 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-03-03 14:35:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 14:35:45,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:45,390 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:45,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:45,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:45,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:45,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1742358035, now seen corresponding path program 2 times [2025-03-03 14:35:45,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:45,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288119085] [2025-03-03 14:35:45,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:35:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:45,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-03 14:35:45,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:35:45,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:35:45,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:35:45,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288119085] [2025-03-03 14:35:45,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288119085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251074339] [2025-03-03 14:35:45,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:35:45,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:45,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:45,867 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) [2025-03-03 14:35:45,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:35:45,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-03 14:35:45,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:35:45,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:35:45,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:45,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 14:35:45,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:35:45,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:35:46,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251074339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:46,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:46,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 13] total 22 [2025-03-03 14:35:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527018069] [2025-03-03 14:35:46,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:46,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:35:46,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:46,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:35:46,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:35:46,728 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 22 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-03 14:35:46,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:46,862 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-03-03 14:35:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:35:46,863 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 22 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Word has length 34 [2025-03-03 14:35:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:46,863 INFO L225 Difference]: With dead ends: 49 [2025-03-03 14:35:46,863 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 14:35:46,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2025-03-03 14:35:46,864 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 67 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:46,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 74 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:46,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 14:35:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-03-03 14:35:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:35:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-03-03 14:35:46,873 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 34 [2025-03-03 14:35:46,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:46,873 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-03-03 14:35:46,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 22 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-03 14:35:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-03-03 14:35:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 14:35:46,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:46,874 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:46,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:35:47,078 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,SelfDestructingSolverStorable2 [2025-03-03 14:35:47,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:47,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:47,078 INFO L85 PathProgramCache]: Analyzing trace with hash 854543964, now seen corresponding path program 3 times [2025-03-03 14:35:47,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:47,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978861179] [2025-03-03 14:35:47,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:35:47,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:47,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 8 equivalence classes. [2025-03-03 14:35:47,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 14:35:47,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-03 14:35:47,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 15 proven. 103 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:35:47,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:47,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978861179] [2025-03-03 14:35:47,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978861179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:47,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531924941] [2025-03-03 14:35:47,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:35:47,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:47,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:47,354 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) [2025-03-03 14:35:47,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:35:47,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 8 equivalence classes. [2025-03-03 14:35:47,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 14:35:47,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-03 14:35:47,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:47,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 14:35:47,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-03 14:35:47,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:35:49,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531924941] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:49,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:49,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 19] total 30 [2025-03-03 14:35:49,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392071099] [2025-03-03 14:35:49,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:49,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 14:35:49,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:49,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 14:35:49,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2025-03-03 14:35:49,283 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 30 states, 27 states have (on average 2.074074074074074) internal successors, (56), 30 states have internal predecessors, (56), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 11 states have call predecessors, (22), 14 states have call successors, (22) [2025-03-03 14:35:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:49,450 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2025-03-03 14:35:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:35:49,454 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.074074074074074) internal successors, (56), 30 states have internal predecessors, (56), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 11 states have call predecessors, (22), 14 states have call successors, (22) Word has length 52 [2025-03-03 14:35:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:49,455 INFO L225 Difference]: With dead ends: 58 [2025-03-03 14:35:49,455 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 14:35:49,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=466, Invalid=1094, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 14:35:49,456 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 145 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:49,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 106 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 14:35:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-03-03 14:35:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 11 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:35:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2025-03-03 14:35:49,462 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 52 [2025-03-03 14:35:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:49,462 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2025-03-03 14:35:49,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.074074074074074) internal successors, (56), 30 states have internal predecessors, (56), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (22), 11 states have call predecessors, (22), 14 states have call successors, (22) [2025-03-03 14:35:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2025-03-03 14:35:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:35:49,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:49,464 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:49,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:35:49,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:49,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:49,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1425680307, now seen corresponding path program 4 times [2025-03-03 14:35:49,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:49,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950254739] [2025-03-03 14:35:49,665 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:35:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:49,672 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-03-03 14:35:49,679 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:35:49,680 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:35:49,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 17 proven. 174 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-03 14:35:49,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:49,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950254739] [2025-03-03 14:35:49,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950254739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:49,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168214141] [2025-03-03 14:35:49,912 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:35:49,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:49,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:49,916 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) [2025-03-03 14:35:49,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:35:49,969 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-03-03 14:35:49,986 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:35:49,986 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:35:49,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:49,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 14:35:49,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-03 14:35:50,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 14:35:53,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168214141] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:53,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:53,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 25] total 32 [2025-03-03 14:35:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266665804] [2025-03-03 14:35:53,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 14:35:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:53,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 14:35:53,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:35:53,894 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 32 states, 29 states have (on average 2.103448275862069) internal successors, (61), 32 states have internal predecessors, (61), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (25), 13 states have call predecessors, (25), 16 states have call successors, (25) [2025-03-03 14:35:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:54,062 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2025-03-03 14:35:54,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:35:54,063 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.103448275862069) internal successors, (61), 32 states have internal predecessors, (61), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (25), 13 states have call predecessors, (25), 16 states have call successors, (25) Word has length 70 [2025-03-03 14:35:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:54,064 INFO L225 Difference]: With dead ends: 67 [2025-03-03 14:35:54,064 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 14:35:54,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 122 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=608, Invalid=1372, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 14:35:54,065 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 65 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:54,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 130 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 14:35:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-03-03 14:35:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 14 states have return successors, (15), 14 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:35:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2025-03-03 14:35:54,071 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 70 [2025-03-03 14:35:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:54,071 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2025-03-03 14:35:54,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.103448275862069) internal successors, (61), 32 states have internal predecessors, (61), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (25), 13 states have call predecessors, (25), 16 states have call successors, (25) [2025-03-03 14:35:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2025-03-03 14:35:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 14:35:54,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:54,072 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:54,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:35:54,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:54,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:54,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash -977952836, now seen corresponding path program 5 times [2025-03-03 14:35:54,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:54,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21498343] [2025-03-03 14:35:54,273 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:35:54,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:54,281 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 88 statements into 14 equivalence classes. [2025-03-03 14:35:54,304 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:35:54,304 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-03 14:35:54,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 25 proven. 260 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-03 14:35:54,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:54,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21498343] [2025-03-03 14:35:54,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21498343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:54,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578532877] [2025-03-03 14:35:54,673 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:35:54,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:54,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:54,675 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) [2025-03-03 14:35:54,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:35:54,777 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 88 statements into 14 equivalence classes. [2025-03-03 14:35:54,797 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:35:54,798 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-03 14:35:54,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:54,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 14:35:54,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 14:35:54,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:36:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-03 14:36:02,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578532877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:36:02,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:36:02,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 31] total 36 [2025-03-03 14:36:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171761458] [2025-03-03 14:36:02,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:36:02,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 14:36:02,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:36:02,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 14:36:02,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=948, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:36:02,118 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 36 states, 33 states have (on average 2.090909090909091) internal successors, (69), 36 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (30), 15 states have call predecessors, (30), 18 states have call successors, (30) [2025-03-03 14:36:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:36:02,297 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2025-03-03 14:36:02,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:36:02,297 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.090909090909091) internal successors, (69), 36 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (30), 15 states have call predecessors, (30), 18 states have call successors, (30) Word has length 88 [2025-03-03 14:36:02,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:36:02,298 INFO L225 Difference]: With dead ends: 73 [2025-03-03 14:36:02,298 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 14:36:02,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 157 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=760, Invalid=1690, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 14:36:02,313 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:36:02,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 138 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:36:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 14:36:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2025-03-03 14:36:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 16 states have return successors, (17), 16 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:36:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2025-03-03 14:36:02,321 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 88 [2025-03-03 14:36:02,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:36:02,322 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2025-03-03 14:36:02,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.090909090909091) internal successors, (69), 36 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (30), 15 states have call predecessors, (30), 18 states have call successors, (30) [2025-03-03 14:36:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2025-03-03 14:36:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 14:36:02,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:36:02,323 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:36:02,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:36:02,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:36:02,524 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:36:02,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:36:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1090669276, now seen corresponding path program 6 times [2025-03-03 14:36:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:36:02,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917908508] [2025-03-03 14:36:02,524 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:36:02,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:36:02,532 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 100 statements into 16 equivalence classes. [2025-03-03 14:36:02,559 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:36:02,559 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-03-03 14:36:02,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-03-03 14:36:03,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:36:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917908508] [2025-03-03 14:36:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917908508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:36:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194675209] [2025-03-03 14:36:03,251 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:36:03,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:36:03,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:36:03,253 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) [2025-03-03 14:36:03,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:36:03,451 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 100 statements into 16 equivalence classes. [2025-03-03 14:36:03,479 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:36:03,479 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-03-03 14:36:03,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:03,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-03 14:36:03,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:36:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-03-03 14:36:03,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:36:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-03-03 14:36:04,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194675209] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:36:04,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:36:04,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2025-03-03 14:36:04,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018494820] [2025-03-03 14:36:04,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:36:04,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 14:36:04,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:36:04,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 14:36:04,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 14:36:04,248 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:36:04,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:36:04,494 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2025-03-03 14:36:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-03 14:36:04,494 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2025-03-03 14:36:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:36:04,495 INFO L225 Difference]: With dead ends: 73 [2025-03-03 14:36:04,495 INFO L226 Difference]: Without dead ends: 66 [2025-03-03 14:36:04,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 14:36:04,496 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:36:04,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1153 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:36:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-03 14:36:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2025-03-03 14:36:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 2 states have call predecessors, (3), 17 states have return successors, (18), 17 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:36:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2025-03-03 14:36:04,502 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 100 [2025-03-03 14:36:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:36:04,502 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2025-03-03 14:36:04,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:36:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2025-03-03 14:36:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 14:36:04,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:36:04,504 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:36:04,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:36:04,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:36:04,707 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:36:04,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:36:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash -37617325, now seen corresponding path program 7 times [2025-03-03 14:36:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:36:04,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326690335] [2025-03-03 14:36:04,707 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:36:04,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:36:04,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:36:04,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:36:04,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:36:04,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 330 proven. 122 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-03 14:36:05,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:36:05,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326690335] [2025-03-03 14:36:05,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326690335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:36:05,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011710805] [2025-03-03 14:36:05,094 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:36:05,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:36:05,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:36:05,097 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) [2025-03-03 14:36:05,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:36:05,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:36:05,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:36:05,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:36:05,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:05,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 14:36:05,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:36:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 14:36:05,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:36:05,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011710805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:36:05,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:36:05,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [23] total 26 [2025-03-03 14:36:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959457135] [2025-03-03 14:36:05,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:36:05,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 14:36:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:36:05,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 14:36:05,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:36:05,452 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:36:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:36:05,647 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-03-03 14:36:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:36:05,647 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2025-03-03 14:36:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:36:05,648 INFO L225 Difference]: With dead ends: 66 [2025-03-03 14:36:05,648 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:36:05,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=534, Invalid=1188, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 14:36:05,649 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:36:05,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 142 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:36:05,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:36:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:36:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:36:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:36:05,649 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2025-03-03 14:36:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:36:05,649 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:36:05,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:36:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:36:05,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:36:05,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:36:05,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:36:05,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:36:05,859 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1] [2025-03-03 14:36:05,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:36:06,423 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:36:06,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:36:06 BoogieIcfgContainer [2025-03-03 14:36:06,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:36:06,427 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:36:06,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:36:06,427 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:36:06,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:35:44" (3/4) ... [2025-03-03 14:36:06,429 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:36:06,437 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure id [2025-03-03 14:36:06,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 14:36:06,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 14:36:06,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 14:36:06,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:36:06,486 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:36:06,486 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:36:06,486 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:36:06,487 INFO L158 Benchmark]: Toolchain (without parser) took 22306.22ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 133.8MB in the beginning and 165.6MB in the end (delta: -31.9MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2025-03-03 14:36:06,487 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:36:06,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.92ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 123.3MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:36:06,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.11ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 122.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:36:06,488 INFO L158 Benchmark]: Boogie Preprocessor took 22.72ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 121.1MB in the end (delta: 885.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:36:06,489 INFO L158 Benchmark]: IcfgBuilder took 161.11ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 111.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:36:06,489 INFO L158 Benchmark]: TraceAbstraction took 21850.14ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 110.9MB in the beginning and 171.2MB in the end (delta: -60.3MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. [2025-03-03 14:36:06,489 INFO L158 Benchmark]: Witness Printer took 59.75ms. Allocated memory is still 243.3MB. Free memory was 171.2MB in the beginning and 165.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:36:06,491 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 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.92ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 123.3MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.11ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 122.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.72ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 121.1MB in the end (delta: 885.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 161.11ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 111.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21850.14ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 110.9MB in the beginning and 171.2MB in the end (delta: -60.3MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. * Witness Printer took 59.75ms. Allocated memory is still 243.3MB. Free memory was 171.2MB in the beginning and 165.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 15]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 8, TraceHistogramMax: 17, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 405 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 1843 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1698 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1241 IncrementalHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 145 mSDtfsCounter, 1241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1049 GetRequests, 761 SyntacticMatches, 40 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2720 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=7, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 942 NumberOfCodeBlocks, 942 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 1281 ConstructedInterpolants, 0 QuantifiedInterpolants, 3492 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1218 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 21 InterpolantComputations, 2 PerfectInterpolantSequences, 3651/6758 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-03 14:36:06,506 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 Result: TRUE