./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/pnr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/array-tiling/pnr2.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 67f3347d26557d25fb6343192d3c90918276f96e14a8e5c63bb68c9eaee65f5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:34:56,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:34:56,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:34:56,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:34:56,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:34:56,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:34:56,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:34:56,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:34:56,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:34:56,279 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:34:56,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:34:56,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:34:56,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:34:56,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:34:56,280 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:34:56,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:34:56,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:34:56,280 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:34:56,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:34:56,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:34:56,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:34:56,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:34:56,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:34:56,282 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:34:56,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:34:56,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:34:56,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:34:56,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:34:56,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:34:56,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:34:56,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:34:56,282 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 -> 67f3347d26557d25fb6343192d3c90918276f96e14a8e5c63bb68c9eaee65f5f [2025-03-16 13:34:56,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:34:56,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:34:56,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:34:56,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:34:56,548 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:34:56,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr2.c [2025-03-16 13:34:57,749 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a35645bb/e02e590afb50411c88f4c398051607e9/FLAG27236cc80 [2025-03-16 13:34:57,984 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:34:57,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr2.c [2025-03-16 13:34:57,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a35645bb/e02e590afb50411c88f4c398051607e9/FLAG27236cc80 [2025-03-16 13:34:58,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a35645bb/e02e590afb50411c88f4c398051607e9 [2025-03-16 13:34:58,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:34:58,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:34:58,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:34:58,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:34:58,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:34:58,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153402b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58, skipping insertion in model container [2025-03-16 13:34:58,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:34:58,443 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/array-tiling/pnr2.c[395,408] [2025-03-16 13:34:58,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:34:58,472 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:34:58,480 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/array-tiling/pnr2.c[395,408] [2025-03-16 13:34:58,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:34:58,502 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:34:58,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58 WrapperNode [2025-03-16 13:34:58,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:34:58,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:34:58,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:34:58,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:34:58,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,530 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-03-16 13:34:58,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:34:58,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:34:58,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:34:58,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:34:58,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,556 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 4 writes are split as follows [0, 0, 4]. [2025-03-16 13:34:58,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:34:58,571 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:34:58,571 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:34:58,571 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:34:58,572 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (1/1) ... [2025-03-16 13:34:58,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:34:58,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:34:58,598 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-16 13:34:58,600 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-16 13:34:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:34:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:34:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:34:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 13:34:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:34:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:34:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 13:34:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 13:34:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2025-03-16 13:34:58,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2025-03-16 13:34:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:34:58,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:34:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:34:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:34:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 13:34:58,677 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:34:58,678 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:34:58,830 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-16 13:34:58,831 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:34:58,840 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:34:58,841 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:34:58,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:34:58 BoogieIcfgContainer [2025-03-16 13:34:58,842 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:34:58,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:34:58,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:34:58,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:34:58,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:34:58" (1/3) ... [2025-03-16 13:34:58,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e69b6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:34:58, skipping insertion in model container [2025-03-16 13:34:58,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:34:58" (2/3) ... [2025-03-16 13:34:58,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e69b6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:34:58, skipping insertion in model container [2025-03-16 13:34:58,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:34:58" (3/3) ... [2025-03-16 13:34:58,850 INFO L128 eAbstractionObserver]: Analyzing ICFG pnr2.c [2025-03-16 13:34:58,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:34:58,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pnr2.c that has 2 procedures, 25 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 13:34:58,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:34:58,903 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;@46ac07f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:34:58,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:34:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 13:34:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 13:34:58,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:34:58,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:34:58,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:34:58,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:34:58,916 INFO L85 PathProgramCache]: Analyzing trace with hash 43592508, now seen corresponding path program 1 times [2025-03-16 13:34:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:34:58,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880991756] [2025-03-16 13:34:58,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:34:58,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:34:58,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 13:34:59,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 13:34:59,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:34:59,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:34:59,061 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-16 13:34:59,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:34:59,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880991756] [2025-03-16 13:34:59,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880991756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:34:59,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:34:59,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 13:34:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719204334] [2025-03-16 13:34:59,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:34:59,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 13:34:59,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:34:59,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 13:34:59,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 13:34:59,087 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-16 13:34:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:34:59,098 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2025-03-16 13:34:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 13:34:59,099 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2025-03-16 13:34:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:34:59,103 INFO L225 Difference]: With dead ends: 46 [2025-03-16 13:34:59,103 INFO L226 Difference]: Without dead ends: 21 [2025-03-16 13:34:59,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 13:34:59,109 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:34:59,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:34:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-16 13:34:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-16 13:34:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 13:34:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-16 13:34:59,138 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 9 [2025-03-16 13:34:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:34:59,139 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-16 13:34:59,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-16 13:34:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-16 13:34:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 13:34:59,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:34:59,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:34:59,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:34:59,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:34:59,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:34:59,142 INFO L85 PathProgramCache]: Analyzing trace with hash 72221659, now seen corresponding path program 1 times [2025-03-16 13:34:59,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:34:59,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781556447] [2025-03-16 13:34:59,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:34:59,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:34:59,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 13:34:59,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 13:34:59,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:34:59,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:34:59,388 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-16 13:34:59,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:34:59,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781556447] [2025-03-16 13:34:59,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781556447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:34:59,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:34:59,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 13:34:59,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238914380] [2025-03-16 13:34:59,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:34:59,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 13:34:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:34:59,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 13:34:59,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:34:59,394 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-16 13:34:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:34:59,462 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2025-03-16 13:34:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 13:34:59,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 9 [2025-03-16 13:34:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:34:59,463 INFO L225 Difference]: With dead ends: 34 [2025-03-16 13:34:59,463 INFO L226 Difference]: Without dead ends: 29 [2025-03-16 13:34:59,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:34:59,464 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:34:59,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 22 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:34:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-16 13:34:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2025-03-16 13:34:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 13:34:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-16 13:34:59,469 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2025-03-16 13:34:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:34:59,469 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-16 13:34:59,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-16 13:34:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-16 13:34:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 13:34:59,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:34:59,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:34:59,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 13:34:59,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:34:59,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:34:59,470 INFO L85 PathProgramCache]: Analyzing trace with hash -160370282, now seen corresponding path program 1 times [2025-03-16 13:34:59,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:34:59,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609694091] [2025-03-16 13:34:59,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:34:59,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:34:59,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 13:34:59,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 13:34:59,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:34:59,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:34:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:34:59,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:34:59,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609694091] [2025-03-16 13:34:59,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609694091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:34:59,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163985567] [2025-03-16 13:34:59,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:34:59,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:34:59,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:34:59,956 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-16 13:34:59,958 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-16 13:35:00,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 13:35:00,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 13:35:00,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:35:00,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:00,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 13:35:00,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:35:00,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 13:35:00,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-16 13:35:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:00,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:35:00,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-16 13:35:00,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-16 13:35:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:00,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163985567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:35:00,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:35:00,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 15 [2025-03-16 13:35:00,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817865489] [2025-03-16 13:35:00,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:35:00,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 13:35:00,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:35:00,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 13:35:00,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-16 13:35:00,271 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 13:35:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:35:00,451 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2025-03-16 13:35:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 13:35:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 23 [2025-03-16 13:35:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:35:00,452 INFO L225 Difference]: With dead ends: 58 [2025-03-16 13:35:00,452 INFO L226 Difference]: Without dead ends: 56 [2025-03-16 13:35:00,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-03-16 13:35:00,453 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 93 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:35:00,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 145 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:35:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-16 13:35:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2025-03-16 13:35:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 13:35:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2025-03-16 13:35:00,459 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2025-03-16 13:35:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:35:00,461 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2025-03-16 13:35:00,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 13:35:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2025-03-16 13:35:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 13:35:00,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:35:00,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:35:00,471 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-16 13:35:00,664 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-16 13:35:00,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:35:00,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:35:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash -31287563, now seen corresponding path program 1 times [2025-03-16 13:35:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:35:00,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954226260] [2025-03-16 13:35:00,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:35:00,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:35:00,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 13:35:00,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 13:35:00,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:35:00,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:00,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:35:00,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954226260] [2025-03-16 13:35:00,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954226260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:35:00,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055708464] [2025-03-16 13:35:00,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:35:00,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:35:00,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:35:00,962 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-16 13:35:00,963 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-16 13:35:00,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 13:35:01,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 13:35:01,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:35:01,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:01,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 13:35:01,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:35:01,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 13:35:01,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-16 13:35:01,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 13:35:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:35:01,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:35:01,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-16 13:35:01,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-16 13:35:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055708464] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:35:01,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:35:01,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 19 [2025-03-16 13:35:01,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098598061] [2025-03-16 13:35:01,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:35:01,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 13:35:01,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:35:01,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 13:35:01,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-16 13:35:01,368 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 13:35:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:35:01,714 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2025-03-16 13:35:01,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 13:35:01,714 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 23 [2025-03-16 13:35:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:35:01,715 INFO L225 Difference]: With dead ends: 79 [2025-03-16 13:35:01,715 INFO L226 Difference]: Without dead ends: 77 [2025-03-16 13:35:01,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2025-03-16 13:35:01,716 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 184 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 13:35:01,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 172 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 13:35:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-16 13:35:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 24. [2025-03-16 13:35:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 13:35:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-03-16 13:35:01,722 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 23 [2025-03-16 13:35:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:35:01,723 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-16 13:35:01,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 13:35:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-03-16 13:35:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 13:35:01,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:35:01,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:35:01,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 13:35:01,928 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-16 13:35:01,928 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:35:01,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:35:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1586563113, now seen corresponding path program 1 times [2025-03-16 13:35:01,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:35:01,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302539092] [2025-03-16 13:35:01,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:35:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:35:01,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 13:35:01,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 13:35:01,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:35:01,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:02,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:35:02,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302539092] [2025-03-16 13:35:02,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302539092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:35:02,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868733111] [2025-03-16 13:35:02,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:35:02,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:35:02,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:35:02,143 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-16 13:35:02,145 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-16 13:35:02,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 13:35:02,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 13:35:02,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:35:02,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:02,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 13:35:02,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:35:02,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 13:35:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:02,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:35:02,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-16 13:35:02,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-16 13:35:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:02,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868733111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:35:02,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:35:02,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-03-16 13:35:02,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83359959] [2025-03-16 13:35:02,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:35:02,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 13:35:02,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:35:02,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 13:35:02,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-03-16 13:35:02,446 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 13:35:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:35:02,581 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-03-16 13:35:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 13:35:02,582 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 26 [2025-03-16 13:35:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:35:02,582 INFO L225 Difference]: With dead ends: 53 [2025-03-16 13:35:02,582 INFO L226 Difference]: Without dead ends: 51 [2025-03-16 13:35:02,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-16 13:35:02,583 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 51 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:35:02,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 161 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:35:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-16 13:35:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2025-03-16 13:35:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 13:35:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2025-03-16 13:35:02,591 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 26 [2025-03-16 13:35:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:35:02,591 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-03-16 13:35:02,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 13:35:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2025-03-16 13:35:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 13:35:02,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:35:02,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:35:02,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 13:35:02,792 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-16 13:35:02,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:35:02,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:35:02,793 INFO L85 PathProgramCache]: Analyzing trace with hash 900949720, now seen corresponding path program 1 times [2025-03-16 13:35:02,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:35:02,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463395804] [2025-03-16 13:35:02,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:35:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:35:02,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 13:35:02,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 13:35:02,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:35:02,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:02,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:35:02,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463395804] [2025-03-16 13:35:02,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463395804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:35:02,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458297935] [2025-03-16 13:35:02,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:35:02,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:35:02,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:35:02,973 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-16 13:35:02,973 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-16 13:35:03,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 13:35:03,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 13:35:03,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:35:03,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:03,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 13:35:03,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:35:03,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 13:35:03,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 13:35:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:03,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:35:03,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-16 13:35:03,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-16 13:35:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:03,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458297935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:35:03,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:35:03,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 23 [2025-03-16 13:35:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691508377] [2025-03-16 13:35:03,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:35:03,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 13:35:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:35:03,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 13:35:03,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-03-16 13:35:03,363 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 13:35:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:35:03,746 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2025-03-16 13:35:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 13:35:03,747 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 26 [2025-03-16 13:35:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:35:03,747 INFO L225 Difference]: With dead ends: 70 [2025-03-16 13:35:03,747 INFO L226 Difference]: Without dead ends: 68 [2025-03-16 13:35:03,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=876, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 13:35:03,748 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 188 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 13:35:03,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 212 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 13:35:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-16 13:35:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 27. [2025-03-16 13:35:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 13:35:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-16 13:35:03,757 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 26 [2025-03-16 13:35:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:35:03,757 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-16 13:35:03,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 13:35:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-16 13:35:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 13:35:03,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:35:03,758 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:35:03,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 13:35:03,958 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-16 13:35:03,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:35:03,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:35:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash 814267894, now seen corresponding path program 2 times [2025-03-16 13:35:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:35:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712077212] [2025-03-16 13:35:03,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:35:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:35:03,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-16 13:35:03,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 13:35:03,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:35:03,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:04,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:35:04,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712077212] [2025-03-16 13:35:04,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712077212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:35:04,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089315844] [2025-03-16 13:35:04,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:35:04,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:35:04,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:35:04,113 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-16 13:35:04,113 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-16 13:35:04,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-16 13:35:04,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 13:35:04,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:35:04,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:04,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 13:35:04,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:35:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:04,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:35:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:35:04,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089315844] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:35:04,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:35:04,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 22 [2025-03-16 13:35:04,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313955908] [2025-03-16 13:35:04,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:35:04,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 13:35:04,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:35:04,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 13:35:04,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-03-16 13:35:04,438 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 13:35:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:35:04,574 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2025-03-16 13:35:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 13:35:04,575 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2025-03-16 13:35:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:35:04,575 INFO L225 Difference]: With dead ends: 55 [2025-03-16 13:35:04,575 INFO L226 Difference]: Without dead ends: 43 [2025-03-16 13:35:04,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2025-03-16 13:35:04,578 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 137 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:35:04,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 56 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:35:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-16 13:35:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2025-03-16 13:35:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 13:35:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-16 13:35:04,585 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 29 [2025-03-16 13:35:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:35:04,586 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-16 13:35:04,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 13:35:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-03-16 13:35:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 13:35:04,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:35:04,587 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:35:04,593 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-16 13:35:04,787 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-16 13:35:04,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:35:04,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:35:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1934720975, now seen corresponding path program 3 times [2025-03-16 13:35:04,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:35:04,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472283597] [2025-03-16 13:35:04,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:35:04,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:35:04,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-03-16 13:35:04,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 43 statements. [2025-03-16 13:35:04,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 13:35:04,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:05,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:35:05,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472283597] [2025-03-16 13:35:05,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472283597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:35:05,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965659932] [2025-03-16 13:35:05,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:35:05,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:35:05,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:35:05,053 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-16 13:35:05,054 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-16 13:35:05,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-03-16 13:35:05,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 43 statements. [2025-03-16 13:35:05,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 13:35:05,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:05,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-16 13:35:05,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:35:05,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 13:35:05,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-16 13:35:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:05,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:35:05,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-16 13:35:05,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-16 13:35:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:05,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965659932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:35:05,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:35:05,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 25 [2025-03-16 13:35:05,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662606563] [2025-03-16 13:35:05,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:35:05,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 13:35:05,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:35:05,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 13:35:05,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-03-16 13:35:05,418 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 9 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-16 13:35:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:35:05,905 INFO L93 Difference]: Finished difference Result 89 states and 118 transitions. [2025-03-16 13:35:05,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 13:35:05,906 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 9 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 43 [2025-03-16 13:35:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:35:05,907 INFO L225 Difference]: With dead ends: 89 [2025-03-16 13:35:05,907 INFO L226 Difference]: Without dead ends: 87 [2025-03-16 13:35:05,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=1226, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 13:35:05,908 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 144 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 13:35:05,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 321 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 13:35:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-16 13:35:05,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 46. [2025-03-16 13:35:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 13:35:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2025-03-16 13:35:05,919 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 43 [2025-03-16 13:35:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:35:05,920 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-03-16 13:35:05,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 9 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-16 13:35:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2025-03-16 13:35:05,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 13:35:05,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:35:05,923 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:35:05,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 13:35:06,123 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-16 13:35:06,124 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:35:06,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:35:06,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1363173968, now seen corresponding path program 1 times [2025-03-16 13:35:06,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:35:06,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071881406] [2025-03-16 13:35:06,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:35:06,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:35:06,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 13:35:06,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 13:35:06,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:35:06,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:06,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:35:06,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071881406] [2025-03-16 13:35:06,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071881406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:35:06,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444459292] [2025-03-16 13:35:06,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:35:06,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:35:06,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:35:06,364 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-16 13:35:06,366 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-16 13:35:06,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 13:35:06,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 13:35:06,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:35:06,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:06,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 13:35:06,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:35:06,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 13:35:06,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-16 13:35:06,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 13:35:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 13:35:06,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:35:06,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-16 13:35:06,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-16 13:35:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444459292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:35:06,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:35:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 31 [2025-03-16 13:35:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327984805] [2025-03-16 13:35:06,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:35:06,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 13:35:06,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:35:06,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 13:35:06,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-03-16 13:35:06,945 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 31 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 31 states have internal predecessors, (80), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-16 13:35:11,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:35:15,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:35:15,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:35:15,788 INFO L93 Difference]: Finished difference Result 132 states and 178 transitions. [2025-03-16 13:35:15,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-16 13:35:15,788 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 31 states have internal predecessors, (80), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 43 [2025-03-16 13:35:15,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:35:15,789 INFO L225 Difference]: With dead ends: 132 [2025-03-16 13:35:15,789 INFO L226 Difference]: Without dead ends: 130 [2025-03-16 13:35:15,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=554, Invalid=2416, Unknown=0, NotChecked=0, Total=2970 [2025-03-16 13:35:15,790 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 255 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 110 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-16 13:35:15,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 349 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 681 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-03-16 13:35:15,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-16 13:35:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 50. [2025-03-16 13:35:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 13:35:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2025-03-16 13:35:15,801 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 43 [2025-03-16 13:35:15,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:35:15,801 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2025-03-16 13:35:15,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 31 states have internal predecessors, (80), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-16 13:35:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2025-03-16 13:35:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 13:35:15,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:35:15,803 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:35:15,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 13:35:16,003 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-16 13:35:16,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:35:16,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:35:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1189420892, now seen corresponding path program 4 times [2025-03-16 13:35:16,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:35:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907957454] [2025-03-16 13:35:16,004 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:35:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:35:16,010 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-03-16 13:35:16,014 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 46 statements. [2025-03-16 13:35:16,016 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 13:35:16,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:16,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:35:16,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907957454] [2025-03-16 13:35:16,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907957454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:35:16,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461507832] [2025-03-16 13:35:16,196 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:35:16,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:35:16,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:35:16,198 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-16 13:35:16,199 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-16 13:35:16,240 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-03-16 13:35:16,251 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 46 statements. [2025-03-16 13:35:16,252 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 13:35:16,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:16,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 13:35:16,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:35:16,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-16 13:35:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:16,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:35:16,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-16 13:35:16,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-16 13:35:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461507832] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:35:16,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:35:16,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2025-03-16 13:35:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593464080] [2025-03-16 13:35:16,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:35:16,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 13:35:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:35:16,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 13:35:16,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-16 13:35:16,423 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:35:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:35:16,803 INFO L93 Difference]: Finished difference Result 149 states and 207 transitions. [2025-03-16 13:35:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 13:35:16,803 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-03-16 13:35:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:35:16,804 INFO L225 Difference]: With dead ends: 149 [2025-03-16 13:35:16,804 INFO L226 Difference]: Without dead ends: 147 [2025-03-16 13:35:16,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2025-03-16 13:35:16,805 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 52 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 13:35:16,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 297 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 13:35:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-16 13:35:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 93. [2025-03-16 13:35:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-16 13:35:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2025-03-16 13:35:16,823 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 46 [2025-03-16 13:35:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:35:16,823 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2025-03-16 13:35:16,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:35:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2025-03-16 13:35:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 13:35:16,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:35:16,824 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:35:16,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 13:35:17,025 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-16 13:35:17,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:35:17,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:35:17,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1597994595, now seen corresponding path program 1 times [2025-03-16 13:35:17,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:35:17,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479224278] [2025-03-16 13:35:17,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:35:17,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:35:17,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 13:35:17,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 13:35:17,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:35:17,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:17,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:35:17,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479224278] [2025-03-16 13:35:17,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479224278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:35:17,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607415800] [2025-03-16 13:35:17,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:35:17,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:35:17,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:35:17,300 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-16 13:35:17,302 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-16 13:35:17,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 13:35:17,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 13:35:17,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:35:17,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:17,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 13:35:17,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:35:17,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 13:35:17,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 13:35:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:17,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:35:17,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-16 13:35:17,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-16 13:35:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:17,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607415800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:35:17,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:35:17,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-03-16 13:35:17,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272953694] [2025-03-16 13:35:17,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:35:17,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 13:35:17,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:35:17,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 13:35:17,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2025-03-16 13:35:17,834 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 states have internal predecessors, (87), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-16 13:35:18,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:35:18,976 INFO L93 Difference]: Finished difference Result 269 states and 392 transitions. [2025-03-16 13:35:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-16 13:35:18,977 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 states have internal predecessors, (87), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 46 [2025-03-16 13:35:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:35:18,978 INFO L225 Difference]: With dead ends: 269 [2025-03-16 13:35:18,978 INFO L226 Difference]: Without dead ends: 267 [2025-03-16 13:35:18,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=533, Invalid=2889, Unknown=0, NotChecked=0, Total=3422 [2025-03-16 13:35:18,979 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 207 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 13:35:18,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 602 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 13:35:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-16 13:35:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 53. [2025-03-16 13:35:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 44 states have internal predecessors, (52), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 13:35:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2025-03-16 13:35:19,001 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 46 [2025-03-16 13:35:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:35:19,001 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2025-03-16 13:35:19,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 states have internal predecessors, (87), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-16 13:35:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2025-03-16 13:35:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 13:35:19,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:35:19,002 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:35:19,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 13:35:19,206 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-16 13:35:19,206 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:35:19,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:35:19,206 INFO L85 PathProgramCache]: Analyzing trace with hash 558476369, now seen corresponding path program 5 times [2025-03-16 13:35:19,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:35:19,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401674110] [2025-03-16 13:35:19,206 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:35:19,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:35:19,213 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 5 equivalence classes. [2025-03-16 13:35:19,221 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 13:35:19,221 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-16 13:35:19,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:19,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:35:19,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401674110] [2025-03-16 13:35:19,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401674110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:35:19,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497845500] [2025-03-16 13:35:19,394 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:35:19,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:35:19,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:35:19,396 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-16 13:35:19,397 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-16 13:35:19,438 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 5 equivalence classes. [2025-03-16 13:35:19,460 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 13:35:19,461 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-16 13:35:19,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:19,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 13:35:19,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:35:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:19,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:35:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 13:35:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497845500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:35:19,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:35:19,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 31 [2025-03-16 13:35:19,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876367671] [2025-03-16 13:35:19,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:35:19,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 13:35:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:35:19,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 13:35:19,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=692, Unknown=0, NotChecked=0, Total=930 [2025-03-16 13:35:19,955 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 31 states, 31 states have (on average 3.129032258064516) internal successors, (97), 31 states have internal predecessors, (97), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-16 13:35:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:35:20,150 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2025-03-16 13:35:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 13:35:20,151 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.129032258064516) internal successors, (97), 31 states have internal predecessors, (97), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 49 [2025-03-16 13:35:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:35:20,151 INFO L225 Difference]: With dead ends: 97 [2025-03-16 13:35:20,151 INFO L226 Difference]: Without dead ends: 79 [2025-03-16 13:35:20,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=343, Invalid=917, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 13:35:20,152 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 116 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:35:20,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 109 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:35:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-16 13:35:20,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2025-03-16 13:35:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-16 13:35:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2025-03-16 13:35:20,174 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 49 [2025-03-16 13:35:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:35:20,174 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2025-03-16 13:35:20,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.129032258064516) internal successors, (97), 31 states have internal predecessors, (97), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-16 13:35:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2025-03-16 13:35:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 13:35:20,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:35:20,175 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:35:20,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 13:35:20,376 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-16 13:35:20,376 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:35:20,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:35:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash -902102260, now seen corresponding path program 6 times [2025-03-16 13:35:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:35:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149231368] [2025-03-16 13:35:20,376 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:35:20,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:35:20,383 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 63 statements into 6 equivalence classes. [2025-03-16 13:35:20,410 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 13:35:20,410 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-16 13:35:20,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-16 13:35:20,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:35:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149231368] [2025-03-16 13:35:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149231368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:35:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23075337] [2025-03-16 13:35:20,642 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:35:20,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:35:20,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:35:20,644 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-16 13:35:20,646 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-16 13:35:20,690 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 63 statements into 6 equivalence classes. [2025-03-16 13:35:20,718 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 13:35:20,718 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-16 13:35:20,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:35:20,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-16 13:35:20,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:35:20,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 13:35:20,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-16 13:35:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 13:35:21,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:35:21,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-16 13:35:21,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-16 13:35:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-16 13:35:21,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23075337] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:35:21,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:35:21,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 30 [2025-03-16 13:35:21,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385859322] [2025-03-16 13:35:21,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:35:21,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 13:35:21,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:35:21,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 13:35:21,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2025-03-16 13:35:21,193 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 30 states, 30 states have (on average 2.966666666666667) internal successors, (89), 29 states have internal predecessors, (89), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-16 13:35:25,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:35:29,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:35:33,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:35:37,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:35:41,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:35:45,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:35:49,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:35:53,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:35:57,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:36:01,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:36:05,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:36:09,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:36:13,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:36:17,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:36:21,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:36:25,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:36:29,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:36:33,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:36:37,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]