./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/Fibonacci02.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 b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:42:19,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:42:19,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:42:19,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:42:19,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:42:19,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:42:19,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:42:19,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:42:19,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:42:19,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:42:19,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:42:19,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:42:19,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:42:19,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:42:19,489 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:42:19,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:42:19,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:42:19,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:42:19,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:42:19,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:42:19,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:42:19,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:42:19,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:42:19,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:42:19,490 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:42:19,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:42:19,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:42:19,490 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:42:19,490 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:42:19,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:42:19,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:42:19,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:42:19,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:19,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:42:19,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:42:19,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:42:19,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:42:19,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:42:19,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:42:19,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:42:19,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:42:19,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:42:19,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:42:19,492 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 -> b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 [2025-03-08 05:42:19,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:42:19,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:42:19,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:42:19,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:42:19,711 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:42:19,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2025-03-08 05:42:20,818 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57df654a9/85c13cc0728c45d48be1f8aa0fa64fd6/FLAG4e5b43a28 [2025-03-08 05:42:21,020 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:42:21,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2025-03-08 05:42:21,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57df654a9/85c13cc0728c45d48be1f8aa0fa64fd6/FLAG4e5b43a28 [2025-03-08 05:42:21,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57df654a9/85c13cc0728c45d48be1f8aa0fa64fd6 [2025-03-08 05:42:21,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:42:21,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:42:21,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:21,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:42:21,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:42:21,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5224d853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21, skipping insertion in model container [2025-03-08 05:42:21,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:42:21,525 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/Fibonacci02.c[715,728] [2025-03-08 05:42:21,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:21,538 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:42:21,550 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/Fibonacci02.c[715,728] [2025-03-08 05:42:21,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:21,563 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:42:21,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21 WrapperNode [2025-03-08 05:42:21,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:21,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:21,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:42:21,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:42:21,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,593 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-03-08 05:42:21,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:21,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:42:21,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:42:21,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:42:21,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,616 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-08 05:42:21,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,618 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:42:21,620 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:42:21,620 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:42:21,620 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:42:21,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (1/1) ... [2025-03-08 05:42:21,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:21,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:21,645 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-08 05:42:21,650 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-08 05:42:21,665 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-08 05:42:21,666 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-08 05:42:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:42:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:42:21,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:42:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:42:21,711 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:42:21,712 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:42:21,763 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-03-08 05:42:21,792 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 05:42:21,792 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:42:21,800 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:42:21,801 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:42:21,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:21 BoogieIcfgContainer [2025-03-08 05:42:21,801 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:42:21,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:42:21,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:42:21,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:42:21,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:42:21" (1/3) ... [2025-03-08 05:42:21,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f758ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:21, skipping insertion in model container [2025-03-08 05:42:21,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:21" (2/3) ... [2025-03-08 05:42:21,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f758ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:21, skipping insertion in model container [2025-03-08 05:42:21,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:21" (3/3) ... [2025-03-08 05:42:21,811 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2025-03-08 05:42:21,820 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:42:21,821 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci02.c that has 2 procedures, 19 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:42:21,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:42:21,872 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;@16fd1c51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:42:21,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:42:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:42:21,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 05:42:21,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:21,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:21,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:21,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash 356900110, now seen corresponding path program 1 times [2025-03-08 05:42:21,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:21,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590515788] [2025-03-08 05:42:21,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:21,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:21,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 05:42:21,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 05:42:21,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:21,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:22,028 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-08 05:42:22,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:22,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590515788] [2025-03-08 05:42:22,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590515788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:22,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:22,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:22,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158879061] [2025-03-08 05:42:22,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:22,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:22,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:22,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:22,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:22,048 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 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-08 05:42:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:22,122 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2025-03-08 05:42:22,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:22,123 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-08 05:42:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:22,129 INFO L225 Difference]: With dead ends: 30 [2025-03-08 05:42:22,129 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 05:42:22,131 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-08 05:42:22,132 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:22,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 48 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 05:42:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-08 05:42:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:42:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 05:42:22,160 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-03-08 05:42:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:22,161 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 05:42:22,161 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-08 05:42:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 05:42:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 05:42:22,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:22,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:22,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:42:22,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:22,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:22,163 INFO L85 PathProgramCache]: Analyzing trace with hash 711000375, now seen corresponding path program 1 times [2025-03-08 05:42:22,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:22,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344747738] [2025-03-08 05:42:22,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:22,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:22,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 05:42:22,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 05:42:22,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:22,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:22,224 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-08 05:42:22,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344747738] [2025-03-08 05:42:22,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344747738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:22,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:22,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212594128] [2025-03-08 05:42:22,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:22,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:22,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:22,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:22,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:22,226 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:22,271 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-08 05:42:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:22,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-08 05:42:22,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:22,272 INFO L225 Difference]: With dead ends: 24 [2025-03-08 05:42:22,272 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 05:42:22,272 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-08 05:42:22,272 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:22,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 05:42:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-08 05:42:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:42:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 05:42:22,279 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-03-08 05:42:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:22,279 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 05:42:22,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 05:42:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:42:22,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:22,280 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:22,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:42:22,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:22,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:22,281 INFO L85 PathProgramCache]: Analyzing trace with hash -155002719, now seen corresponding path program 1 times [2025-03-08 05:42:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:22,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116744042] [2025-03-08 05:42:22,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:22,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:42:22,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:42:22,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:22,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:22,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116744042] [2025-03-08 05:42:22,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116744042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028893376] [2025-03-08 05:42:22,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:22,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:22,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:22,389 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-08 05:42:22,391 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-08 05:42:22,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:42:22,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:42:22,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:22,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:22,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:42:22,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:22,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:42:22,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028893376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:22,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:22,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2025-03-08 05:42:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936169754] [2025-03-08 05:42:22,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:22,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:42:22,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:22,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:42:22,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:42:22,723 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 05:42:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:22,794 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-03-08 05:42:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:42:22,794 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2025-03-08 05:42:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:22,795 INFO L225 Difference]: With dead ends: 35 [2025-03-08 05:42:22,795 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 05:42:22,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:42:22,796 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:22,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:22,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 05:42:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 05:42:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:42:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-08 05:42:22,800 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2025-03-08 05:42:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:22,800 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-08 05:42:22,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 05:42:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-08 05:42:22,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 05:42:22,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:22,801 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:22,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:42:23,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:23,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:23,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash -753382920, now seen corresponding path program 1 times [2025-03-08 05:42:23,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:23,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691403564] [2025-03-08 05:42:23,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:23,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 05:42:23,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 05:42:23,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:23,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:42:23,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:23,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691403564] [2025-03-08 05:42:23,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691403564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:23,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131203621] [2025-03-08 05:42:23,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:23,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:23,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:23,079 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-08 05:42:23,081 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-08 05:42:23,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 05:42:23,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 05:42:23,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:23,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:23,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:42:23,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:42:23,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:42:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131203621] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:23,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:23,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2025-03-08 05:42:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770192449] [2025-03-08 05:42:23,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:23,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:42:23,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:23,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:42:23,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:42:23,247 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:42:23,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:23,292 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-03-08 05:42:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:42:23,293 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2025-03-08 05:42:23,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:23,293 INFO L225 Difference]: With dead ends: 29 [2025-03-08 05:42:23,293 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 05:42:23,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:42:23,294 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:23,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 05:42:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 05:42:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:42:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-08 05:42:23,299 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2025-03-08 05:42:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:23,299 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-08 05:42:23,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:42:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-03-08 05:42:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 05:42:23,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:23,301 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:23,307 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-08 05:42:23,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 05:42:23,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:23,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1816344841, now seen corresponding path program 2 times [2025-03-08 05:42:23,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:23,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673420426] [2025-03-08 05:42:23,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:23,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:23,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 05:42:23,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:42:23,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:23,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:42:23,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:23,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673420426] [2025-03-08 05:42:23,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673420426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:23,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171349483] [2025-03-08 05:42:23,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:23,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:23,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:23,649 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-08 05:42:23,652 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-08 05:42:23,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 05:42:23,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:42:23,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:23,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:23,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:42:23,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:42:23,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:42:24,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171349483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:24,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:24,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 18 [2025-03-08 05:42:24,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053824190] [2025-03-08 05:42:24,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:24,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 05:42:24,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:24,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 05:42:24,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:42:24,072 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 18 states, 16 states have (on average 2.8125) internal successors, (45), 18 states have internal predecessors, (45), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:42:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:24,249 INFO L93 Difference]: Finished difference Result 60 states and 93 transitions. [2025-03-08 05:42:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:42:24,249 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.8125) internal successors, (45), 18 states have internal predecessors, (45), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2025-03-08 05:42:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:24,250 INFO L225 Difference]: With dead ends: 60 [2025-03-08 05:42:24,250 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 05:42:24,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:42:24,251 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:24,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 102 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 05:42:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 05:42:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-08 05:42:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-08 05:42:24,255 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2025-03-08 05:42:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:24,256 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-08 05:42:24,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.8125) internal successors, (45), 18 states have internal predecessors, (45), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:42:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-08 05:42:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:42:24,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:24,257 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:24,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:24,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:24,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:24,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash -480339407, now seen corresponding path program 3 times [2025-03-08 05:42:24,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673586602] [2025-03-08 05:42:24,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:24,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:24,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 8 equivalence classes. [2025-03-08 05:42:24,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 42 of 65 statements. [2025-03-08 05:42:24,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 05:42:24,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 67 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 05:42:24,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:24,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673586602] [2025-03-08 05:42:24,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673586602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:24,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317359747] [2025-03-08 05:42:24,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:24,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:24,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:24,567 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-08 05:42:24,570 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-08 05:42:24,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 8 equivalence classes. [2025-03-08 05:42:24,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 42 of 65 statements. [2025-03-08 05:42:24,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 05:42:24,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:24,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:42:24,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-08 05:42:24,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 68 proven. 30 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 05:42:24,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317359747] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:24,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:24,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 13 [2025-03-08 05:42:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679950877] [2025-03-08 05:42:24,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:24,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:42:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:24,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:42:24,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:42:24,912 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 13 states have internal predecessors, (38), 7 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-08 05:42:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:25,003 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-08 05:42:25,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:42:25,004 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 13 states have internal predecessors, (38), 7 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 65 [2025-03-08 05:42:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:25,005 INFO L225 Difference]: With dead ends: 45 [2025-03-08 05:42:25,005 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 05:42:25,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:42:25,005 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:25,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 56 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:25,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 05:42:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2025-03-08 05:42:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-08 05:42:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-08 05:42:25,012 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 65 [2025-03-08 05:42:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:25,013 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-08 05:42:25,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 13 states have internal predecessors, (38), 7 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-08 05:42:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-08 05:42:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:42:25,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:25,014 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:25,020 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-08 05:42:25,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:25,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:25,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash 292278265, now seen corresponding path program 4 times [2025-03-08 05:42:25,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:25,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391540494] [2025-03-08 05:42:25,216 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:42:25,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:25,221 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-08 05:42:25,227 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 93 statements. [2025-03-08 05:42:25,227 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:42:25,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-08 05:42:25,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:25,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391540494] [2025-03-08 05:42:25,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391540494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:25,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422862767] [2025-03-08 05:42:25,333 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:42:25,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:25,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:25,335 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-08 05:42:25,337 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-08 05:42:25,367 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-08 05:42:25,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 93 statements. [2025-03-08 05:42:25,386 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:42:25,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:25,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:42:25,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-08 05:42:25,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-03-08 05:42:25,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422862767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:25,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2025-03-08 05:42:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980106620] [2025-03-08 05:42:25,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:25,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:42:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:25,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:42:25,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:42:25,856 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:42:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:25,928 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2025-03-08 05:42:25,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:42:25,928 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 93 [2025-03-08 05:42:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:25,929 INFO L225 Difference]: With dead ends: 50 [2025-03-08 05:42:25,929 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 05:42:25,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 180 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:42:25,930 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:25,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 63 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 05:42:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-03-08 05:42:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-08 05:42:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2025-03-08 05:42:25,936 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 93 [2025-03-08 05:42:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:25,936 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2025-03-08 05:42:25,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:42:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2025-03-08 05:42:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:42:25,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:25,937 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:25,943 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-08 05:42:26,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:26,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:26,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash 991892308, now seen corresponding path program 5 times [2025-03-08 05:42:26,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:26,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100062587] [2025-03-08 05:42:26,143 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:42:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:26,148 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 120 statements into 14 equivalence classes. [2025-03-08 05:42:26,153 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 61 of 120 statements. [2025-03-08 05:42:26,153 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 05:42:26,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 135 proven. 258 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2025-03-08 05:42:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100062587] [2025-03-08 05:42:26,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100062587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343751952] [2025-03-08 05:42:26,294 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:42:26,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:26,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:26,296 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-08 05:42:26,297 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-08 05:42:26,331 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 120 statements into 14 equivalence classes. [2025-03-08 05:42:26,343 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 61 of 120 statements. [2025-03-08 05:42:26,343 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 05:42:26,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:26,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:42:26,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 422 proven. 118 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-08 05:42:26,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 133 proven. 274 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-08 05:42:27,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343751952] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:27,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:27,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 21 [2025-03-08 05:42:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299305117] [2025-03-08 05:42:27,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:27,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 05:42:27,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:27,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 05:42:27,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:42:27,101 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (24), 9 states have call predecessors, (24), 13 states have call successors, (24) [2025-03-08 05:42:27,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:27,276 INFO L93 Difference]: Finished difference Result 87 states and 130 transitions. [2025-03-08 05:42:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:42:27,276 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (24), 9 states have call predecessors, (24), 13 states have call successors, (24) Word has length 120 [2025-03-08 05:42:27,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:27,278 INFO L225 Difference]: With dead ends: 87 [2025-03-08 05:42:27,280 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 05:42:27,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 228 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=752, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 05:42:27,281 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 77 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:27,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 89 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 05:42:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-03-08 05:42:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-08 05:42:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2025-03-08 05:42:27,288 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 120 [2025-03-08 05:42:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:27,289 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2025-03-08 05:42:27,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (24), 9 states have call predecessors, (24), 13 states have call successors, (24) [2025-03-08 05:42:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2025-03-08 05:42:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:42:27,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:27,290 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:27,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:42:27,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:27,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:27,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:27,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2129311565, now seen corresponding path program 6 times [2025-03-08 05:42:27,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:27,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493403184] [2025-03-08 05:42:27,491 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:42:27,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:27,496 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 133 statements into 13 equivalence classes. [2025-03-08 05:42:27,515 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 116 of 133 statements. [2025-03-08 05:42:27,515 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-08 05:42:27,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 55 proven. 317 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 05:42:27,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:27,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493403184] [2025-03-08 05:42:27,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493403184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:27,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886503775] [2025-03-08 05:42:27,649 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:42:27,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:27,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:27,651 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-08 05:42:27,653 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-08 05:42:27,686 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 133 statements into 13 equivalence classes. [2025-03-08 05:42:27,712 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 116 of 133 statements. [2025-03-08 05:42:27,713 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-08 05:42:27,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:27,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 05:42:27,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-08 05:42:27,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 352 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2025-03-08 05:42:28,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886503775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:28,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:28,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2025-03-08 05:42:28,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7037992] [2025-03-08 05:42:28,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:28,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 05:42:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:28,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 05:42:28,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:42:28,391 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-08 05:42:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:28,485 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2025-03-08 05:42:28,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:42:28,486 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) Word has length 133 [2025-03-08 05:42:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:28,487 INFO L225 Difference]: With dead ends: 56 [2025-03-08 05:42:28,487 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 05:42:28,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 258 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:42:28,488 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:28,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 79 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:28,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 05:42:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-08 05:42:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-08 05:42:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2025-03-08 05:42:28,494 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 133 [2025-03-08 05:42:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:28,494 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2025-03-08 05:42:28,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-08 05:42:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2025-03-08 05:42:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 05:42:28,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:28,497 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:28,503 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-08 05:42:28,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:28,700 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:28,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:28,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1661124811, now seen corresponding path program 7 times [2025-03-08 05:42:28,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:28,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963885318] [2025-03-08 05:42:28,701 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:42:28,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:28,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 05:42:28,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 05:42:28,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:28,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 117 proven. 639 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2025-03-08 05:42:28,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:28,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963885318] [2025-03-08 05:42:28,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963885318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:28,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968217518] [2025-03-08 05:42:28,943 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:42:28,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:28,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:28,945 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:28,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:42:28,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 05:42:29,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 05:42:29,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:29,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:29,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:42:29,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 117 proven. 639 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2025-03-08 05:42:29,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 117 proven. 679 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2025-03-08 05:42:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968217518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:30,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:30,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2025-03-08 05:42:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766807524] [2025-03-08 05:42:30,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:30,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 05:42:30,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:30,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 05:42:30,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:42:30,070 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2025-03-08 05:42:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:30,182 INFO L93 Difference]: Finished difference Result 61 states and 91 transitions. [2025-03-08 05:42:30,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:42:30,183 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) Word has length 201 [2025-03-08 05:42:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:30,184 INFO L225 Difference]: With dead ends: 61 [2025-03-08 05:42:30,184 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 05:42:30,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 394 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:42:30,185 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 66 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:30,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 81 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:30,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 05:42:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 05:42:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 38 states have internal predecessors, (44), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (34), 13 states have call predecessors, (34), 9 states have call successors, (34) [2025-03-08 05:42:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2025-03-08 05:42:30,190 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 201 [2025-03-08 05:42:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:30,194 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2025-03-08 05:42:30,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2025-03-08 05:42:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2025-03-08 05:42:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-08 05:42:30,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:30,200 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 53, 32, 32, 32, 32, 32, 32, 32, 21, 12, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:30,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:30,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:42:30,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:30,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash 580612719, now seen corresponding path program 8 times [2025-03-08 05:42:30,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:30,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613099324] [2025-03-08 05:42:30,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:30,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:30,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 447 statements into 2 equivalence classes. [2025-03-08 05:42:30,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 05:42:30,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:30,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1918 refuted. 0 times theorem prover too weak. 9431 trivial. 0 not checked. [2025-03-08 05:42:30,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:30,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613099324] [2025-03-08 05:42:30,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613099324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:30,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208252652] [2025-03-08 05:42:30,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:30,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:30,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:30,844 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:30,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:42:30,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 447 statements into 2 equivalence classes. [2025-03-08 05:42:30,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 05:42:30,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:30,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:30,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:42:30,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1918 refuted. 0 times theorem prover too weak. 9431 trivial. 0 not checked. [2025-03-08 05:42:31,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1975 refuted. 0 times theorem prover too weak. 9374 trivial. 0 not checked. [2025-03-08 05:42:32,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208252652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:32,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:32,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2025-03-08 05:42:32,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27619115] [2025-03-08 05:42:32,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:32,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 05:42:32,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:32,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 05:42:32,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:42:32,807 INFO L87 Difference]: Start difference. First operand 57 states and 87 transitions. Second operand has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-08 05:42:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:32,964 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2025-03-08 05:42:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:42:32,965 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) Word has length 447 [2025-03-08 05:42:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:32,966 INFO L225 Difference]: With dead ends: 66 [2025-03-08 05:42:32,966 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 05:42:32,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 885 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:42:32,967 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 108 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:32,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 94 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 05:42:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 05:42:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.119047619047619) internal successors, (47), 41 states have internal predecessors, (47), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (46), 15 states have call predecessors, (46), 10 states have call successors, (46) [2025-03-08 05:42:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 103 transitions. [2025-03-08 05:42:32,980 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 103 transitions. Word has length 447 [2025-03-08 05:42:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:32,980 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 103 transitions. [2025-03-08 05:42:32,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-08 05:42:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 103 transitions. [2025-03-08 05:42:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 912 [2025-03-08 05:42:32,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:32,997 INFO L218 NwaCegarLoop]: trace histogram [133, 133, 109, 66, 66, 66, 66, 66, 66, 66, 43, 24, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:33,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 05:42:33,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:33,198 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:33,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash 368675247, now seen corresponding path program 9 times [2025-03-08 05:42:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:33,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042624794] [2025-03-08 05:42:33,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:33,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 911 statements into 113 equivalence classes. [2025-03-08 05:42:33,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 96 of 911 statements. [2025-03-08 05:42:33,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-08 05:42:33,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 49578 backedges. 3359 proven. 30 refuted. 0 times theorem prover too weak. 46189 trivial. 0 not checked. [2025-03-08 05:42:33,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:33,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042624794] [2025-03-08 05:42:33,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042624794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:33,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724064975] [2025-03-08 05:42:33,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:33,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:33,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:33,296 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:33,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:42:33,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 911 statements into 113 equivalence classes. [2025-03-08 05:42:33,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 96 of 911 statements. [2025-03-08 05:42:33,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-08 05:42:33,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:33,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:42:33,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 49578 backedges. 3833 proven. 34 refuted. 0 times theorem prover too weak. 45711 trivial. 0 not checked. [2025-03-08 05:42:33,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 49578 backedges. 3833 proven. 41 refuted. 0 times theorem prover too weak. 45704 trivial. 0 not checked. [2025-03-08 05:42:35,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724064975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:35,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:35,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 16 [2025-03-08 05:42:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954391806] [2025-03-08 05:42:35,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:35,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 05:42:35,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:35,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 05:42:35,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:42:35,569 INFO L87 Difference]: Start difference. First operand 62 states and 103 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 8 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (18), 10 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-08 05:42:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:35,685 INFO L93 Difference]: Finished difference Result 125 states and 255 transitions. [2025-03-08 05:42:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:42:35,686 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 8 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (18), 10 states have call predecessors, (18), 8 states have call successors, (18) Word has length 911 [2025-03-08 05:42:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:35,687 INFO L225 Difference]: With dead ends: 125 [2025-03-08 05:42:35,687 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 05:42:35,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1835 GetRequests, 1810 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:42:35,690 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:35,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 94 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 05:42:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-03-08 05:42:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 9 states have return successors, (44), 15 states have call predecessors, (44), 11 states have call successors, (44) [2025-03-08 05:42:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 101 transitions. [2025-03-08 05:42:35,698 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 101 transitions. Word has length 911 [2025-03-08 05:42:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:35,699 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 101 transitions. [2025-03-08 05:42:35,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 8 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (18), 10 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-08 05:42:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 101 transitions. [2025-03-08 05:42:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2025-03-08 05:42:35,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:35,704 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 95, 59, 59, 59, 59, 59, 59, 59, 36, 24, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:35,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:35,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 05:42:35,905 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:35,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1577279091, now seen corresponding path program 10 times [2025-03-08 05:42:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:35,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283869119] [2025-03-08 05:42:35,905 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:42:35,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:35,919 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 813 statements into 2 equivalence classes. [2025-03-08 05:42:35,967 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 692 of 813 statements. [2025-03-08 05:42:35,967 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:42:35,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 39393 backedges. 687 proven. 4248 refuted. 0 times theorem prover too weak. 34458 trivial. 0 not checked. [2025-03-08 05:42:36,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:36,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283869119] [2025-03-08 05:42:36,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283869119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:36,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037393050] [2025-03-08 05:42:36,508 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:42:36,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:36,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:36,510 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:36,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 05:42:36,614 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 813 statements into 2 equivalence classes. [2025-03-08 05:42:36,715 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 692 of 813 statements. [2025-03-08 05:42:36,715 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:42:36,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:36,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 05:42:36,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 39393 backedges. 687 proven. 4248 refuted. 0 times theorem prover too weak. 34458 trivial. 0 not checked. [2025-03-08 05:42:36,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 39393 backedges. 687 proven. 4325 refuted. 0 times theorem prover too weak. 34381 trivial. 0 not checked. [2025-03-08 05:42:39,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037393050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:39,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:39,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 20 [2025-03-08 05:42:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287374552] [2025-03-08 05:42:39,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:39,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:42:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:39,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:42:39,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:42:39,365 INFO L87 Difference]: Start difference. First operand 66 states and 101 transitions. Second operand has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 states have internal predecessors, (63), 17 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (24), 9 states have call predecessors, (24), 17 states have call successors, (24) [2025-03-08 05:42:39,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:39,486 INFO L93 Difference]: Finished difference Result 75 states and 122 transitions. [2025-03-08 05:42:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:42:39,487 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 states have internal predecessors, (63), 17 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (24), 9 states have call predecessors, (24), 17 states have call successors, (24) Word has length 813 [2025-03-08 05:42:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:39,490 INFO L225 Difference]: With dead ends: 75 [2025-03-08 05:42:39,490 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 05:42:39,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1650 GetRequests, 1616 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=467, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:42:39,491 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:39,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 105 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 05:42:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-08 05:42:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 47 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (57), 17 states have call predecessors, (57), 12 states have call successors, (57) [2025-03-08 05:42:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 118 transitions. [2025-03-08 05:42:39,501 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 118 transitions. Word has length 813 [2025-03-08 05:42:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:39,502 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 118 transitions. [2025-03-08 05:42:39,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 states have internal predecessors, (63), 17 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (24), 9 states have call predecessors, (24), 17 states have call successors, (24) [2025-03-08 05:42:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 118 transitions. [2025-03-08 05:42:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1018 [2025-03-08 05:42:39,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:39,507 INFO L218 NwaCegarLoop]: trace histogram [149, 149, 119, 74, 74, 74, 74, 74, 74, 74, 45, 30, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:39,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:39,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 05:42:39,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:39,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash -725112719, now seen corresponding path program 11 times [2025-03-08 05:42:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:39,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630670401] [2025-03-08 05:42:39,709 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:42:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:39,731 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1017 statements into 131 equivalence classes. [2025-03-08 05:42:39,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) and asserted 187 of 1017 statements. [2025-03-08 05:42:39,760 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2025-03-08 05:42:39,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 61929 backedges. 2339 proven. 4947 refuted. 0 times theorem prover too weak. 54643 trivial. 0 not checked. [2025-03-08 05:42:40,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630670401] [2025-03-08 05:42:40,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630670401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23679813] [2025-03-08 05:42:40,061 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:42:40,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:40,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:40,063 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:40,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 05:42:40,197 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1017 statements into 131 equivalence classes. [2025-03-08 05:42:40,238 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) and asserted 187 of 1017 statements. [2025-03-08 05:42:40,238 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2025-03-08 05:42:40,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:40,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 05:42:40,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 61929 backedges. 29061 proven. 356 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-03-08 05:42:40,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 61929 backedges. 2461 proven. 5361 refuted. 0 times theorem prover too weak. 54107 trivial. 0 not checked. [2025-03-08 05:42:43,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23679813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:43,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:43,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 19] total 28 [2025-03-08 05:42:43,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639447553] [2025-03-08 05:42:43,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:43,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:42:43,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:43,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:42:43,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:42:43,009 INFO L87 Difference]: Start difference. First operand 71 states and 118 transitions. Second operand has 28 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 28 states have internal predecessors, (86), 22 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (34), 11 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-08 05:42:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:43,296 INFO L93 Difference]: Finished difference Result 152 states and 294 transitions. [2025-03-08 05:42:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 05:42:43,297 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 28 states have internal predecessors, (86), 22 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (34), 11 states have call predecessors, (34), 22 states have call successors, (34) Word has length 1017 [2025-03-08 05:42:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:43,298 INFO L225 Difference]: With dead ends: 152 [2025-03-08 05:42:43,298 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 05:42:43,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2069 GetRequests, 2018 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=485, Invalid=1407, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 05:42:43,299 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 137 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:43,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 142 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:42:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 05:42:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2025-03-08 05:42:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 13 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (52), 17 states have call predecessors, (52), 13 states have call successors, (52) [2025-03-08 05:42:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2025-03-08 05:42:43,312 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 1017 [2025-03-08 05:42:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:43,312 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2025-03-08 05:42:43,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 28 states have internal predecessors, (86), 22 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (34), 11 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-08 05:42:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2025-03-08 05:42:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1156 [2025-03-08 05:42:43,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:43,319 INFO L218 NwaCegarLoop]: trace histogram [169, 169, 137, 84, 84, 84, 84, 84, 84, 84, 53, 32, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:43,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:43,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 05:42:43,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:43,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:43,520 INFO L85 PathProgramCache]: Analyzing trace with hash -538196969, now seen corresponding path program 12 times [2025-03-08 05:42:43,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:43,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296990667] [2025-03-08 05:42:43,520 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:42:43,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:43,538 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1155 statements into 147 equivalence classes. [2025-03-08 05:42:43,601 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) and asserted 250 of 1155 statements. [2025-03-08 05:42:43,601 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2025-03-08 05:42:43,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 80044 backedges. 2079 proven. 5410 refuted. 0 times theorem prover too weak. 72555 trivial. 0 not checked. [2025-03-08 05:42:43,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:43,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296990667] [2025-03-08 05:42:43,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296990667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:43,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487115326] [2025-03-08 05:42:43,809 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:42:43,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:43,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:43,811 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:43,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 05:42:43,970 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1155 statements into 147 equivalence classes. [2025-03-08 05:42:44,044 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) and asserted 250 of 1155 statements. [2025-03-08 05:42:44,045 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2025-03-08 05:42:44,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:44,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 05:42:44,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 80044 backedges. 2089 proven. 5393 refuted. 0 times theorem prover too weak. 72562 trivial. 0 not checked. [2025-03-08 05:42:44,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 80044 backedges. 2086 proven. 5466 refuted. 0 times theorem prover too weak. 72492 trivial. 0 not checked. [2025-03-08 05:42:47,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487115326] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:47,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:47,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 20] total 25 [2025-03-08 05:42:47,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860501882] [2025-03-08 05:42:47,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:47,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 05:42:47,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:47,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 05:42:47,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:42:47,606 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (29), 13 states have call predecessors, (29), 18 states have call successors, (29) [2025-03-08 05:42:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:47,747 INFO L93 Difference]: Finished difference Result 127 states and 343 transitions. [2025-03-08 05:42:47,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:42:47,747 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (29), 13 states have call predecessors, (29), 18 states have call successors, (29) Word has length 1155 [2025-03-08 05:42:47,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:47,751 INFO L225 Difference]: With dead ends: 127 [2025-03-08 05:42:47,751 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 05:42:47,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2336 GetRequests, 2297 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:42:47,753 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:47,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 174 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 05:42:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-08 05:42:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 13 states have call successors, (13), 7 states have call predecessors, (13), 11 states have return successors, (35), 18 states have call predecessors, (35), 13 states have call successors, (35) [2025-03-08 05:42:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2025-03-08 05:42:47,764 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 1155 [2025-03-08 05:42:47,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:47,765 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-03-08 05:42:47,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (29), 13 states have call predecessors, (29), 18 states have call successors, (29) [2025-03-08 05:42:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2025-03-08 05:42:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 979 [2025-03-08 05:42:47,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:47,769 INFO L218 NwaCegarLoop]: trace histogram [143, 143, 116, 71, 71, 71, 71, 71, 71, 71, 45, 27, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:47,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 05:42:47,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 05:42:47,973 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:47,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:47,973 INFO L85 PathProgramCache]: Analyzing trace with hash -407349628, now seen corresponding path program 13 times [2025-03-08 05:42:47,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:47,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926611979] [2025-03-08 05:42:47,974 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:42:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:47,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 978 statements into 1 equivalence classes. [2025-03-08 05:42:48,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 978 of 978 statements. [2025-03-08 05:42:48,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:48,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 57222 backedges. 1243 proven. 4289 refuted. 0 times theorem prover too weak. 51690 trivial. 0 not checked. [2025-03-08 05:42:48,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:48,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926611979] [2025-03-08 05:42:48,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926611979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:48,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610386352] [2025-03-08 05:42:48,752 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:42:48,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:48,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:48,754 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:48,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 05:42:48,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 978 statements into 1 equivalence classes. [2025-03-08 05:42:49,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 978 of 978 statements. [2025-03-08 05:42:49,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:49,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:49,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 2190 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 05:42:49,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 57222 backedges. 1375 proven. 5386 refuted. 0 times theorem prover too weak. 50461 trivial. 0 not checked. [2025-03-08 05:42:49,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 57222 backedges. 1381 proven. 5472 refuted. 0 times theorem prover too weak. 50369 trivial. 0 not checked. [2025-03-08 05:42:52,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610386352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:52,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:52,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 21] total 25 [2025-03-08 05:42:52,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574091674] [2025-03-08 05:42:52,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:52,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 05:42:52,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:52,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 05:42:52,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:42:52,517 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 25 states have internal predecessors, (74), 19 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (31), 13 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-08 05:42:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:52,690 INFO L93 Difference]: Finished difference Result 143 states and 229 transitions. [2025-03-08 05:42:52,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:42:52,691 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 25 states have internal predecessors, (74), 19 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (31), 13 states have call predecessors, (31), 19 states have call successors, (31) Word has length 978 [2025-03-08 05:42:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:52,692 INFO L225 Difference]: With dead ends: 143 [2025-03-08 05:42:52,693 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 05:42:52,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1981 GetRequests, 1940 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 05:42:52,694 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:52,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 162 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 05:42:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2025-03-08 05:42:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 13 states have call successors, (13), 7 states have call predecessors, (13), 11 states have return successors, (29), 18 states have call predecessors, (29), 13 states have call successors, (29) [2025-03-08 05:42:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2025-03-08 05:42:52,703 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 978 [2025-03-08 05:42:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:52,704 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2025-03-08 05:42:52,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 25 states have internal predecessors, (74), 19 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (31), 13 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-08 05:42:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2025-03-08 05:42:52,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2025-03-08 05:42:52,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:52,707 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:52,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 05:42:52,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:52,908 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:52,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1040415968, now seen corresponding path program 14 times [2025-03-08 05:42:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:52,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548184500] [2025-03-08 05:42:52,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:52,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:52,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 746 statements into 2 equivalence classes. [2025-03-08 05:42:52,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 746 of 746 statements. [2025-03-08 05:42:52,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:52,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2025-03-08 05:43:02,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:02,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548184500] [2025-03-08 05:43:02,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548184500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:02,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759080709] [2025-03-08 05:43:02,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:43:02,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:02,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:02,014 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:02,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 05:43:02,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 746 statements into 2 equivalence classes. [2025-03-08 05:43:02,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 746 of 746 statements. [2025-03-08 05:43:02,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:43:02,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:02,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 1675 conjuncts, 439 conjuncts are in the unsatisfiable core [2025-03-08 05:43:02,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2025-03-08 05:43:02,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2025-03-08 05:43:05,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759080709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:05,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:05,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2025-03-08 05:43:05,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212601440] [2025-03-08 05:43:05,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:05,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 05:43:05,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:05,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 05:43:05,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 05:43:05,947 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 19 states have internal predecessors, (42), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-08 05:43:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:06,214 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2025-03-08 05:43:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 05:43:06,214 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 19 states have internal predecessors, (42), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) Word has length 746 [2025-03-08 05:43:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:06,216 INFO L225 Difference]: With dead ends: 107 [2025-03-08 05:43:06,216 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 05:43:06,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1711 GetRequests, 1677 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 05:43:06,217 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:06,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1051 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:43:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 05:43:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2025-03-08 05:43:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 62 states have internal predecessors, (64), 17 states have call successors, (17), 7 states have call predecessors, (17), 14 states have return successors, (43), 25 states have call predecessors, (43), 17 states have call successors, (43) [2025-03-08 05:43:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2025-03-08 05:43:06,224 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 746 [2025-03-08 05:43:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:06,225 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2025-03-08 05:43:06,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 19 states have internal predecessors, (42), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-08 05:43:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2025-03-08 05:43:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2025-03-08 05:43:06,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:06,229 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 96, 59, 59, 59, 59, 59, 59, 59, 37, 23, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:06,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 05:43:06,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 05:43:06,430 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:06,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:06,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1157543490, now seen corresponding path program 15 times [2025-03-08 05:43:06,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:06,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776442678] [2025-03-08 05:43:06,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:43:06,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:06,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 814 statements into 104 equivalence classes. [2025-03-08 05:43:06,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) and asserted 437 of 814 statements. [2025-03-08 05:43:06,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2025-03-08 05:43:06,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 3881 proven. 794 refuted. 0 times theorem prover too weak. 34813 trivial. 0 not checked. [2025-03-08 05:43:06,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:06,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776442678] [2025-03-08 05:43:06,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776442678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:06,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366004744] [2025-03-08 05:43:06,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:43:06,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:06,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:06,713 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:06,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 05:43:06,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 814 statements into 104 equivalence classes. [2025-03-08 05:43:06,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) and asserted 437 of 814 statements. [2025-03-08 05:43:06,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2025-03-08 05:43:06,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:06,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:43:07,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 12780 proven. 296 refuted. 0 times theorem prover too weak. 26412 trivial. 0 not checked. [2025-03-08 05:43:07,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 4277 proven. 919 refuted. 0 times theorem prover too weak. 34292 trivial. 0 not checked. [2025-03-08 05:43:09,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366004744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:09,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:09,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 17] total 23 [2025-03-08 05:43:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664402993] [2025-03-08 05:43:09,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:09,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 05:43:09,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:09,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 05:43:09,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:43:09,197 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 13 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (30), 14 states have call predecessors, (30), 13 states have call successors, (30) [2025-03-08 05:43:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:09,393 INFO L93 Difference]: Finished difference Result 206 states and 284 transitions. [2025-03-08 05:43:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 05:43:09,394 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 13 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (30), 14 states have call predecessors, (30), 13 states have call successors, (30) Word has length 814 [2025-03-08 05:43:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:09,395 INFO L225 Difference]: With dead ends: 206 [2025-03-08 05:43:09,395 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 05:43:09,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1656 GetRequests, 1614 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 05:43:09,397 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:09,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 151 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 05:43:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2025-03-08 05:43:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 65 states have internal predecessors, (67), 18 states have call successors, (18), 8 states have call predecessors, (18), 14 states have return successors, (39), 25 states have call predecessors, (39), 18 states have call successors, (39) [2025-03-08 05:43:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2025-03-08 05:43:09,406 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 814 [2025-03-08 05:43:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:09,407 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2025-03-08 05:43:09,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 13 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (30), 14 states have call predecessors, (30), 13 states have call successors, (30) [2025-03-08 05:43:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2025-03-08 05:43:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2025-03-08 05:43:09,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:09,411 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 93, 57, 57, 57, 57, 57, 57, 57, 36, 22, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:09,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 05:43:09,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 05:43:09,611 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:09,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:09,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2100558131, now seen corresponding path program 16 times [2025-03-08 05:43:09,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:09,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540604731] [2025-03-08 05:43:09,612 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:43:09,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:09,624 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 787 statements into 2 equivalence classes. [2025-03-08 05:43:09,649 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 670 of 787 statements. [2025-03-08 05:43:09,649 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:43:09,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 3063 proven. 1328 refuted. 0 times theorem prover too weak. 32491 trivial. 0 not checked. [2025-03-08 05:43:09,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540604731] [2025-03-08 05:43:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540604731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412233543] [2025-03-08 05:43:09,973 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:43:09,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:09,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:09,975 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:09,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 05:43:10,172 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 787 statements into 2 equivalence classes. [2025-03-08 05:43:10,272 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 670 of 787 statements. [2025-03-08 05:43:10,272 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:43:10,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:10,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 05:43:10,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 3695 proven. 1655 refuted. 0 times theorem prover too weak. 31532 trivial. 0 not checked. [2025-03-08 05:43:10,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 3695 proven. 1747 refuted. 0 times theorem prover too weak. 31440 trivial. 0 not checked. [2025-03-08 05:43:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412233543] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:13,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:13,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 21] total 25 [2025-03-08 05:43:13,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387563670] [2025-03-08 05:43:13,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:13,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 05:43:13,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:13,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 05:43:13,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:43:13,425 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 25 states have internal predecessors, (74), 19 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (31), 13 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-08 05:43:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:13,580 INFO L93 Difference]: Finished difference Result 128 states and 161 transitions. [2025-03-08 05:43:13,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:43:13,581 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 25 states have internal predecessors, (74), 19 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (31), 13 states have call predecessors, (31), 19 states have call successors, (31) Word has length 787 [2025-03-08 05:43:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:13,583 INFO L225 Difference]: With dead ends: 128 [2025-03-08 05:43:13,583 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 05:43:13,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1599 GetRequests, 1558 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 05:43:13,584 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:13,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 197 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 05:43:13,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2025-03-08 05:43:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 67 states have internal predecessors, (69), 18 states have call successors, (18), 8 states have call predecessors, (18), 15 states have return successors, (38), 26 states have call predecessors, (38), 18 states have call successors, (38) [2025-03-08 05:43:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2025-03-08 05:43:13,592 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 787 [2025-03-08 05:43:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:13,593 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2025-03-08 05:43:13,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 25 states have internal predecessors, (74), 19 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (31), 13 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-08 05:43:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2025-03-08 05:43:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2025-03-08 05:43:13,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:43:13,598 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 93, 57, 57, 57, 57, 57, 57, 57, 36, 22, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:43:13,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 05:43:13,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:13,798 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:43:13,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:43:13,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1403287091, now seen corresponding path program 17 times [2025-03-08 05:43:13,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:43:13,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686423378] [2025-03-08 05:43:13,799 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:43:13,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:43:13,811 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 787 statements into 93 equivalence classes. [2025-03-08 05:43:13,832 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) and asserted 367 of 787 statements. [2025-03-08 05:43:13,832 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) [2025-03-08 05:43:13,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 2786 proven. 2556 refuted. 0 times theorem prover too weak. 31540 trivial. 0 not checked. [2025-03-08 05:43:14,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:43:14,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686423378] [2025-03-08 05:43:14,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686423378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:43:14,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838157349] [2025-03-08 05:43:14,003 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:43:14,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:14,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:43:14,006 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:43:14,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 05:43:14,225 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 787 statements into 93 equivalence classes. [2025-03-08 05:43:14,319 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) and asserted 367 of 787 statements. [2025-03-08 05:43:14,319 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 45 check-sat command(s) [2025-03-08 05:43:14,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:43:14,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:43:14,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:43:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 20296 proven. 287 refuted. 0 times theorem prover too weak. 16299 trivial. 0 not checked. [2025-03-08 05:43:14,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:43:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 2780 proven. 2576 refuted. 0 times theorem prover too weak. 31526 trivial. 0 not checked. [2025-03-08 05:43:16,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838157349] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:43:16,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:43:16,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 20 [2025-03-08 05:43:16,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807097374] [2025-03-08 05:43:16,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:43:16,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:43:16,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:43:16,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:43:16,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:43:16,417 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 15 states have call successors, (21), 2 states have call predecessors, (21), 9 states have return successors, (27), 10 states have call predecessors, (27), 15 states have call successors, (27) [2025-03-08 05:43:16,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:43:16,557 INFO L93 Difference]: Finished difference Result 179 states and 238 transitions. [2025-03-08 05:43:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 05:43:16,561 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 15 states have call successors, (21), 2 states have call predecessors, (21), 9 states have return successors, (27), 10 states have call predecessors, (27), 15 states have call successors, (27) Word has length 787 [2025-03-08 05:43:16,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:43:16,561 INFO L225 Difference]: With dead ends: 179 [2025-03-08 05:43:16,561 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:43:16,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1600 GetRequests, 1563 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2025-03-08 05:43:16,562 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 59 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:43:16,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 108 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:43:16,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:43:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:43:16,563 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-08 05:43:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:43:16,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 787 [2025-03-08 05:43:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:43:16,563 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:43:16,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 15 states have call successors, (21), 2 states have call predecessors, (21), 9 states have return successors, (27), 10 states have call predecessors, (27), 15 states have call successors, (27) [2025-03-08 05:43:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:43:16,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:43:16,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:43:16,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-08 05:43:16,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:43:16,772 INFO L422 BasicCegarLoop]: Path program histogram: [17, 1, 1, 1] [2025-03-08 05:43:16,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:43:19,970 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:43:19,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:43:19 BoogieIcfgContainer [2025-03-08 05:43:19,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:43:19,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:43:19,974 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:43:19,974 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:43:19,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:21" (3/4) ... [2025-03-08 05:43:19,975 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:43:19,979 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibonacci [2025-03-08 05:43:19,981 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 05:43:19,981 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 05:43:19,981 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 05:43:19,981 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:43:20,032 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:43:20,032 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:43:20,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:43:20,033 INFO L158 Benchmark]: Toolchain (without parser) took 58647.07ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 113.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 455.7MB. Max. memory is 16.1GB. [2025-03-08 05:43:20,033 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:43:20,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.52ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 102.9MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:43:20,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.18ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 101.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:43:20,033 INFO L158 Benchmark]: Boogie Preprocessor took 24.48ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.9MB in the end (delta: 956.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:43:20,033 INFO L158 Benchmark]: IcfgBuilder took 181.12ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 90.3MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:43:20,034 INFO L158 Benchmark]: TraceAbstraction took 58168.99ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 89.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 982.4MB. Max. memory is 16.1GB. [2025-03-08 05:43:20,034 INFO L158 Benchmark]: Witness Printer took 58.62ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:43:20,034 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.19ms. Allocated memory is still 167.8MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.52ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 102.9MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.18ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 101.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.48ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.9MB in the end (delta: 956.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 181.12ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 90.3MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 58168.99ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 89.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 982.4MB. Max. memory is 16.1GB. * Witness Printer took 58.62ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 4.7MB). 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: 33]: 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, 19 locations, 26 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.9s, OverallIterations: 20, TraceHistogramMax: 169, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 862 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 772 mSDsluCounter, 2915 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2473 mSDsCounter, 847 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3384 IncrementalHoareTripleChecker+Invalid, 4231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 847 mSolverCounterUnsat, 442 mSDtfsCounter, 3384 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18867 GetRequests, 18316 SyntacticMatches, 106 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3235 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=19, InterpolantAutomatonStates: 258, 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, 20 MinimizatonAttempts, 55 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 44.5s InterpolantComputationTime, 18323 NumberOfCodeBlocks, 10925 NumberOfCodeBlocksAsserted, 426 NumberOfCheckSat, 27418 ConstructedInterpolants, 0 QuantifiedInterpolants, 35797 SizeOfPredicates, 82 NumberOfNonLiveVariables, 12147 ConjunctsInSsa, 669 ConjunctsInUnsatCore, 56 InterpolantComputations, 2 PerfectInterpolantSequences, 1242459/1352415 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-08 05:43:20,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE