./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/bAnd5.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/array-crafted/bAnd5.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 d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:19:55,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:19:55,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:19:55,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:19:55,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:19:55,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:19:55,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:19:55,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:19:55,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:19:55,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:19:55,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:19:55,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:19:55,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:19:55,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:19:55,202 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:19:55,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:19:55,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:19:55,203 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:19:55,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:19:55,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:19:55,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:19:55,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:19:55,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:19:55,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:19:55,204 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:19:55,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:19:55,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:19:55,205 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 -> d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 [2025-03-03 09:19:55,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:19:55,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:19:55,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:19:55,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:19:55,437 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:19:55,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bAnd5.i [2025-03-03 09:19:56,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e549ebac/df583c2b47a54b17bdf8a09515a6bb90/FLAGc0530e7ec [2025-03-03 09:19:56,764 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:19:56,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i [2025-03-03 09:19:56,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e549ebac/df583c2b47a54b17bdf8a09515a6bb90/FLAGc0530e7ec [2025-03-03 09:19:57,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e549ebac/df583c2b47a54b17bdf8a09515a6bb90 [2025-03-03 09:19:57,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:19:57,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:19:57,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:19:57,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:19:57,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:19:57,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e49559a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57, skipping insertion in model container [2025-03-03 09:19:57,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:19:57,224 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i[1369,1382] [2025-03-03 09:19:57,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:19:57,235 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:19:57,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i[1369,1382] [2025-03-03 09:19:57,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:19:57,266 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:19:57,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57 WrapperNode [2025-03-03 09:19:57,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:19:57,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:19:57,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:19:57,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:19:57,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,293 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 76 [2025-03-03 09:19:57,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:19:57,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:19:57,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:19:57,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:19:57,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,317 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-03-03 09:19:57,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,321 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:19:57,331 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:19:57,331 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:19:57,332 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:19:57,332 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (1/1) ... [2025-03-03 09:19:57,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:19:57,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:19:57,360 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 09:19:57,362 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 09:19:57,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:19:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:19:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:19:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:19:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:19:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:19:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:19:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:19:57,381 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2025-03-03 09:19:57,382 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2025-03-03 09:19:57,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:19:57,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:19:57,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:19:57,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:19:57,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:19:57,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:19:57,442 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:19:57,444 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:19:57,583 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 09:19:57,584 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:19:57,595 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:19:57,595 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:19:57,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:19:57 BoogieIcfgContainer [2025-03-03 09:19:57,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:19:57,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:19:57,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:19:57,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:19:57,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:19:57" (1/3) ... [2025-03-03 09:19:57,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d52399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:19:57, skipping insertion in model container [2025-03-03 09:19:57,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:19:57" (2/3) ... [2025-03-03 09:19:57,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d52399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:19:57, skipping insertion in model container [2025-03-03 09:19:57,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:19:57" (3/3) ... [2025-03-03 09:19:57,602 INFO L128 eAbstractionObserver]: Analyzing ICFG bAnd5.i [2025-03-03 09:19:57,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:19:57,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bAnd5.i that has 2 procedures, 27 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:19:57,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:19:57,653 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;@7dc1dd48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:19:57,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:19:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:19:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:19:57,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:19:57,662 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:19:57,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:19:57,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:19:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash -797157225, now seen corresponding path program 1 times [2025-03-03 09:19:57,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:19:57,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436355525] [2025-03-03 09:19:57,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:19:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:19:57,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:19:57,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:19:57,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:19:57,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:19:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:19:57,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:19:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436355525] [2025-03-03 09:19:57,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436355525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:19:57,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:19:57,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:19:57,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780578704] [2025-03-03 09:19:57,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:19:57,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:19:57,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:19:57,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:19:57,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:19:57,979 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:19:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:19:58,017 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2025-03-03 09:19:58,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:19:58,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-03-03 09:19:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:19:58,024 INFO L225 Difference]: With dead ends: 51 [2025-03-03 09:19:58,024 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 09:19:58,026 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 09:19:58,028 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:19:58,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:19:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 09:19:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-03 09:19:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:19:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-03-03 09:19:58,051 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 25 [2025-03-03 09:19:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:19:58,051 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-03 09:19:58,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:19:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-03-03 09:19:58,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:19:58,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:19:58,054 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:19:58,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:19:58,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:19:58,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:19:58,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2092529177, now seen corresponding path program 1 times [2025-03-03 09:19:58,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:19:58,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431148062] [2025-03-03 09:19:58,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:19:58,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:19:58,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 09:19:58,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:19:58,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:19:58,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:19:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:19:58,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:19:58,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431148062] [2025-03-03 09:19:58,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431148062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:19:58,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015675403] [2025-03-03 09:19:58,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:19:58,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:19:58,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:19:58,187 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 09:19:58,188 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 09:19:58,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 09:19:58,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:19:58,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:19:58,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:19:58,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:19:58,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:19:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:19:58,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:19:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:19:58,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015675403] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:19:58,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:19:58,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-03 09:19:58,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106248248] [2025-03-03 09:19:58,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:19:58,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:19:58,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:19:58,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:19:58,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:19:58,356 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:19:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:19:58,411 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2025-03-03 09:19:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:19:58,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 26 [2025-03-03 09:19:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:19:58,412 INFO L225 Difference]: With dead ends: 47 [2025-03-03 09:19:58,412 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 09:19:58,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:19:58,413 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:19:58,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 61 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:19:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 09:19:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2025-03-03 09:19:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:19:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2025-03-03 09:19:58,417 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 26 [2025-03-03 09:19:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:19:58,418 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-03-03 09:19:58,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:19:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2025-03-03 09:19:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 09:19:58,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:19:58,419 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:19:58,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:19:58,619 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 09:19:58,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:19:58,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:19:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash 396322400, now seen corresponding path program 1 times [2025-03-03 09:19:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:19:58,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194020580] [2025-03-03 09:19:58,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:19:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:19:58,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 09:19:58,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:19:58,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:19:58,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:19:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 09:19:58,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:19:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194020580] [2025-03-03 09:19:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194020580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:19:58,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:19:58,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:19:58,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116145244] [2025-03-03 09:19:58,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:19:58,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:19:58,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:19:58,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:19:58,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:19:58,727 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:19:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:19:58,766 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-03-03 09:19:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:19:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-03 09:19:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:19:58,767 INFO L225 Difference]: With dead ends: 40 [2025-03-03 09:19:58,767 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 09:19:58,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 09:19:58,768 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:19:58,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 32 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:19:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 09:19:58,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-03 09:19:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:19:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-03 09:19:58,771 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 36 [2025-03-03 09:19:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:19:58,772 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-03 09:19:58,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:19:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-03-03 09:19:58,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 09:19:58,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:19:58,773 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:19:58,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:19:58,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:19:58,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:19:58,774 INFO L85 PathProgramCache]: Analyzing trace with hash -379422146, now seen corresponding path program 1 times [2025-03-03 09:19:58,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:19:58,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214928062] [2025-03-03 09:19:58,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:19:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:19:58,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 09:19:58,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:19:58,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:19:58,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:19:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:19:59,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:19:59,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214928062] [2025-03-03 09:19:59,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214928062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:19:59,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632839896] [2025-03-03 09:19:59,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:19:59,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:19:59,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:19:59,336 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 09:19:59,337 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 09:19:59,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 09:19:59,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:19:59,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:19:59,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:19:59,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 09:19:59,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:19:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:19:59,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:19:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:19:59,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632839896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:19:59,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:19:59,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 17 [2025-03-03 09:19:59,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447761075] [2025-03-03 09:19:59,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:19:59,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:19:59,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:19:59,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:19:59,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:19:59,789 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 09:19:59,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:19:59,891 INFO L93 Difference]: Finished difference Result 66 states and 94 transitions. [2025-03-03 09:19:59,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:19:59,892 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2025-03-03 09:19:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:19:59,894 INFO L225 Difference]: With dead ends: 66 [2025-03-03 09:19:59,894 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 09:19:59,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:19:59,896 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:19:59,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 340 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:19:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 09:19:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2025-03-03 09:19:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-03 09:19:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-03-03 09:19:59,907 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 37 [2025-03-03 09:19:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:19:59,908 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-03-03 09:19:59,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 09:19:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-03-03 09:19:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:19:59,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:19:59,909 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:19:59,915 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 09:20:00,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 09:20:00,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:20:00,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:20:00,110 INFO L85 PathProgramCache]: Analyzing trace with hash 444733784, now seen corresponding path program 1 times [2025-03-03 09:20:00,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:20:00,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871655195] [2025-03-03 09:20:00,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:20:00,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:20:00,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 09:20:00,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:20:00,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:20:00,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:20:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:20:01,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:20:01,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871655195] [2025-03-03 09:20:01,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871655195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:20:01,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761539930] [2025-03-03 09:20:01,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:20:01,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:20:01,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:20:01,306 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 09:20:01,307 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 09:20:01,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 09:20:01,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:20:01,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:20:01,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:20:01,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 09:20:01,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:20:01,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:20:01,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:20:01,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 22 [2025-03-03 09:20:01,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:20:01,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 25 [2025-03-03 09:20:01,929 INFO L349 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2025-03-03 09:20:01,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 41 [2025-03-03 09:20:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:20:02,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:20:02,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761539930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:20:02,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:20:02,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2025-03-03 09:20:02,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931736426] [2025-03-03 09:20:02,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:20:02,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 09:20:02,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:20:02,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 09:20:02,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1421, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 09:20:02,921 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 39 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:20:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:20:04,174 INFO L93 Difference]: Finished difference Result 162 states and 237 transitions. [2025-03-03 09:20:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 09:20:04,175 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2025-03-03 09:20:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:20:04,176 INFO L225 Difference]: With dead ends: 162 [2025-03-03 09:20:04,176 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 09:20:04,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=328, Invalid=2978, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 09:20:04,178 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 134 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:20:04,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 322 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:20:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 09:20:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 82. [2025-03-03 09:20:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 11 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2025-03-03 09:20:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2025-03-03 09:20:04,198 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 38 [2025-03-03 09:20:04,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:20:04,199 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2025-03-03 09:20:04,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:20:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2025-03-03 09:20:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:20:04,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:20:04,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:20:04,206 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 09:20:04,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:20:04,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:20:04,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:20:04,405 INFO L85 PathProgramCache]: Analyzing trace with hash -585748682, now seen corresponding path program 2 times [2025-03-03 09:20:04,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:20:04,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624668918] [2025-03-03 09:20:04,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:20:04,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:20:04,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 09:20:04,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:20:04,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:20:04,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:20:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:20:05,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:20:05,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624668918] [2025-03-03 09:20:05,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624668918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:20:05,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40872941] [2025-03-03 09:20:05,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:20:05,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:20:05,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:20:05,072 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 09:20:05,073 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 09:20:05,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 09:20:05,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:20:05,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:20:05,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:20:05,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 09:20:05,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:20:05,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:20:05,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:20:05,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 22 [2025-03-03 09:20:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:20:05,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:20:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:20:05,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40872941] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:20:05,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:20:05,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 10] total 35 [2025-03-03 09:20:05,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441960317] [2025-03-03 09:20:05,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:20:05,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 09:20:05,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:20:05,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 09:20:05,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1065, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:20:05,780 INFO L87 Difference]: Start difference. First operand 82 states and 114 transitions. Second operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 8 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-03 09:20:09,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:20:13,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:20:17,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:20:22,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:20:26,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:20:30,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:20:35,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:20:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:20:36,498 INFO L93 Difference]: Finished difference Result 252 states and 376 transitions. [2025-03-03 09:20:36,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 09:20:36,498 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 8 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) Word has length 38 [2025-03-03 09:20:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:20:36,501 INFO L225 Difference]: With dead ends: 252 [2025-03-03 09:20:36,501 INFO L226 Difference]: Without dead ends: 187 [2025-03-03 09:20:36,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=419, Invalid=2887, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 09:20:36,504 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 113 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 40 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:20:36,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 330 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 862 Invalid, 9 Unknown, 0 Unchecked, 30.1s Time] [2025-03-03 09:20:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-03 09:20:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 161. [2025-03-03 09:20:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 127 states have (on average 1.31496062992126) internal successors, (167), 139 states have internal predecessors, (167), 19 states have call successors, (19), 6 states have call predecessors, (19), 14 states have return successors, (64), 15 states have call predecessors, (64), 19 states have call successors, (64) [2025-03-03 09:20:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 250 transitions. [2025-03-03 09:20:36,535 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 250 transitions. Word has length 38 [2025-03-03 09:20:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:20:36,537 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 250 transitions. [2025-03-03 09:20:36,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 8 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-03 09:20:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 250 transitions. [2025-03-03 09:20:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:20:36,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:20:36,539 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:20:36,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:20:36,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:20:36,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:20:36,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:20:36,740 INFO L85 PathProgramCache]: Analyzing trace with hash -874741994, now seen corresponding path program 3 times [2025-03-03 09:20:36,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:20:36,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547527442] [2025-03-03 09:20:36,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:20:36,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:20:36,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-03-03 09:20:36,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 39 statements. [2025-03-03 09:20:36,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:20:36,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:20:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:20:36,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:20:36,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547527442] [2025-03-03 09:20:36,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547527442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:20:36,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997319536] [2025-03-03 09:20:36,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:20:36,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:20:36,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:20:36,828 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 09:20:36,830 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 09:20:36,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-03-03 09:20:36,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 39 statements. [2025-03-03 09:20:36,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:20:36,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:20:36,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:20:36,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:20:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:20:36,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:20:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:20:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997319536] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:20:37,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:20:37,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-03-03 09:20:37,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128276562] [2025-03-03 09:20:37,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:20:37,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:20:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:20:37,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:20:37,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:20:37,035 INFO L87 Difference]: Start difference. First operand 161 states and 250 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:20:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:20:37,190 INFO L93 Difference]: Finished difference Result 368 states and 577 transitions. [2025-03-03 09:20:37,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:20:37,191 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2025-03-03 09:20:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:20:37,192 INFO L225 Difference]: With dead ends: 368 [2025-03-03 09:20:37,192 INFO L226 Difference]: Without dead ends: 292 [2025-03-03 09:20:37,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:20:37,194 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 80 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:20:37,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 279 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:20:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-03 09:20:37,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 236. [2025-03-03 09:20:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 192 states have (on average 1.3125) internal successors, (252), 208 states have internal predecessors, (252), 23 states have call successors, (23), 9 states have call predecessors, (23), 20 states have return successors, (93), 18 states have call predecessors, (93), 23 states have call successors, (93) [2025-03-03 09:20:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 368 transitions. [2025-03-03 09:20:37,237 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 368 transitions. Word has length 39 [2025-03-03 09:20:37,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:20:37,237 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 368 transitions. [2025-03-03 09:20:37,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:20:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 368 transitions. [2025-03-03 09:20:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:20:37,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:20:37,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:20:37,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:20:37,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:20:37,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:20:37,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:20:37,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1181930540, now seen corresponding path program 1 times [2025-03-03 09:20:37,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:20:37,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786624934] [2025-03-03 09:20:37,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:20:37,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:20:37,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:20:37,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:20:37,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:20:37,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:20:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:20:39,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:20:39,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786624934] [2025-03-03 09:20:39,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786624934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:20:39,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068008959] [2025-03-03 09:20:39,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:20:39,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:20:39,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:20:39,705 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 09:20:39,707 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 09:20:39,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:20:39,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:20:39,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:20:39,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:20:39,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-03 09:20:39,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:20:39,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:20:40,200 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 64 treesize of output 33 [2025-03-03 09:20:40,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:20:40,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 105 treesize of output 68 [2025-03-03 09:20:40,688 INFO L349 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2025-03-03 09:20:40,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 51 [2025-03-03 09:20:41,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:20:41,394 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:20:41,394 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:20:41,403 INFO L349 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2025-03-03 09:20:41,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 123 [2025-03-03 09:20:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:20:41,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:20:41,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068008959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:20:41,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:20:41,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2025-03-03 09:20:41,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078743705] [2025-03-03 09:20:41,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:20:41,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-03 09:20:41,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:20:41,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-03 09:20:41,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2473, Unknown=0, NotChecked=0, Total=2652 [2025-03-03 09:20:41,697 INFO L87 Difference]: Start difference. First operand 236 states and 368 transitions. Second operand has 50 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:20:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:20:43,558 INFO L93 Difference]: Finished difference Result 416 states and 699 transitions. [2025-03-03 09:20:43,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 09:20:43,559 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2025-03-03 09:20:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:20:43,561 INFO L225 Difference]: With dead ends: 416 [2025-03-03 09:20:43,561 INFO L226 Difference]: Without dead ends: 284 [2025-03-03 09:20:43,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=424, Invalid=4978, Unknown=0, NotChecked=0, Total=5402 [2025-03-03 09:20:43,563 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 87 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:20:43,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 184 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:20:43,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-03 09:20:43,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 254. [2025-03-03 09:20:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 203 states have (on average 1.3103448275862069) internal successors, (266), 223 states have internal predecessors, (266), 29 states have call successors, (29), 9 states have call predecessors, (29), 21 states have return successors, (113), 21 states have call predecessors, (113), 29 states have call successors, (113) [2025-03-03 09:20:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 408 transitions. [2025-03-03 09:20:43,602 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 408 transitions. Word has length 40 [2025-03-03 09:20:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:20:43,603 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 408 transitions. [2025-03-03 09:20:43,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:20:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 408 transitions. [2025-03-03 09:20:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:20:43,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:20:43,605 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:20:43,611 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 09:20:43,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:20:43,806 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:20:43,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:20:43,806 INFO L85 PathProgramCache]: Analyzing trace with hash -284363620, now seen corresponding path program 4 times [2025-03-03 09:20:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:20:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260577631] [2025-03-03 09:20:43,807 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:20:43,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:20:43,813 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-03 09:20:43,821 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:20:43,822 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:20:43,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:20:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:20:43,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:20:43,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260577631] [2025-03-03 09:20:43,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260577631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:20:43,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364334565] [2025-03-03 09:20:43,869 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:20:43,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:20:43,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:20:43,871 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 09:20:43,872 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 09:20:43,908 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-03 09:20:43,931 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:20:43,931 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:20:43,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:20:43,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:20:43,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:20:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:20:43,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:20:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:20:44,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364334565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:20:44,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:20:44,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 12 [2025-03-03 09:20:44,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153430691] [2025-03-03 09:20:44,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:20:44,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:20:44,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:20:44,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:20:44,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:20:44,024 INFO L87 Difference]: Start difference. First operand 254 states and 408 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:20:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:20:44,172 INFO L93 Difference]: Finished difference Result 428 states and 616 transitions. [2025-03-03 09:20:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:20:44,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2025-03-03 09:20:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:20:44,175 INFO L225 Difference]: With dead ends: 428 [2025-03-03 09:20:44,175 INFO L226 Difference]: Without dead ends: 377 [2025-03-03 09:20:44,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:20:44,176 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 94 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:20:44,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 188 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:20:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-03 09:20:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 289. [2025-03-03 09:20:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 235 states have (on average 1.297872340425532) internal successors, (305), 258 states have internal predecessors, (305), 28 states have call successors, (28), 9 states have call predecessors, (28), 25 states have return successors, (93), 21 states have call predecessors, (93), 28 states have call successors, (93) [2025-03-03 09:20:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 426 transitions. [2025-03-03 09:20:44,216 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 426 transitions. Word has length 40 [2025-03-03 09:20:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:20:44,216 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 426 transitions. [2025-03-03 09:20:44,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:20:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 426 transitions. [2025-03-03 09:20:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 09:20:44,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:20:44,219 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:20:44,225 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 09:20:44,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:20:44,420 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:20:44,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:20:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash 716191931, now seen corresponding path program 1 times [2025-03-03 09:20:44,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:20:44,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273683369] [2025-03-03 09:20:44,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:20:44,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:20:44,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 09:20:44,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:20:44,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:20:44,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:20:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:20:44,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:20:44,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273683369] [2025-03-03 09:20:44,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273683369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:20:44,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562000424] [2025-03-03 09:20:44,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:20:44,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:20:44,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:20:44,974 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 09:20:44,976 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 09:20:45,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 09:20:45,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:20:45,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:20:45,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:20:45,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-03 09:20:45,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:20:45,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:20:45,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:20:45,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2025-03-03 09:20:45,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:20:45,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 21 [2025-03-03 09:20:45,371 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-03-03 09:20:45,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 29 [2025-03-03 09:20:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:20:45,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:20:45,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562000424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:20:45,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:20:45,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2025-03-03 09:20:45,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360061543] [2025-03-03 09:20:45,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:20:45,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 09:20:45,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:20:45,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 09:20:45,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 09:20:45,659 INFO L87 Difference]: Start difference. First operand 289 states and 426 transitions. Second operand has 35 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 09:20:50,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:20:54,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:20:59,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:21:03,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:21:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:05,483 INFO L93 Difference]: Finished difference Result 444 states and 626 transitions. [2025-03-03 09:21:05,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 09:21:05,484 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2025-03-03 09:21:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:05,485 INFO L225 Difference]: With dead ends: 444 [2025-03-03 09:21:05,485 INFO L226 Difference]: Without dead ends: 369 [2025-03-03 09:21:05,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=384, Invalid=2808, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 09:21:05,487 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 151 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 43 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:05,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 297 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 755 Invalid, 8 Unknown, 0 Unchecked, 19.4s Time] [2025-03-03 09:21:05,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-03 09:21:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 326. [2025-03-03 09:21:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 269 states have (on average 1.2899628252788105) internal successors, (347), 293 states have internal predecessors, (347), 28 states have call successors, (28), 11 states have call predecessors, (28), 28 states have return successors, (86), 21 states have call predecessors, (86), 28 states have call successors, (86) [2025-03-03 09:21:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 461 transitions. [2025-03-03 09:21:05,527 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 461 transitions. Word has length 41 [2025-03-03 09:21:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:05,527 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 461 transitions. [2025-03-03 09:21:05,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 09:21:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 461 transitions. [2025-03-03 09:21:05,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 09:21:05,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:05,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:05,536 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 09:21:05,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:21:05,730 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:05,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:05,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2040467115, now seen corresponding path program 2 times [2025-03-03 09:21:05,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:05,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394424926] [2025-03-03 09:21:05,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:21:05,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:05,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-03 09:21:05,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:21:05,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:21:05,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:21:06,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:06,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394424926] [2025-03-03 09:21:06,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394424926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:06,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460138157] [2025-03-03 09:21:06,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:21:06,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:06,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:06,168 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 09:21:06,169 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 09:21:06,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-03 09:21:06,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:21:06,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:21:06,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:06,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 09:21:06,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:06,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:21:06,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:21:06,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2025-03-03 09:21:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:21:06,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:21:06,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460138157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:06,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:21:06,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 9] total 30 [2025-03-03 09:21:06,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468364057] [2025-03-03 09:21:06,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:06,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 09:21:06,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:06,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 09:21:06,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:21:06,622 INFO L87 Difference]: Start difference. First operand 326 states and 461 transitions. Second operand has 30 states, 30 states have (on average 2.6) internal successors, (78), 29 states have internal predecessors, (78), 7 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-03 09:21:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:07,132 INFO L93 Difference]: Finished difference Result 542 states and 721 transitions. [2025-03-03 09:21:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 09:21:07,133 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6) internal successors, (78), 29 states have internal predecessors, (78), 7 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) Word has length 41 [2025-03-03 09:21:07,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:07,135 INFO L225 Difference]: With dead ends: 542 [2025-03-03 09:21:07,135 INFO L226 Difference]: Without dead ends: 363 [2025-03-03 09:21:07,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=1704, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 09:21:07,136 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 82 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:07,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 370 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:21:07,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-03 09:21:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 314. [2025-03-03 09:21:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 263 states have (on average 1.285171102661597) internal successors, (338), 283 states have internal predecessors, (338), 23 states have call successors, (23), 12 states have call predecessors, (23), 27 states have return successors, (62), 18 states have call predecessors, (62), 23 states have call successors, (62) [2025-03-03 09:21:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 423 transitions. [2025-03-03 09:21:07,169 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 423 transitions. Word has length 41 [2025-03-03 09:21:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:07,170 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 423 transitions. [2025-03-03 09:21:07,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6) internal successors, (78), 29 states have internal predecessors, (78), 7 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-03 09:21:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2025-03-03 09:21:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 09:21:07,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:07,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:07,177 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 09:21:07,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:07,372 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:07,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1428229432, now seen corresponding path program 3 times [2025-03-03 09:21:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:07,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865399456] [2025-03-03 09:21:07,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:21:07,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:07,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 5 equivalence classes. [2025-03-03 09:21:07,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 09:21:07,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:21:07,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:21:07,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:07,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865399456] [2025-03-03 09:21:07,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865399456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:07,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487139780] [2025-03-03 09:21:07,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:21:07,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:07,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:07,932 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 09:21:07,933 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 09:21:07,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 5 equivalence classes. [2025-03-03 09:21:07,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 09:21:07,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:21:07,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:07,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-03 09:21:07,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:08,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:21:08,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:21:08,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2025-03-03 09:21:08,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:21:08,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 22 [2025-03-03 09:21:08,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:21:08,246 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-03 09:21:08,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 34 [2025-03-03 09:21:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:21:08,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:08,957 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 126 treesize of output 110 [2025-03-03 09:21:08,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:21:08,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 418 treesize of output 346 [2025-03-03 09:21:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:21:09,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487139780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:09,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:21:09,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 16] total 49 [2025-03-03 09:21:09,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328931591] [2025-03-03 09:21:09,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:09,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 09:21:09,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:09,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 09:21:09,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2070, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 09:21:09,012 INFO L87 Difference]: Start difference. First operand 314 states and 423 transitions. Second operand has 49 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 47 states have internal predecessors, (91), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-03 09:21:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:11,488 INFO L93 Difference]: Finished difference Result 490 states and 635 transitions. [2025-03-03 09:21:11,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-03 09:21:11,488 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 47 states have internal predecessors, (91), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) Word has length 42 [2025-03-03 09:21:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:11,490 INFO L225 Difference]: With dead ends: 490 [2025-03-03 09:21:11,490 INFO L226 Difference]: Without dead ends: 447 [2025-03-03 09:21:11,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3498 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1539, Invalid=9381, Unknown=0, NotChecked=0, Total=10920 [2025-03-03 09:21:11,493 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 344 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:11,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 526 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:21:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-03 09:21:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 350. [2025-03-03 09:21:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 293 states have (on average 1.273037542662116) internal successors, (373), 315 states have internal predecessors, (373), 25 states have call successors, (25), 14 states have call predecessors, (25), 31 states have return successors, (59), 20 states have call predecessors, (59), 25 states have call successors, (59) [2025-03-03 09:21:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 457 transitions. [2025-03-03 09:21:11,541 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 457 transitions. Word has length 42 [2025-03-03 09:21:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:11,542 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 457 transitions. [2025-03-03 09:21:11,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 47 states have internal predecessors, (91), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-03 09:21:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 457 transitions. [2025-03-03 09:21:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:21:11,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:11,543 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:11,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 09:21:11,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:21:11,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:11,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:11,744 INFO L85 PathProgramCache]: Analyzing trace with hash 26772439, now seen corresponding path program 1 times [2025-03-03 09:21:11,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:11,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717270309] [2025-03-03 09:21:11,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:21:11,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:11,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:21:11,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:21:11,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:11,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:21:11,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 09:21:11,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:21:11,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:21:11,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:11,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:21:11,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 09:21:11,809 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 09:21:11,809 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:21:11,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 09:21:11,814 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:11,845 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:21:11,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:21:11 BoogieIcfgContainer [2025-03-03 09:21:11,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:21:11,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:21:11,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:21:11,849 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:21:11,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:19:57" (3/4) ... [2025-03-03 09:21:11,851 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 09:21:11,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:21:11,852 INFO L158 Benchmark]: Toolchain (without parser) took 74743.44ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 123.1MB in the beginning and 176.2MB in the end (delta: -53.1MB). Peak memory consumption was 138.8MB. Max. memory is 16.1GB. [2025-03-03 09:21:11,853 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:21:11,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.75ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 111.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:21:11,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.66ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:21:11,853 INFO L158 Benchmark]: Boogie Preprocessor took 35.08ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:21:11,853 INFO L158 Benchmark]: IcfgBuilder took 264.41ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 94.3MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:21:11,853 INFO L158 Benchmark]: TraceAbstraction took 74251.26ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 93.9MB in the beginning and 176.3MB in the end (delta: -82.3MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. [2025-03-03 09:21:11,854 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 360.7MB. Free memory was 176.3MB in the beginning and 176.2MB in the end (delta: 110.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:21:11,854 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.75ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 111.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.66ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.08ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 264.41ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 94.3MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 74251.26ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 93.9MB in the beginning and 176.3MB in the end (delta: -82.3MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 360.7MB. Free memory was 176.3MB in the beginning and 176.2MB in the end (delta: 110.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 57]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 25. Possible FailurePath: [L17] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [N=2, i=0, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [N=2, i=1, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [N=2, i=2, x={9:0}] [L40] COND FALSE !(i < N) [L45] CALL, EXPR bAnd(x) VAL [N=2, \old(x)={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [N=2, \old(x)={9:0}, i=1, res=-11, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] VAL [N=2, \old(x)={9:0}, i=1, res=-11, x={9:0}] [L25] EXPR res & x[i] VAL [N=2, \old(x)={9:0}, i=1, x={9:0}] [L25] res = res & x[i] [L24] i++ VAL [N=2, \old(x)={9:0}, i=2, res=1, x={9:0}] [L24] COND FALSE !(i < N) [L27] return res; VAL [N=2, \old(x)={9:0}, \result=1, x={9:0}] [L45] RET, EXPR bAnd(x) VAL [N=2, x={9:0}] [L45] ret = bAnd(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp VAL [N=2] [L48] CALL, EXPR bAnd(x) VAL [N=2, \old(x)={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [N=2, \old(x)={9:0}, i=1, res=10, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] VAL [N=2, \old(x)={9:0}, i=1, res=10, x={9:0}] [L25] EXPR res & x[i] VAL [N=2, \old(x)={9:0}, i=1, x={9:0}] [L25] res = res & x[i] [L24] i++ VAL [N=2, \old(x)={9:0}, i=2, res=0, x={9:0}] [L24] COND FALSE !(i < N) [L27] return res; VAL [N=2, \old(x)={9:0}, \result=0, x={9:0}] [L48] RET, EXPR bAnd(x) VAL [N=2, ret=1, x={9:0}] [L48] ret2 = bAnd(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [N=2, i=0, ret2=0, ret=1, temp=10, x={9:0}] [L50] COND TRUE i 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 -> d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 [2025-03-03 09:21:13,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:21:13,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:21:13,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:21:13,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:21:13,922 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:21:13,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bAnd5.i [2025-03-03 09:21:15,056 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884f25021/b9e5a6f6e4d84fc0aa530738a0a24ba2/FLAG4fadb961f [2025-03-03 09:21:15,251 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:21:15,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i [2025-03-03 09:21:15,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884f25021/b9e5a6f6e4d84fc0aa530738a0a24ba2/FLAG4fadb961f [2025-03-03 09:21:15,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884f25021/b9e5a6f6e4d84fc0aa530738a0a24ba2 [2025-03-03 09:21:15,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:21:15,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:21:15,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:21:15,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:21:15,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:21:15,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62314a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15, skipping insertion in model container [2025-03-03 09:21:15,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:21:15,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i[1369,1382] [2025-03-03 09:21:15,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:21:15,776 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:21:15,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i[1369,1382] [2025-03-03 09:21:15,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:21:15,814 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:21:15,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15 WrapperNode [2025-03-03 09:21:15,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:21:15,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:21:15,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:21:15,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:21:15,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,847 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2025-03-03 09:21:15,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:21:15,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:21:15,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:21:15,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:21:15,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,857 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,874 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-03-03 09:21:15,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,880 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:21:15,891 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:21:15,891 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:21:15,891 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:21:15,893 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (1/1) ... [2025-03-03 09:21:15,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:21:15,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:15,919 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 09:21:15,922 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 09:21:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:21:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 09:21:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 09:21:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-03 09:21:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:21:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-03 09:21:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-03 09:21:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-03 09:21:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2025-03-03 09:21:15,942 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2025-03-03 09:21:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:21:15,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:21:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:21:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-03 09:21:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-03 09:21:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-03 09:21:16,003 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:21:16,005 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:21:16,140 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 09:21:16,140 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:21:16,149 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:21:16,149 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:21:16,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:21:16 BoogieIcfgContainer [2025-03-03 09:21:16,149 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:21:16,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:21:16,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:21:16,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:21:16,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:21:15" (1/3) ... [2025-03-03 09:21:16,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43aa5642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:21:16, skipping insertion in model container [2025-03-03 09:21:16,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:15" (2/3) ... [2025-03-03 09:21:16,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43aa5642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:21:16, skipping insertion in model container [2025-03-03 09:21:16,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:21:16" (3/3) ... [2025-03-03 09:21:16,155 INFO L128 eAbstractionObserver]: Analyzing ICFG bAnd5.i [2025-03-03 09:21:16,165 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:21:16,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bAnd5.i that has 2 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:21:16,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:21:16,205 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;@d4d5c1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:21:16,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:21:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:21:16,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:16,213 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:16,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:16,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1022978359, now seen corresponding path program 1 times [2025-03-03 09:21:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:21:16,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396929942] [2025-03-03 09:21:16,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:21:16,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:16,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:16,225 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 09:21:16,226 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 09:21:16,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:21:16,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:21:16,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:16,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:16,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:21:16,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:21:16,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:21:16,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:21:16,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396929942] [2025-03-03 09:21:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396929942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:21:16,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:21:16,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:21:16,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453958407] [2025-03-03 09:21:16,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:21:16,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:21:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:21:16,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:21:16,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:21:16,388 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:21:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:16,423 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2025-03-03 09:21:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:21:16,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-03-03 09:21:16,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:16,429 INFO L225 Difference]: With dead ends: 43 [2025-03-03 09:21:16,429 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 09:21:16,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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 09:21:16,432 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:16,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:16,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 09:21:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-03 09:21:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-03 09:21:16,461 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 25 [2025-03-03 09:21:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:16,462 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-03 09:21:16,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:21:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-03 09:21:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:21:16,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:16,464 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:16,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:21:16,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:16,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:16,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:16,665 INFO L85 PathProgramCache]: Analyzing trace with hash -599441184, now seen corresponding path program 1 times [2025-03-03 09:21:16,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:21:16,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1605012817] [2025-03-03 09:21:16,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:21:16,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:16,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:16,668 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 09:21:16,669 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 09:21:16,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 09:21:16,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:21:16,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:16,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:16,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:21:16,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:21:16,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:21:16,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:21:16,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605012817] [2025-03-03 09:21:16,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605012817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:21:16,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:21:16,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:21:16,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274249346] [2025-03-03 09:21:16,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:21:16,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:21:16,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:21:16,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:21:16,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:21:16,813 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:21:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:16,863 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2025-03-03 09:21:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:21:16,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-03 09:21:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:16,864 INFO L225 Difference]: With dead ends: 33 [2025-03-03 09:21:16,865 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 09:21:16,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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 09:21:16,866 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:16,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 22 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:16,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 09:21:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-03 09:21:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-03 09:21:16,873 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 26 [2025-03-03 09:21:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:16,874 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-03 09:21:16,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:21:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-03 09:21:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:21:16,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:16,874 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:16,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:21:17,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:17,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:17,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash 657417393, now seen corresponding path program 1 times [2025-03-03 09:21:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:21:17,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2120431535] [2025-03-03 09:21:17,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:21:17,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:17,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:17,078 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 09:21:17,078 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 09:21:17,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:21:17,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:21:17,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:17,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:17,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:21:17,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:21:17,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:21:17,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:21:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120431535] [2025-03-03 09:21:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120431535] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:17,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:21:17,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-03 09:21:17,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110105049] [2025-03-03 09:21:17,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:21:17,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:21:17,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:21:17,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:21:17,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:21:17,326 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:21:17,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:17,384 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-03 09:21:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:21:17,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-03 09:21:17,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:17,385 INFO L225 Difference]: With dead ends: 31 [2025-03-03 09:21:17,385 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 09:21:17,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:21:17,386 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:17,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 22 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:17,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 09:21:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-03 09:21:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-03 09:21:17,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 29 [2025-03-03 09:21:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:17,394 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-03 09:21:17,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:21:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-03 09:21:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 09:21:17,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:17,394 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:17,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:21:17,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:17,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:17,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:17,596 INFO L85 PathProgramCache]: Analyzing trace with hash -52044550, now seen corresponding path program 1 times [2025-03-03 09:21:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:21:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [635978762] [2025-03-03 09:21:17,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:21:17,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:17,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:17,599 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 09:21:17,600 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 09:21:17,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 09:21:17,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:21:17,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:17,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:17,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:21:17,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:17,691 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:21:17,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:21:17,785 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:21:17,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635978762] [2025-03-03 09:21:17,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635978762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:17,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:21:17,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2025-03-03 09:21:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19006476] [2025-03-03 09:21:17,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:17,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:21:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:21:17,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:21:17,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:21:17,787 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:21:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:17,935 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2025-03-03 09:21:17,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:21:17,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2025-03-03 09:21:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:17,937 INFO L225 Difference]: With dead ends: 54 [2025-03-03 09:21:17,937 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 09:21:17,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:21:17,938 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:17,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:21:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 09:21:17,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2025-03-03 09:21:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-03 09:21:17,944 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 30 [2025-03-03 09:21:17,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:17,944 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-03 09:21:17,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:21:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-03 09:21:17,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:21:17,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:17,944 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:17,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:21:18,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:18,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:18,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash 919299825, now seen corresponding path program 2 times [2025-03-03 09:21:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:21:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [951819776] [2025-03-03 09:21:18,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:21:18,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:18,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:18,149 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 09:21:18,150 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 09:21:18,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:21:18,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:21:18,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:21:18,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:18,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-03 09:21:18,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:18,672 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 8 treesize of output 1 [2025-03-03 09:21:18,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:21:18,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 23 [2025-03-03 09:21:19,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:21:19,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 55 treesize of output 34 [2025-03-03 09:21:19,197 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:21:19,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:21:19,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:21:19,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 75 treesize of output 58 [2025-03-03 09:21:19,396 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:21:19,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:21:19,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 28