./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/pnr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/pnr2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67f3347d26557d25fb6343192d3c90918276f96e14a8e5c63bb68c9eaee65f5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:24:46,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:24:46,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:24:46,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:24:46,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:24:46,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:24:46,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:24:46,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:24:46,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:24:46,418 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:24:46,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:24:46,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:24:46,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:24:46,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:24:46,418 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:24:46,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:24:46,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:24:46,418 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:24:46,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:24:46,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:24:46,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:24:46,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:24:46,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:24:46,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:24:46,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:24:46,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:24:46,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:24:46,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:24:46,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:24:46,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:24:46,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:24:46,420 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 67f3347d26557d25fb6343192d3c90918276f96e14a8e5c63bb68c9eaee65f5f [2025-03-08 00:24:46,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:24:46,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:24:46,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:24:46,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:24:46,662 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:24:46,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr2.c [2025-03-08 00:24:47,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1e1433f/8b9a3e53113d4525a82d35396e533c9e/FLAGc34a5ed0c [2025-03-08 00:24:48,012 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:24:48,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr2.c [2025-03-08 00:24:48,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1e1433f/8b9a3e53113d4525a82d35396e533c9e/FLAGc34a5ed0c [2025-03-08 00:24:48,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1e1433f/8b9a3e53113d4525a82d35396e533c9e [2025-03-08 00:24:48,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:24:48,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:24:48,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:24:48,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:24:48,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:24:48,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d91769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48, skipping insertion in model container [2025-03-08 00:24:48,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:24:48,492 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr2.c[395,408] [2025-03-08 00:24:48,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:24:48,511 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:24:48,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr2.c[395,408] [2025-03-08 00:24:48,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:24:48,531 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:24:48,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48 WrapperNode [2025-03-08 00:24:48,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:24:48,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:24:48,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:24:48,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:24:48,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,554 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-03-08 00:24:48,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:24:48,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:24:48,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:24:48,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:24:48,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,570 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 4 writes are split as follows [0, 0, 4]. [2025-03-08 00:24:48,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:24:48,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:24:48,577 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:24:48,577 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:24:48,578 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (1/1) ... [2025-03-08 00:24:48,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:24:48,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:48,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:24:48,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:24:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:24:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:24:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:24:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:24:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:24:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:24:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:24:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:24:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2025-03-08 00:24:48,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2025-03-08 00:24:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:24:48,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:24:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:24:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:24:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:24:48,661 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:24:48,662 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:24:48,811 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 00:24:48,812 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:24:48,817 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:24:48,817 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:24:48,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:24:48 BoogieIcfgContainer [2025-03-08 00:24:48,818 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:24:48,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:24:48,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:24:48,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:24:48,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:24:48" (1/3) ... [2025-03-08 00:24:48,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207e3d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:24:48, skipping insertion in model container [2025-03-08 00:24:48,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:48" (2/3) ... [2025-03-08 00:24:48,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207e3d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:24:48, skipping insertion in model container [2025-03-08 00:24:48,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:24:48" (3/3) ... [2025-03-08 00:24:48,825 INFO L128 eAbstractionObserver]: Analyzing ICFG pnr2.c [2025-03-08 00:24:48,836 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:24:48,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pnr2.c that has 2 procedures, 26 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:24:48,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:24:48,887 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;@33954bc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:24:48,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:24:48,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:24:48,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:24:48,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:48,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:48,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:48,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:48,900 INFO L85 PathProgramCache]: Analyzing trace with hash 351630076, now seen corresponding path program 1 times [2025-03-08 00:24:48,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:48,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287414556] [2025-03-08 00:24:48,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:48,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:24:48,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:24:48,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:48,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:49,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:49,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287414556] [2025-03-08 00:24:49,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287414556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:49,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:49,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:24:49,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590194631] [2025-03-08 00:24:49,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:49,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:24:49,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:49,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:24:49,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:24:49,051 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:49,063 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2025-03-08 00:24:49,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:24:49,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 00:24:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:49,069 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:24:49,069 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 00:24:49,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:24:49,075 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:49,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:49,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 00:24:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 00:24:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:24:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-08 00:24:49,100 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 10 [2025-03-08 00:24:49,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:49,100 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-08 00:24:49,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-08 00:24:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:24:49,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:49,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:49,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:24:49,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:49,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash 380259227, now seen corresponding path program 1 times [2025-03-08 00:24:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:49,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055678356] [2025-03-08 00:24:49,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:49,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:24:49,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:24:49,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:49,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:49,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:49,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055678356] [2025-03-08 00:24:49,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055678356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:49,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:49,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:24:49,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20661828] [2025-03-08 00:24:49,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:49,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:24:49,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:49,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:24:49,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:24:49,351 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:49,423 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2025-03-08 00:24:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:24:49,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 00:24:49,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:49,425 INFO L225 Difference]: With dead ends: 35 [2025-03-08 00:24:49,425 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 00:24:49,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:24:49,425 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:49,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 23 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:49,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 00:24:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2025-03-08 00:24:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:24:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-08 00:24:49,432 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 10 [2025-03-08 00:24:49,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:49,433 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-08 00:24:49,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-08 00:24:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:24:49,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:49,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:49,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:24:49,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:49,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:49,435 INFO L85 PathProgramCache]: Analyzing trace with hash 639774870, now seen corresponding path program 1 times [2025-03-08 00:24:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843535356] [2025-03-08 00:24:49,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:49,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:24:49,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:24:49,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:49,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:49,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:49,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843535356] [2025-03-08 00:24:49,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843535356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:49,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679348326] [2025-03-08 00:24:49,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:49,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:49,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:49,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:49,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:24:49,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:24:49,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:24:49,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:49,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:49,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:24:49,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:50,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:24:50,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-08 00:24:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:50,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:50,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 00:24:50,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-08 00:24:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:50,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679348326] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:50,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:50,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 15 [2025-03-08 00:24:50,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985356238] [2025-03-08 00:24:50,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:50,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:24:50,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:50,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:24:50,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:24:50,167 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:24:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:50,343 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2025-03-08 00:24:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:24:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2025-03-08 00:24:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:50,344 INFO L225 Difference]: With dead ends: 59 [2025-03-08 00:24:50,345 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 00:24:50,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:24:50,347 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 87 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:50,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 133 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 00:24:50,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2025-03-08 00:24:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 00:24:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2025-03-08 00:24:50,357 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 24 [2025-03-08 00:24:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:50,357 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-03-08 00:24:50,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:24:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2025-03-08 00:24:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:24:50,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:50,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:50,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:24:50,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:50,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:50,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash 768857589, now seen corresponding path program 1 times [2025-03-08 00:24:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:50,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730938733] [2025-03-08 00:24:50,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:50,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:24:50,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:24:50,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:50,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:50,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:50,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730938733] [2025-03-08 00:24:50,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730938733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:50,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951895565] [2025-03-08 00:24:50,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:50,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:50,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:50,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:50,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:24:50,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:24:50,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:24:50,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:50,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:50,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:24:50,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:50,987 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-08 00:24:51,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:24:51,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:24:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:51,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:51,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 00:24:51,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-08 00:24:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:51,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951895565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:51,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:51,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 19 [2025-03-08 00:24:51,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217023613] [2025-03-08 00:24:51,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:51,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:24:51,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:51,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:24:51,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:24:51,283 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:24:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:51,647 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2025-03-08 00:24:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:24:51,647 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 24 [2025-03-08 00:24:51,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:51,648 INFO L225 Difference]: With dead ends: 80 [2025-03-08 00:24:51,648 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 00:24:51,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:24:51,649 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 168 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:51,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 223 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:24:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 00:24:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 25. [2025-03-08 00:24:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:24:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-08 00:24:51,654 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 24 [2025-03-08 00:24:51,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:51,655 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-08 00:24:51,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:24:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-08 00:24:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:24:51,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:51,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:51,661 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-08 00:24:51,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 00:24:51,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:51,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1530832681, now seen corresponding path program 1 times [2025-03-08 00:24:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:51,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508334051] [2025-03-08 00:24:51,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:51,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:51,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:24:51,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:24:51,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:51,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:52,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:52,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508334051] [2025-03-08 00:24:52,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508334051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:52,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026057080] [2025-03-08 00:24:52,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:52,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:52,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:52,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:52,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:24:52,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:24:52,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:24:52,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:52,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:52,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:24:52,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:52,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:24:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:52,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:52,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-08 00:24:52,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 00:24:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:52,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026057080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:52,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:52,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2025-03-08 00:24:52,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949037589] [2025-03-08 00:24:52,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:52,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:24:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:52,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:24:52,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:24:52,232 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:24:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:52,346 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2025-03-08 00:24:52,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:24:52,347 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2025-03-08 00:24:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:52,347 INFO L225 Difference]: With dead ends: 54 [2025-03-08 00:24:52,347 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 00:24:52,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:24:52,348 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:52,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:52,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 00:24:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2025-03-08 00:24:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 00:24:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2025-03-08 00:24:52,358 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2025-03-08 00:24:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:52,360 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2025-03-08 00:24:52,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:24:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2025-03-08 00:24:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:24:52,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:52,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:52,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:24:52,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:52,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:52,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:52,562 INFO L85 PathProgramCache]: Analyzing trace with hash 956680152, now seen corresponding path program 1 times [2025-03-08 00:24:52,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:52,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062854518] [2025-03-08 00:24:52,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:52,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:52,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:24:52,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:24:52,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:52,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:52,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:52,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062854518] [2025-03-08 00:24:52,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062854518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:52,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084954952] [2025-03-08 00:24:52,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:52,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:52,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:52,745 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:52,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:24:52,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:24:52,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:24:52,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:52,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:52,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 00:24:52,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:52,904 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-08 00:24:52,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:24:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:52,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:53,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-08 00:24:53,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-08 00:24:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:53,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084954952] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:53,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:53,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 23 [2025-03-08 00:24:53,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662409117] [2025-03-08 00:24:53,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:53,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:24:53,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:53,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:24:53,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:24:53,132 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:24:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:53,483 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2025-03-08 00:24:53,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:24:53,484 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2025-03-08 00:24:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:53,485 INFO L225 Difference]: With dead ends: 71 [2025-03-08 00:24:53,485 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 00:24:53,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=876, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 00:24:53,487 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 131 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:53,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 196 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:24:53,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 00:24:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 28. [2025-03-08 00:24:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:24:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-08 00:24:53,495 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 27 [2025-03-08 00:24:53,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:53,496 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-08 00:24:53,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:24:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-08 00:24:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:24:53,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:53,497 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:53,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:24:53,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:53,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:53,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1072775946, now seen corresponding path program 2 times [2025-03-08 00:24:53,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:53,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726425068] [2025-03-08 00:24:53,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:53,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:53,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-08 00:24:53,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:24:53,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:53,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:53,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:53,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726425068] [2025-03-08 00:24:53,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726425068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:53,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796680934] [2025-03-08 00:24:53,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:53,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:53,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:53,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:53,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:24:53,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-08 00:24:53,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:24:53,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:53,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:53,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:24:53,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:54,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796680934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:54,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:54,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2025-03-08 00:24:54,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862413526] [2025-03-08 00:24:54,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:54,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 00:24:54,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:54,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 00:24:54,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:24:54,171 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:24:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:54,316 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2025-03-08 00:24:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:24:54,317 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2025-03-08 00:24:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:54,317 INFO L225 Difference]: With dead ends: 56 [2025-03-08 00:24:54,317 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:24:54,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=493, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:24:54,318 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 129 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:54,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 60 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:24:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2025-03-08 00:24:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 00:24:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-03-08 00:24:54,327 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 30 [2025-03-08 00:24:54,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:54,327 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-03-08 00:24:54,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:24:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2025-03-08 00:24:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:24:54,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:54,328 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:54,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:24:54,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:54,529 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:54,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash 44390001, now seen corresponding path program 3 times [2025-03-08 00:24:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:54,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176662428] [2025-03-08 00:24:54,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:54,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:54,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-03-08 00:24:54,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 44 statements. [2025-03-08 00:24:54,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:24:54,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:24:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176662428] [2025-03-08 00:24:54,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176662428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531386546] [2025-03-08 00:24:54,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:54,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:54,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:54,789 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:54,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:24:54,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-03-08 00:24:54,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 44 statements. [2025-03-08 00:24:54,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:24:54,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:54,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 00:24:54,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:54,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:24:54,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-08 00:24:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:24:55,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:55,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-08 00:24:55,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 00:24:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:24:55,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531386546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:55,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:55,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 24 [2025-03-08 00:24:55,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919445810] [2025-03-08 00:24:55,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:55,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 00:24:55,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:55,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 00:24:55,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:24:55,139 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 9 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-08 00:24:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:55,519 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2025-03-08 00:24:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:24:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 9 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 44 [2025-03-08 00:24:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:55,521 INFO L225 Difference]: With dead ends: 90 [2025-03-08 00:24:55,521 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 00:24:55,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=1159, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:24:55,522 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 178 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:55,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 283 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:24:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 00:24:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 47. [2025-03-08 00:24:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:24:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2025-03-08 00:24:55,532 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 44 [2025-03-08 00:24:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:55,533 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2025-03-08 00:24:55,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 states have internal predecessors, (75), 9 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-08 00:24:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2025-03-08 00:24:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:24:55,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:55,536 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:55,542 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-08 00:24:55,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:55,737 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:55,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash -952682352, now seen corresponding path program 1 times [2025-03-08 00:24:55,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:55,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621201941] [2025-03-08 00:24:55,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:55,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:24:55,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:24:55,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:55,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:24:55,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:55,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621201941] [2025-03-08 00:24:55,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621201941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:55,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99460617] [2025-03-08 00:24:55,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:55,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:55,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:55,978 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:55,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:24:56,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:24:56,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:24:56,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:56,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:56,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 00:24:56,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:56,171 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-08 00:24:56,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:24:56,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:24:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:24:56,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:56,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-08 00:24:56,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-08 00:24:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:24:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99460617] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:56,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:56,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 31 [2025-03-08 00:24:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780633677] [2025-03-08 00:24:56,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:56,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 00:24:56,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:56,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 00:24:56,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:24:56,549 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 31 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 31 states have internal predecessors, (81), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-08 00:25:01,123 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-08 00:25:05,176 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-08 00:25:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:05,282 INFO L93 Difference]: Finished difference Result 133 states and 179 transitions. [2025-03-08 00:25:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 00:25:05,282 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 31 states have internal predecessors, (81), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 44 [2025-03-08 00:25:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:05,283 INFO L225 Difference]: With dead ends: 133 [2025-03-08 00:25:05,283 INFO L226 Difference]: Without dead ends: 131 [2025-03-08 00:25:05,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=554, Invalid=2416, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 00:25:05,285 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 418 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 150 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:05,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 286 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 607 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-03-08 00:25:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-08 00:25:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 51. [2025-03-08 00:25:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 00:25:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2025-03-08 00:25:05,305 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 44 [2025-03-08 00:25:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:05,305 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-03-08 00:25:05,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 31 states have internal predecessors, (81), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-08 00:25:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2025-03-08 00:25:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:25:05,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:05,306 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:05,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:25:05,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:05,506 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:05,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash -426532580, now seen corresponding path program 4 times [2025-03-08 00:25:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:05,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995970761] [2025-03-08 00:25:05,507 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:25:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:05,514 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-08 00:25:05,519 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 47 statements. [2025-03-08 00:25:05,519 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:25:05,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:25:05,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995970761] [2025-03-08 00:25:05,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995970761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461600915] [2025-03-08 00:25:05,697 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:25:05,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:05,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:05,700 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:25:05,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:25:05,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-08 00:25:05,751 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 47 statements. [2025-03-08 00:25:05,751 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:25:05,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:05,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 00:25:05,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:05,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 00:25:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:25:05,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:25:05,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-08 00:25:05,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 00:25:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:25:05,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461600915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:25:05,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:25:05,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2025-03-08 00:25:05,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205005350] [2025-03-08 00:25:05,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:25:05,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:25:05,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:25:05,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:25:05,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:25:05,932 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:25:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:06,327 INFO L93 Difference]: Finished difference Result 150 states and 208 transitions. [2025-03-08 00:25:06,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 00:25:06,327 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-03-08 00:25:06,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:06,328 INFO L225 Difference]: With dead ends: 150 [2025-03-08 00:25:06,328 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 00:25:06,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:25:06,329 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 50 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:06,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 233 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:25:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 00:25:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 94. [2025-03-08 00:25:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 00:25:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2025-03-08 00:25:06,349 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 47 [2025-03-08 00:25:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:06,349 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2025-03-08 00:25:06,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:25:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2025-03-08 00:25:06,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:25:06,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:06,350 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:06,356 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-08 00:25:06,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:25:06,553 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:06,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1081019229, now seen corresponding path program 1 times [2025-03-08 00:25:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:06,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313686088] [2025-03-08 00:25:06,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:25:06,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:06,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:25:06,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:25:06,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:25:06,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:25:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313686088] [2025-03-08 00:25:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313686088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105371126] [2025-03-08 00:25:06,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:25:06,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:06,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:06,819 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:25:06,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:25:06,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:25:06,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:25:06,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:25:06,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:06,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 00:25:06,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:07,012 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-08 00:25:07,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:25:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:25:07,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:25:07,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-08 00:25:07,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-08 00:25:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:25:07,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105371126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:25:07,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:25:07,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-03-08 00:25:07,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60925086] [2025-03-08 00:25:07,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:25:07,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 00:25:07,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:25:07,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 00:25:07,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2025-03-08 00:25:07,388 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 28 states have internal predecessors, (88), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 00:25:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:08,548 INFO L93 Difference]: Finished difference Result 270 states and 393 transitions. [2025-03-08 00:25:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 00:25:08,549 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 28 states have internal predecessors, (88), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 47 [2025-03-08 00:25:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:08,553 INFO L225 Difference]: With dead ends: 270 [2025-03-08 00:25:08,553 INFO L226 Difference]: Without dead ends: 268 [2025-03-08 00:25:08,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=533, Invalid=2889, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 00:25:08,554 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 183 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:08,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 585 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:25:08,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-08 00:25:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 54. [2025-03-08 00:25:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 00:25:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-03-08 00:25:08,572 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 47 [2025-03-08 00:25:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:08,573 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-03-08 00:25:08,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 28 states have internal predecessors, (88), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 00:25:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-03-08 00:25:08,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 00:25:08,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:08,574 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:08,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:25:08,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:08,775 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:08,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1977012881, now seen corresponding path program 5 times [2025-03-08 00:25:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924572276] [2025-03-08 00:25:08,776 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:25:08,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:08,781 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 5 equivalence classes. [2025-03-08 00:25:08,791 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 00:25:08,791 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:25:08,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:25:08,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:08,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924572276] [2025-03-08 00:25:08,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924572276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:08,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940432253] [2025-03-08 00:25:08,978 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:25:08,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:08,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:08,981 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:25:08,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:25:09,023 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 5 equivalence classes. [2025-03-08 00:25:09,059 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 00:25:09,060 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:25:09,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:09,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:25:09,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:25:09,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:25:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:25:09,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940432253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:25:09,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:25:09,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 30 [2025-03-08 00:25:09,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921131318] [2025-03-08 00:25:09,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:25:09,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 00:25:09,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:25:09,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 00:25:09,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:25:09,558 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 30 states, 30 states have (on average 3.2333333333333334) internal successors, (97), 30 states have internal predecessors, (97), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 00:25:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:09,751 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2025-03-08 00:25:09,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:25:09,751 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.2333333333333334) internal successors, (97), 30 states have internal predecessors, (97), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 50 [2025-03-08 00:25:09,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:09,752 INFO L225 Difference]: With dead ends: 98 [2025-03-08 00:25:09,752 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 00:25:09,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 00:25:09,753 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 92 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:09,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 111 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:25:09,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 00:25:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2025-03-08 00:25:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:25:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2025-03-08 00:25:09,763 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 50 [2025-03-08 00:25:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:09,763 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2025-03-08 00:25:09,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.2333333333333334) internal successors, (97), 30 states have internal predecessors, (97), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 00:25:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2025-03-08 00:25:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 00:25:09,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:09,764 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:09,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:25:09,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:25:09,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:09,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash 161800332, now seen corresponding path program 6 times [2025-03-08 00:25:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:09,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081140457] [2025-03-08 00:25:09,965 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:25:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:09,973 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 6 equivalence classes. [2025-03-08 00:25:09,999 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 00:25:09,999 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:25:09,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 00:25:10,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:10,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081140457] [2025-03-08 00:25:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081140457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375367435] [2025-03-08 00:25:10,248 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:25:10,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:10,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:10,250 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:25:10,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:25:10,293 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 6 equivalence classes. [2025-03-08 00:25:10,340 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 00:25:10,340 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:25:10,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:10,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 00:25:10,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:10,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 00:25:18,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 00:25:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 00:25:18,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:25:22,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-08 00:25:22,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-08 00:25:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 00:25:22,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375367435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:25:22,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:25:22,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 28 [2025-03-08 00:25:22,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566509590] [2025-03-08 00:25:22,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:25:22,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 00:25:22,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:25:22,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 00:25:22,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=644, Unknown=3, NotChecked=0, Total=756 [2025-03-08 00:25:22,849 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-08 00:25:26,889 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-08 00:25:30,897 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-08 00:25:34,913 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-08 00:25:42,935 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-08 00:25:46,955 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-08 00:25:50,985 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-08 00:25:59,007 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-08 00:26:03,021 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-08 00:26:07,033 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-08 00:26:15,061 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-08 00:26:19,076 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-08 00:26:27,115 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-08 00:26:31,125 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]