./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/eureka_05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/eureka_05.i -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 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:27:01,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:27:01,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:27:01,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:27:01,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:27:01,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:27:01,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:27:01,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:27:01,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:27:01,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:27:01,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:27:01,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:27:01,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:27:01,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:27:01,169 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:27:01,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:27:01,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:27:01,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:27:01,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:27:01,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:27:01,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:27:01,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:27:01,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:27:01,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:27:01,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:27:01,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:27:01,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:27:01,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:27:01,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:27:01,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:27:01,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:27:01,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:27:01,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:27:01,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:27:01,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:27:01,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:27:01,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:27:01,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:27:01,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:27:01,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:27:01,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:27:01,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:27:01,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:27:01,173 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 -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab [2025-03-03 13:27:01,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:27:01,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:27:01,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:27:01,427 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:27:01,427 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:27:01,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_05.i [2025-03-03 13:27:02,583 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6571fa1be/436c7bd3b3b64735a64250e5fd4b8ff3/FLAG108511834 [2025-03-03 13:27:02,833 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:27:02,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i [2025-03-03 13:27:02,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6571fa1be/436c7bd3b3b64735a64250e5fd4b8ff3/FLAG108511834 [2025-03-03 13:27:03,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6571fa1be/436c7bd3b3b64735a64250e5fd4b8ff3 [2025-03-03 13:27:03,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:27:03,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:27:03,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:27:03,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:27:03,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:27:03,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a3089c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03, skipping insertion in model container [2025-03-03 13:27:03,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:27:03,286 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/loops/eureka_05.i[810,823] [2025-03-03 13:27:03,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:27:03,309 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:27:03,316 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/loops/eureka_05.i[810,823] [2025-03-03 13:27:03,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:27:03,340 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:27:03,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03 WrapperNode [2025-03-03 13:27:03,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:27:03,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:27:03,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:27:03,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:27:03,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,369 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2025-03-03 13:27:03,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:27:03,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:27:03,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:27:03,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:27:03,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,394 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 11, 2]. 73 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-03 13:27:03,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:27:03,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:27:03,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:27:03,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:27:03,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (1/1) ... [2025-03-03 13:27:03,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:27:03,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:03,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:27:03,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:27:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:27:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:27:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:27:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 13:27:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:27:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:27:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:27:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 13:27:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:27:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:27:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:27:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:27:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 13:27:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:27:03,525 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:27:03,527 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:27:03,669 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 13:27:03,669 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:27:03,678 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:27:03,678 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:27:03,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:27:03 BoogieIcfgContainer [2025-03-03 13:27:03,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:27:03,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:27:03,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:27:03,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:27:03,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:27:03" (1/3) ... [2025-03-03 13:27:03,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a25679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:27:03, skipping insertion in model container [2025-03-03 13:27:03,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:03" (2/3) ... [2025-03-03 13:27:03,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a25679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:27:03, skipping insertion in model container [2025-03-03 13:27:03,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:27:03" (3/3) ... [2025-03-03 13:27:03,688 INFO L128 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2025-03-03 13:27:03,700 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:27:03,702 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG eureka_05.i that has 1 procedures, 16 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 13:27:03,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:27:03,758 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;@3d7e7033, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:27:03,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:27:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:27:03,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:03,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:03,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:03,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1126537475, now seen corresponding path program 1 times [2025-03-03 13:27:03,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:03,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116203956] [2025-03-03 13:27:03,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:03,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:27:03,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:27:03,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:03,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:27:03,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:03,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116203956] [2025-03-03 13:27:03,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116203956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:27:03,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:27:03,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:27:03,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753034630] [2025-03-03 13:27:03,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:27:03,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:27:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:03,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:27:03,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:27:03,943 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:03,969 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2025-03-03 13:27:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:27:03,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-03 13:27:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:03,976 INFO L225 Difference]: With dead ends: 30 [2025-03-03 13:27:03,976 INFO L226 Difference]: Without dead ends: 14 [2025-03-03 13:27:03,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:27:03,981 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:03,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-03 13:27:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-03 13:27:04,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2025-03-03 13:27:04,008 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2025-03-03 13:27:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:04,008 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-03 13:27:04,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2025-03-03 13:27:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:27:04,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:04,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:04,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:27:04,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:04,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash 359705871, now seen corresponding path program 1 times [2025-03-03 13:27:04,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:04,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996081657] [2025-03-03 13:27:04,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:04,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:27:04,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:27:04,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:04,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:27:04,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:04,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996081657] [2025-03-03 13:27:04,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996081657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:04,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19017852] [2025-03-03 13:27:04,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:04,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:04,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:04,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:27:04,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:27:04,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:27:04,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:27:04,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:04,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:04,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 13:27:04,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:27:04,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:27:04,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19017852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:04,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:04,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 13:27:04,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067030148] [2025-03-03 13:27:04,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:04,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:27:04,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:04,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:27:04,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:27:04,249 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:04,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:04,286 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-03 13:27:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:27:04,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-03 13:27:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:04,287 INFO L225 Difference]: With dead ends: 32 [2025-03-03 13:27:04,287 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 13:27:04,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:27:04,288 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:04,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:04,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 13:27:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2025-03-03 13:27:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-03 13:27:04,291 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2025-03-03 13:27:04,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:04,291 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-03 13:27:04,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-03-03 13:27:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 13:27:04,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:04,292 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:04,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:27:04,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:04,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:04,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:04,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1396988797, now seen corresponding path program 2 times [2025-03-03 13:27:04,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:04,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462356362] [2025-03-03 13:27:04,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:27:04,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:04,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-03 13:27:04,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-03-03 13:27:04,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 13:27:04,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:27:04,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462356362] [2025-03-03 13:27:04,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462356362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:27:04,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:27:04,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:27:04,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570722636] [2025-03-03 13:27:04,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:27:04,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:27:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:04,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:27:04,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:27:04,571 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-03 13:27:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:04,592 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2025-03-03 13:27:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:27:04,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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 12 [2025-03-03 13:27:04,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:04,593 INFO L225 Difference]: With dead ends: 27 [2025-03-03 13:27:04,593 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 13:27:04,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:27:04,595 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:04,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 13:27:04,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-03-03 13:27:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 13:27:04,603 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2025-03-03 13:27:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:04,603 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 13:27:04,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-03 13:27:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 13:27:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 13:27:04,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:04,603 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:04,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:27:04,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:04,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:04,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1625043650, now seen corresponding path program 1 times [2025-03-03 13:27:04,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:04,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876533416] [2025-03-03 13:27:04,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:04,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:04,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:27:04,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:27:04,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:04,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:27:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:04,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876533416] [2025-03-03 13:27:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876533416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:27:04,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:27:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:27:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381303339] [2025-03-03 13:27:04,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:27:04,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:27:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:04,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:27:04,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:27:04,745 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:04,794 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2025-03-03 13:27:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:27:04,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2025-03-03 13:27:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:04,795 INFO L225 Difference]: With dead ends: 34 [2025-03-03 13:27:04,795 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 13:27:04,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:27:04,796 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:04,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 13:27:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2025-03-03 13:27:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-03 13:27:04,803 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 14 [2025-03-03 13:27:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:04,803 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-03 13:27:04,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-03 13:27:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 13:27:04,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:04,804 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:04,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:27:04,804 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:04,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash -670512749, now seen corresponding path program 1 times [2025-03-03 13:27:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:04,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873445330] [2025-03-03 13:27:04,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:04,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:04,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 13:27:04,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 13:27:04,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:04,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 13:27:04,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:04,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873445330] [2025-03-03 13:27:04,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873445330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:04,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577832856] [2025-03-03 13:27:04,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:04,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:04,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:04,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:27:04,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:27:04,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 13:27:04,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 13:27:04,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:04,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:04,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:27:04,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:27:05,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:27:05,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577832856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:05,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:05,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2025-03-03 13:27:05,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783809668] [2025-03-03 13:27:05,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:05,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:27:05,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:05,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:27:05,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:27:05,071 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:05,212 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2025-03-03 13:27:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:27:05,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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 17 [2025-03-03 13:27:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:05,213 INFO L225 Difference]: With dead ends: 59 [2025-03-03 13:27:05,213 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 13:27:05,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:27:05,214 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:05,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 84 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:27:05,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 13:27:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2025-03-03 13:27:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-03 13:27:05,219 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 17 [2025-03-03 13:27:05,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:05,219 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-03 13:27:05,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-03 13:27:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 13:27:05,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:05,220 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:05,225 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-03 13:27:05,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:05,422 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:05,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1906118150, now seen corresponding path program 2 times [2025-03-03 13:27:05,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:05,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625127808] [2025-03-03 13:27:05,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:27:05,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:05,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-03 13:27:05,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:27:05,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:27:05,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:27:05,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:05,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625127808] [2025-03-03 13:27:05,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625127808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:05,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335373676] [2025-03-03 13:27:05,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:27:05,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:05,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:05,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:27:05,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:27:05,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-03 13:27:05,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:27:05,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:27:05,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:05,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:27:05,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:27:05,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:27:05,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335373676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:05,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:05,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-03 13:27:05,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788791141] [2025-03-03 13:27:05,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:05,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:27:05,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:05,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:27:05,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:27:05,708 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:05,898 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2025-03-03 13:27:05,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:27:05,898 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 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 20 [2025-03-03 13:27:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:05,899 INFO L225 Difference]: With dead ends: 62 [2025-03-03 13:27:05,899 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 13:27:05,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2025-03-03 13:27:05,901 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 101 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:05,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 47 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:27:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 13:27:05,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-03-03 13:27:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2025-03-03 13:27:05,913 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 20 [2025-03-03 13:27:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:05,913 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2025-03-03 13:27:05,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2025-03-03 13:27:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 13:27:05,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:05,915 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:05,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:27:06,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:06,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:06,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:06,119 INFO L85 PathProgramCache]: Analyzing trace with hash 886507489, now seen corresponding path program 3 times [2025-03-03 13:27:06,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:06,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077040412] [2025-03-03 13:27:06,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:27:06,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:06,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 11 equivalence classes. [2025-03-03 13:27:06,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 46 statements. [2025-03-03 13:27:06,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:27:06,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-03 13:27:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:06,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077040412] [2025-03-03 13:27:06,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077040412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:27:06,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:27:06,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 13:27:06,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711109377] [2025-03-03 13:27:06,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:27:06,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:27:06,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:06,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:27:06,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:27:06,312 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:06,352 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-03-03 13:27:06,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:27:06,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 46 [2025-03-03 13:27:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:06,361 INFO L225 Difference]: With dead ends: 53 [2025-03-03 13:27:06,361 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 13:27:06,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:27:06,362 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:06,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 36 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:06,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 13:27:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-03-03 13:27:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:06,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2025-03-03 13:27:06,375 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 46 [2025-03-03 13:27:06,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:06,376 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2025-03-03 13:27:06,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2025-03-03 13:27:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 13:27:06,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:06,379 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:06,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 13:27:06,379 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:06,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash 191543722, now seen corresponding path program 1 times [2025-03-03 13:27:06,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:06,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888078452] [2025-03-03 13:27:06,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:06,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:06,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 13:27:06,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 13:27:06,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:06,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-03 13:27:06,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:06,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888078452] [2025-03-03 13:27:06,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888078452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:06,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823481861] [2025-03-03 13:27:06,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:06,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:06,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:06,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:27:06,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:27:06,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 13:27:06,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 13:27:06,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:06,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:06,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:27:06,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-03 13:27:06,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-03 13:27:06,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823481861] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:06,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:06,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-03 13:27:06,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165929258] [2025-03-03 13:27:06,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:06,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:27:06,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:06,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:27:06,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:27:06,862 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:06,922 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2025-03-03 13:27:06,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:27:06,922 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 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 49 [2025-03-03 13:27:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:06,923 INFO L225 Difference]: With dead ends: 66 [2025-03-03 13:27:06,923 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 13:27:06,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:27:06,923 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:06,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 56 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 13:27:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-03 13:27:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2025-03-03 13:27:06,951 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 49 [2025-03-03 13:27:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:06,951 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2025-03-03 13:27:06,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2025-03-03 13:27:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 13:27:06,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:06,952 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:06,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:27:07,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:07,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:07,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:07,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1568792096, now seen corresponding path program 2 times [2025-03-03 13:27:07,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:07,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742172924] [2025-03-03 13:27:07,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:27:07,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:07,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-03 13:27:07,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 13:27:07,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:27:07,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 21 proven. 117 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 13:27:07,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:07,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742172924] [2025-03-03 13:27:07,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742172924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:07,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132503894] [2025-03-03 13:27:07,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:27:07,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:07,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:07,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:27:07,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:27:07,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-03 13:27:07,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 13:27:07,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:27:07,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:07,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:27:07,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 21 proven. 117 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 13:27:07,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 21 proven. 117 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 13:27:07,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132503894] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:07,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:07,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-03 13:27:07,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950999654] [2025-03-03 13:27:07,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:07,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:27:07,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:07,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:27:07,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:27:07,660 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:07,785 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2025-03-03 13:27:07,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:27:07,785 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 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 53 [2025-03-03 13:27:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:07,786 INFO L225 Difference]: With dead ends: 74 [2025-03-03 13:27:07,786 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 13:27:07,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=331, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:27:07,789 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:07,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 69 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 13:27:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-03-03 13:27:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2025-03-03 13:27:07,801 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 53 [2025-03-03 13:27:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:07,801 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2025-03-03 13:27:07,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2025-03-03 13:27:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 13:27:07,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:07,802 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:07,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 13:27:08,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:08,002 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:08,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:08,003 INFO L85 PathProgramCache]: Analyzing trace with hash -845150665, now seen corresponding path program 3 times [2025-03-03 13:27:08,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:08,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604677202] [2025-03-03 13:27:08,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:27:08,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:08,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 12 equivalence classes. [2025-03-03 13:27:08,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 56 statements. [2025-03-03 13:27:08,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:27:08,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-03 13:27:08,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604677202] [2025-03-03 13:27:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604677202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018727424] [2025-03-03 13:27:08,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:27:08,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:08,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:08,394 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:27:08,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:27:08,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 12 equivalence classes. [2025-03-03 13:27:08,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 56 statements. [2025-03-03 13:27:08,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:27:08,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:08,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 13:27:08,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:08,507 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 17 treesize of output 13 [2025-03-03 13:27:08,537 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 33 treesize of output 17 [2025-03-03 13:27:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-03 13:27:08,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:08,929 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-03 13:27:08,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018727424] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:08,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:08,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2025-03-03 13:27:08,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573636776] [2025-03-03 13:27:08,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:08,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 13:27:08,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:08,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 13:27:08,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:27:08,931 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:09,091 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2025-03-03 13:27:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:27:09,091 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 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 56 [2025-03-03 13:27:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:09,092 INFO L225 Difference]: With dead ends: 65 [2025-03-03 13:27:09,092 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 13:27:09,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-03-03 13:27:09,092 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 54 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:09,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 55 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 13:27:09,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-03-03 13:27:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2025-03-03 13:27:09,105 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 56 [2025-03-03 13:27:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:09,105 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2025-03-03 13:27:09,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2025-03-03 13:27:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 13:27:09,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:09,106 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:09,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:27:09,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:09,310 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:09,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:09,310 INFO L85 PathProgramCache]: Analyzing trace with hash -784329836, now seen corresponding path program 4 times [2025-03-03 13:27:09,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:09,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847247104] [2025-03-03 13:27:09,311 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:27:09,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:09,323 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-03 13:27:09,352 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 57 of 59 statements. [2025-03-03 13:27:09,352 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 13:27:09,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2025-03-03 13:27:09,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:09,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847247104] [2025-03-03 13:27:09,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847247104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:09,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314293029] [2025-03-03 13:27:09,786 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:27:09,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:09,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:09,788 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:27:09,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:27:09,839 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-03 13:27:09,871 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 57 of 59 statements. [2025-03-03 13:27:09,872 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 13:27:09,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:09,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-03 13:27:09,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:10,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:27:10,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 38 [2025-03-03 13:27:10,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:27:10,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 22 [2025-03-03 13:27:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 109 proven. 65 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 13:27:10,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:11,338 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 161 treesize of output 143 [2025-03-03 13:27:11,468 INFO L349 Elim1Store]: treesize reduction 10, result has 92.6 percent of original size [2025-03-03 13:27:11,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 203 treesize of output 240 [2025-03-03 13:27:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 118 proven. 56 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 13:27:13,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314293029] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:13,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:13,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20, 19] total 43 [2025-03-03 13:27:13,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921946122] [2025-03-03 13:27:13,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:13,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 13:27:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:13,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 13:27:13,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1652, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 13:27:13,489 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:25,114 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 [1] [2025-03-03 13:27:29,260 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (* |c_ULTIMATE.start_SelectionSort_~lh~0#1| 4))) (let ((.cse10 (+ .cse15 |c_~#array~0.offset|)) (.cse1 (select |c_#memory_int#1| |c_~#array~0.base|))) (let ((.cse0 (select .cse1 (+ |c_~#array~0.offset| 4))) (.cse3 (+ |c_~#array~0.offset| (* |c_ULTIMATE.start_SelectionSort_~i~0#1| 4))) (.cse5 (+ .cse15 |c_~#array~0.offset| 8)) (.cse7 (+ .cse15 16 |c_~#array~0.offset|)) (.cse8 (select .cse1 .cse10)) (.cse9 (+ .cse15 |c_~#array~0.offset| 12)) (.cse2 (+ (* |c_ULTIMATE.start_SelectionSort_~rh~0#1| 4) |c_~#array~0.offset|))) (and (<= (+ .cse0 1) (select .cse1 (+ 16 |c_~#array~0.offset|))) (<= (+ (select .cse1 (+ |c_~#array~0.offset| 8)) 1) .cse0) (< (select .cse1 .cse2) (+ (select .cse1 .cse3) 1)) (= |c_ULTIMATE.start_SelectionSort_~lh~0#1| 1) (= 2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array~1#1.base|) (+ |c_ULTIMATE.start_main_~#array~1#1.offset| 8))) (forall ((v_ArrVal_326 Int) (v_ArrVal_325 Int)) (let ((.cse4 (store (store .cse1 .cse10 v_ArrVal_326) .cse3 v_ArrVal_325))) (let ((.cse6 (select .cse4 .cse9))) (or (< (select .cse4 .cse5) (+ .cse6 1)) (< .cse6 (+ (select .cse4 .cse7) 1)) (< v_ArrVal_325 .cse8))))) (or (let ((.cse11 (= (+ |c_ULTIMATE.start_SelectionSort_~lh~0#1| 1) |c_ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse12 (= |c_ULTIMATE.start_SelectionSort_~i~0#1| (+ 2 |c_ULTIMATE.start_SelectionSort_~lh~0#1|)))) (and (or .cse11 .cse12) (or (= |c_ULTIMATE.start_SelectionSort_~rh~0#1| (+ 3 |c_ULTIMATE.start_SelectionSort_~lh~0#1|)) (and (or .cse11 (= |c_ULTIMATE.start_SelectionSort_~rh~0#1| (+ |c_ULTIMATE.start_SelectionSort_~lh~0#1| 4))) (or (= |c_ULTIMATE.start_SelectionSort_~rh~0#1| |c_ULTIMATE.start_SelectionSort_~lh~0#1|) .cse12))))) (= |c_ULTIMATE.start_SelectionSort_~rh~0#1| |c_ULTIMATE.start_SelectionSort_~i~0#1|) (= (+ |c_ULTIMATE.start_SelectionSort_~i~0#1| 1) |c_ULTIMATE.start_SelectionSort_~rh~0#1|)) (forall ((v_ArrVal_326 Int) (v_ArrVal_325 Int)) (let ((.cse13 (store (store .cse1 .cse10 v_ArrVal_326) .cse2 v_ArrVal_325))) (let ((.cse14 (select .cse13 .cse9))) (or (< (select .cse13 .cse5) (+ .cse14 1)) (< .cse14 (+ (select .cse13 .cse7) 1)) (< v_ArrVal_325 .cse8))))))))) is different from false [2025-03-03 13:27:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:51,108 INFO L93 Difference]: Finished difference Result 378 states and 526 transitions. [2025-03-03 13:27:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-03-03 13:27:51,108 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 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 59 [2025-03-03 13:27:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:51,110 INFO L225 Difference]: With dead ends: 378 [2025-03-03 13:27:51,110 INFO L226 Difference]: Without dead ends: 346 [2025-03-03 13:27:51,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=1575, Invalid=15455, Unknown=4, NotChecked=258, Total=17292 [2025-03-03 13:27:51,116 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 211 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:51,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 231 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1419 Invalid, 1 Unknown, 40 Unchecked, 6.8s Time] [2025-03-03 13:27:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-03 13:27:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 199. [2025-03-03 13:27:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.4393939393939394) internal successors, (285), 198 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 285 transitions. [2025-03-03 13:27:51,153 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 285 transitions. Word has length 59 [2025-03-03 13:27:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:51,153 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 285 transitions. [2025-03-03 13:27:51,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 285 transitions. [2025-03-03 13:27:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 13:27:51,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:51,155 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:51,163 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-03 13:27:51,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:51,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:51,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash 937651446, now seen corresponding path program 1 times [2025-03-03 13:27:51,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:51,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604193021] [2025-03-03 13:27:51,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:51,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:51,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 13:27:51,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 13:27:51,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:51,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 126 proven. 17 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-03 13:27:51,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:51,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604193021] [2025-03-03 13:27:51,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604193021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:51,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979192381] [2025-03-03 13:27:51,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:51,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:51,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:51,863 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-03 13:27:51,864 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-03 13:27:51,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 13:27:51,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 13:27:51,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:51,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:51,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 13:27:51,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:52,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:27:52,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 13:27:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-03 13:27:52,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-03 13:27:52,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979192381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:52,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:52,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2025-03-03 13:27:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78201379] [2025-03-03 13:27:52,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:52,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 13:27:52,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:52,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 13:27:52,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2025-03-03 13:27:52,684 INFO L87 Difference]: Start difference. First operand 199 states and 285 transitions. Second operand has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:53,714 INFO L93 Difference]: Finished difference Result 376 states and 535 transitions. [2025-03-03 13:27:53,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 13:27:53,715 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 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 62 [2025-03-03 13:27:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:53,716 INFO L225 Difference]: With dead ends: 376 [2025-03-03 13:27:53,716 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 13:27:53,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=399, Invalid=1857, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 13:27:53,720 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 102 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:53,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 209 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:27:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 13:27:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 157. [2025-03-03 13:27:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.4230769230769231) internal successors, (222), 156 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 222 transitions. [2025-03-03 13:27:53,741 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 222 transitions. Word has length 62 [2025-03-03 13:27:53,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:53,741 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 222 transitions. [2025-03-03 13:27:53,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 222 transitions. [2025-03-03 13:27:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 13:27:53,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:53,741 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:53,748 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-03 13:27:53,942 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,SelfDestructingSolverStorable11 [2025-03-03 13:27:53,942 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:53,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:53,942 INFO L85 PathProgramCache]: Analyzing trace with hash -170864008, now seen corresponding path program 2 times [2025-03-03 13:27:53,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:53,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497388913] [2025-03-03 13:27:53,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:27:53,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:53,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-03 13:27:53,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 13:27:53,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:27:53,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-03 13:27:54,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:54,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497388913] [2025-03-03 13:27:54,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497388913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:27:54,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:27:54,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:27:54,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608977157] [2025-03-03 13:27:54,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:27:54,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:27:54,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:54,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:27:54,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:27:54,195 INFO L87 Difference]: Start difference. First operand 157 states and 222 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:54,286 INFO L93 Difference]: Finished difference Result 292 states and 418 transitions. [2025-03-03 13:27:54,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:27:54,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 62 [2025-03-03 13:27:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:54,287 INFO L225 Difference]: With dead ends: 292 [2025-03-03 13:27:54,287 INFO L226 Difference]: Without dead ends: 154 [2025-03-03 13:27:54,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:27:54,288 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:54,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 42 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-03 13:27:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-03 13:27:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4248366013071896) internal successors, (218), 153 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 218 transitions. [2025-03-03 13:27:54,307 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 218 transitions. Word has length 62 [2025-03-03 13:27:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:54,307 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 218 transitions. [2025-03-03 13:27:54,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 218 transitions. [2025-03-03 13:27:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 13:27:54,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:54,308 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:54,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 13:27:54,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:54,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:54,309 INFO L85 PathProgramCache]: Analyzing trace with hash 606065366, now seen corresponding path program 3 times [2025-03-03 13:27:54,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:54,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762048708] [2025-03-03 13:27:54,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:27:54,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:54,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 12 equivalence classes. [2025-03-03 13:27:54,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 32 of 62 statements. [2025-03-03 13:27:54,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:27:54,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 13:27:54,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:54,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762048708] [2025-03-03 13:27:54,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762048708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:54,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921108492] [2025-03-03 13:27:54,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:27:54,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:54,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:54,748 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-03 13:27:54,750 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-03 13:27:54,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 12 equivalence classes. [2025-03-03 13:27:54,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 32 of 62 statements. [2025-03-03 13:27:54,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:27:54,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:54,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-03 13:27:54,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:54,856 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 11 treesize of output 7 [2025-03-03 13:27:54,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:27:54,893 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 27 treesize of output 11 [2025-03-03 13:27:54,913 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-03-03 13:27:54,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-03-03 13:27:54,942 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-03 13:27:54,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2025-03-03 13:27:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 13:27:55,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:56,009 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 23 treesize of output 21 [2025-03-03 13:27:56,013 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 46 treesize of output 42 [2025-03-03 13:27:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 13:27:56,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921108492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:56,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:56,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 36 [2025-03-03 13:27:56,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162622686] [2025-03-03 13:27:56,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:56,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 13:27:56,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:56,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 13:27:56,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=992, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 13:27:56,064 INFO L87 Difference]: Start difference. First operand 154 states and 218 transitions. Second operand has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:56,737 INFO L93 Difference]: Finished difference Result 170 states and 234 transitions. [2025-03-03 13:27:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 13:27:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 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 62 [2025-03-03 13:27:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:56,739 INFO L225 Difference]: With dead ends: 170 [2025-03-03 13:27:56,739 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 13:27:56,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=432, Invalid=1548, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 13:27:56,740 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 108 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:56,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 175 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:27:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 13:27:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2025-03-03 13:27:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.4166666666666667) internal successors, (221), 156 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 221 transitions. [2025-03-03 13:27:56,762 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 221 transitions. Word has length 62 [2025-03-03 13:27:56,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:56,762 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 221 transitions. [2025-03-03 13:27:56,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 221 transitions. [2025-03-03 13:27:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 13:27:56,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:56,763 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:56,770 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-03 13:27:56,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 13:27:56,965 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:56,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:56,965 INFO L85 PathProgramCache]: Analyzing trace with hash -748351851, now seen corresponding path program 4 times [2025-03-03 13:27:56,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:56,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461197632] [2025-03-03 13:27:56,966 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:27:56,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:56,972 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-03-03 13:27:56,990 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 63 of 65 statements. [2025-03-03 13:27:56,990 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 13:27:56,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 13:27:57,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:57,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461197632] [2025-03-03 13:27:57,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461197632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:57,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259009766] [2025-03-03 13:27:57,517 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:27:57,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:57,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:57,519 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-03 13:27:57,520 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-03 13:27:57,577 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-03-03 13:27:57,601 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 63 of 65 statements. [2025-03-03 13:27:57,601 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 13:27:57,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:57,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-03 13:27:57,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:57,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 7 [2025-03-03 13:27:58,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:27:58,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 24 [2025-03-03 13:27:58,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:27:58,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2025-03-03 13:27:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 78 proven. 121 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-03 13:27:58,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:28:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 149 proven. 28 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 13:28:03,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259009766] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:28:03,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:28:03,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 13] total 39 [2025-03-03 13:28:03,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27207547] [2025-03-03 13:28:03,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:28:03,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 13:28:03,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:03,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 13:28:03,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1365, Unknown=1, NotChecked=0, Total=1482 [2025-03-03 13:28:03,161 INFO L87 Difference]: Start difference. First operand 157 states and 221 transitions. Second operand has 39 states, 39 states have (on average 2.5384615384615383) internal successors, (99), 39 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:28:19,847 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 [1] [2025-03-03 13:28:23,855 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 [1]