./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/zero_sum5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/zero_sum5.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 1caf94d5755d978efe1a3e5e557e469a697b8b845c60d509025c0b6bf4eae4ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:23:08,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:23:08,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:23:08,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:23:08,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:23:08,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:23:08,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:23:08,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:23:08,394 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:23:08,394 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:23:08,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:23:08,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:23:08,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:23:08,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:23:08,395 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:23:08,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:23:08,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:23:08,396 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:23:08,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:23:08,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:23:08,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:23:08,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:23:08,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:23:08,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:23:08,397 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:23:08,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:23:08,397 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:23:08,397 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:23:08,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:23:08,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:23:08,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:23:08,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:23:08,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:23:08,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:23:08,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:23:08,398 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:23:08,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:23:08,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:23:08,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:23:08,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:23:08,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:23:08,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:23:08,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:23:08,399 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 -> 1caf94d5755d978efe1a3e5e557e469a697b8b845c60d509025c0b6bf4eae4ae [2025-03-03 09:23:08,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:23:08,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:23:08,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:23:08,651 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:23:08,651 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:23:08,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/zero_sum5.c [2025-03-03 09:23:09,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e121c114/6c597f40fd2f478c92d027b4b9e9d5fa/FLAGd30403b96 [2025-03-03 09:23:10,067 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:23:10,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/zero_sum5.c [2025-03-03 09:23:10,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e121c114/6c597f40fd2f478c92d027b4b9e9d5fa/FLAGd30403b96 [2025-03-03 09:23:10,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e121c114/6c597f40fd2f478c92d027b4b9e9d5fa [2025-03-03 09:23:10,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:23:10,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:23:10,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:23:10,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:23:10,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:23:10,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317a23d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10, skipping insertion in model container [2025-03-03 09:23:10,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:23:10,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/zero_sum5.c[400,413] [2025-03-03 09:23:10,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:23:10,500 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:23:10,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/zero_sum5.c[400,413] [2025-03-03 09:23:10,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:23:10,525 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:23:10,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10 WrapperNode [2025-03-03 09:23:10,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:23:10,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:23:10,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:23:10,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:23:10,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,549 INFO L138 Inliner]: procedures = 15, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 119 [2025-03-03 09:23:10,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:23:10,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:23:10,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:23:10,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:23:10,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,578 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-03 09:23:10,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:23:10,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:23:10,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:23:10,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:23:10,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (1/1) ... [2025-03-03 09:23:10,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:23:10,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:10,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:23:10,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:23:10,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:23:10,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:23:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:23:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:23:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:23:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:23:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:23:10,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:23:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:23:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:23:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:23:10,701 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:23:10,704 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:23:10,853 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-03 09:23:10,855 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:23:10,860 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:23:10,861 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:23:10,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:23:10 BoogieIcfgContainer [2025-03-03 09:23:10,862 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:23:10,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:23:10,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:23:10,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:23:10,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:23:10" (1/3) ... [2025-03-03 09:23:10,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63815f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:23:10, skipping insertion in model container [2025-03-03 09:23:10,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:23:10" (2/3) ... [2025-03-03 09:23:10,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63815f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:23:10, skipping insertion in model container [2025-03-03 09:23:10,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:23:10" (3/3) ... [2025-03-03 09:23:10,869 INFO L128 eAbstractionObserver]: Analyzing ICFG zero_sum5.c [2025-03-03 09:23:10,880 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:23:10,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG zero_sum5.c that has 1 procedures, 22 locations, 1 initial locations, 11 loop locations, and 1 error locations. [2025-03-03 09:23:10,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:23:10,933 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;@43431ee7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:23:10,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:23:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:23:10,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:10,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:10,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:10,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash 874873363, now seen corresponding path program 1 times [2025-03-03 09:23:10,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:10,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739796416] [2025-03-03 09:23:10,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:23:10,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:11,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:23:11,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:23:11,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:23:11,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:23:11,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:11,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739796416] [2025-03-03 09:23:11,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739796416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:23:11,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:23:11,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:23:11,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311630954] [2025-03-03 09:23:11,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:23:11,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:23:11,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:11,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:23:11,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:23:11,183 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:11,246 INFO L93 Difference]: Finished difference Result 41 states and 64 transitions. [2025-03-03 09:23:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:23:11,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2025-03-03 09:23:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:11,254 INFO L225 Difference]: With dead ends: 41 [2025-03-03 09:23:11,254 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 09:23:11,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:23:11,259 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:11,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:23:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 09:23:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-03 09:23:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2025-03-03 09:23:11,280 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 16 [2025-03-03 09:23:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:11,280 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2025-03-03 09:23:11,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2025-03-03 09:23:11,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:23:11,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:11,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:11,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:23:11,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:11,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:11,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1764972462, now seen corresponding path program 1 times [2025-03-03 09:23:11,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:11,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520933563] [2025-03-03 09:23:11,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:23:11,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:11,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:23:11,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:23:11,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:23:11,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:23:11,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:11,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520933563] [2025-03-03 09:23:11,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520933563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:23:11,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:23:11,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:23:11,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011890005] [2025-03-03 09:23:11,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:23:11,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:23:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:11,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:23:11,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:23:11,393 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:11,449 INFO L93 Difference]: Finished difference Result 40 states and 68 transitions. [2025-03-03 09:23:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:23:11,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 09:23:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:11,450 INFO L225 Difference]: With dead ends: 40 [2025-03-03 09:23:11,450 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 09:23:11,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:23:11,451 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:11,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:23:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 09:23:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 09:23:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2025-03-03 09:23:11,459 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2025-03-03 09:23:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:11,459 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2025-03-03 09:23:11,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2025-03-03 09:23:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:23:11,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:11,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:11,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:23:11,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:11,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash -850661998, now seen corresponding path program 1 times [2025-03-03 09:23:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:11,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614102948] [2025-03-03 09:23:11,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:23:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:11,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:23:11,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:23:11,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:23:11,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:23:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614102948] [2025-03-03 09:23:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614102948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292033382] [2025-03-03 09:23:11,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:23:11,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:11,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:11,625 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:11,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:23:11,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:23:11,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:23:11,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:23:11,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:11,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:23:11,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:23:11,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:23:11,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292033382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:11,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:11,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 09:23:11,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847501367] [2025-03-03 09:23:11,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:11,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:23:11,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:11,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:23:11,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:23:11,775 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:11,831 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2025-03-03 09:23:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:23:11,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 27 [2025-03-03 09:23:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:11,832 INFO L225 Difference]: With dead ends: 52 [2025-03-03 09:23:11,832 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 09:23:11,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:23:11,833 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:11,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:23:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 09:23:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-03 09:23:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2025-03-03 09:23:11,837 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 27 [2025-03-03 09:23:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:11,837 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-03 09:23:11,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2025-03-03 09:23:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:23:11,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:11,838 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:11,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:23:12,038 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-03 09:23:12,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:12,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:12,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1334360563, now seen corresponding path program 2 times [2025-03-03 09:23:12,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:12,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821060560] [2025-03-03 09:23:12,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:23:12,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:12,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-03 09:23:12,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:23:12,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:23:12,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:23:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:12,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821060560] [2025-03-03 09:23:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821060560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:12,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416289207] [2025-03-03 09:23:12,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:23:12,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:12,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:12,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:12,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:23:12,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-03 09:23:12,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:23:12,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:23:12,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:12,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:23:12,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:23:12,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:23:12,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416289207] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:12,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 09:23:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207913453] [2025-03-03 09:23:12,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:23:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:12,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:23:12,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:23:12,309 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:12,400 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2025-03-03 09:23:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:23:12,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 28 [2025-03-03 09:23:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:12,401 INFO L225 Difference]: With dead ends: 60 [2025-03-03 09:23:12,402 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 09:23:12,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:23:12,403 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:12,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 11 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:23:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 09:23:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-03 09:23:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2025-03-03 09:23:12,410 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 28 [2025-03-03 09:23:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:12,411 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2025-03-03 09:23:12,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2025-03-03 09:23:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:23:12,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:12,413 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:12,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:23:12,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 09:23:12,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:12,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:12,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1301168973, now seen corresponding path program 3 times [2025-03-03 09:23:12,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:12,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737273223] [2025-03-03 09:23:12,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:23:12,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:12,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 2 equivalence classes. [2025-03-03 09:23:12,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:23:12,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:23:12,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:23:14,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:14,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737273223] [2025-03-03 09:23:14,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737273223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:14,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531312533] [2025-03-03 09:23:14,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:23:14,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:14,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:14,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:14,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:23:14,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 2 equivalence classes. [2025-03-03 09:23:14,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:23:14,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:23:14,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:14,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-03 09:23:14,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:23:14,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:14,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:23:14,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-03 09:23:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:23:15,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531312533] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:15,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:15,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 21 [2025-03-03 09:23:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381223567] [2025-03-03 09:23:15,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:15,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 09:23:15,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:15,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 09:23:15,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:23:15,015 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:15,290 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2025-03-03 09:23:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:23:15,290 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 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 38 [2025-03-03 09:23:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:15,291 INFO L225 Difference]: With dead ends: 70 [2025-03-03 09:23:15,291 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 09:23:15,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:23:15,292 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:15,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:23:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 09:23:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-03-03 09:23:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2025-03-03 09:23:15,300 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 38 [2025-03-03 09:23:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:15,300 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2025-03-03 09:23:15,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2025-03-03 09:23:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:23:15,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:15,303 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:15,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:23:15,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:15,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:15,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1681500750, now seen corresponding path program 4 times [2025-03-03 09:23:15,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:15,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324687726] [2025-03-03 09:23:15,510 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:23:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:15,518 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-03 09:23:15,530 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 39 statements. [2025-03-03 09:23:15,530 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:23:15,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:23:15,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:15,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324687726] [2025-03-03 09:23:15,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324687726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:15,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152721035] [2025-03-03 09:23:15,594 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:23:15,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:15,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:15,596 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:15,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:23:15,632 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-03 09:23:15,647 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 39 statements. [2025-03-03 09:23:15,647 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:23:15,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:15,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:23:15,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:23:15,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:23:15,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152721035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:15,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:15,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-03 09:23:15,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351574506] [2025-03-03 09:23:15,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:15,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:23:15,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:15,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:23:15,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:23:15,775 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:15,992 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2025-03-03 09:23:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:23:15,992 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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 39 [2025-03-03 09:23:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:15,993 INFO L225 Difference]: With dead ends: 131 [2025-03-03 09:23:15,993 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 09:23:15,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:23:15,994 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:15,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:23:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 09:23:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-03-03 09:23:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2025-03-03 09:23:16,006 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 39 [2025-03-03 09:23:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:16,007 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2025-03-03 09:23:16,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2025-03-03 09:23:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:23:16,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:16,008 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:16,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:23:16,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:16,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:16,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:16,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1909823890, now seen corresponding path program 5 times [2025-03-03 09:23:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:16,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781216902] [2025-03-03 09:23:16,210 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:23:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:16,217 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 3 equivalence classes. [2025-03-03 09:23:16,229 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:23:16,229 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:23:16,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:23:16,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:16,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781216902] [2025-03-03 09:23:16,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781216902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:16,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102489378] [2025-03-03 09:23:16,302 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:23:16,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:16,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:16,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:16,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:23:16,349 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 3 equivalence classes. [2025-03-03 09:23:16,391 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:23:16,391 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:23:16,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:16,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:23:16,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:23:16,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:23:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102489378] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:16,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:16,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-03 09:23:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310053254] [2025-03-03 09:23:16,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:16,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:23:16,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:16,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:23:16,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:23:16,520 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:16,686 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2025-03-03 09:23:16,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:23:16,686 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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 39 [2025-03-03 09:23:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:16,687 INFO L225 Difference]: With dead ends: 76 [2025-03-03 09:23:16,687 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 09:23:16,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:23:16,688 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:16,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 21 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:23:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 09:23:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 09:23:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-03-03 09:23:16,697 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 39 [2025-03-03 09:23:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:16,698 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-03-03 09:23:16,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-03-03 09:23:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:23:16,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:16,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:16,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:23:16,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:16,903 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:16,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1454994611, now seen corresponding path program 6 times [2025-03-03 09:23:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:16,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246085386] [2025-03-03 09:23:16,904 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:23:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:16,912 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 3 equivalence classes. [2025-03-03 09:23:16,924 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:23:16,924 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 09:23:16,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:23:17,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:17,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246085386] [2025-03-03 09:23:17,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246085386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:17,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149026696] [2025-03-03 09:23:17,002 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:23:17,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:17,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:17,004 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:17,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:23:17,039 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 3 equivalence classes. [2025-03-03 09:23:17,064 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:23:17,064 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 09:23:17,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:17,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:23:17,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:23:17,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:23:17,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149026696] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:17,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:17,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:23:17,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393419638] [2025-03-03 09:23:17,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:17,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:23:17,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:17,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:23:17,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:23:17,191 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:17,264 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2025-03-03 09:23:17,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:23:17,264 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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 48 [2025-03-03 09:23:17,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:17,265 INFO L225 Difference]: With dead ends: 93 [2025-03-03 09:23:17,265 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 09:23:17,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:23:17,266 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:17,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:23:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 09:23:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-03 09:23:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-03-03 09:23:17,270 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 48 [2025-03-03 09:23:17,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:17,270 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-03-03 09:23:17,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-03-03 09:23:17,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 09:23:17,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:17,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:17,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:23:17,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:17,472 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:17,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1533009650, now seen corresponding path program 7 times [2025-03-03 09:23:17,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:17,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91502226] [2025-03-03 09:23:17,473 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:23:17,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:17,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 09:23:17,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:23:17,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:23:17,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:23:20,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:20,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91502226] [2025-03-03 09:23:20,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91502226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:20,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438491693] [2025-03-03 09:23:20,323 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:23:20,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:20,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:20,325 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:20,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:23:20,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 09:23:20,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:23:20,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:23:20,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:20,401 WARN L254 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 138 conjuncts are in the unsatisfiable core [2025-03-03 09:23:20,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:20,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:23:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:23:20,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:23:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438491693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:21,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:21,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 15, 11] total 47 [2025-03-03 09:23:21,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819424486] [2025-03-03 09:23:21,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:21,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-03 09:23:21,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:21,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-03 09:23:21,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1987, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 09:23:21,170 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 47 states, 47 states have (on average 2.765957446808511) internal successors, (130), 47 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:23,507 INFO L93 Difference]: Finished difference Result 204 states and 262 transitions. [2025-03-03 09:23:23,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 09:23:23,508 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.765957446808511) internal successors, (130), 47 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-03 09:23:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:23,508 INFO L225 Difference]: With dead ends: 204 [2025-03-03 09:23:23,508 INFO L226 Difference]: Without dead ends: 142 [2025-03-03 09:23:23,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=500, Invalid=4612, Unknown=0, NotChecked=0, Total=5112 [2025-03-03 09:23:23,511 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:23,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 78 Invalid, 2845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 2296 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 09:23:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-03 09:23:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 81. [2025-03-03 09:23:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2025-03-03 09:23:23,523 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 49 [2025-03-03 09:23:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:23,524 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2025-03-03 09:23:23,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.765957446808511) internal successors, (130), 47 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2025-03-03 09:23:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 09:23:23,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:23,524 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:23,530 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-03 09:23:23,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:23,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:23,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2058268206, now seen corresponding path program 8 times [2025-03-03 09:23:23,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:23,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734127147] [2025-03-03 09:23:23,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:23:23,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:23,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-03 09:23:23,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:23:23,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:23:23,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 09:23:23,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:23,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734127147] [2025-03-03 09:23:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734127147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324636815] [2025-03-03 09:23:23,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:23:23,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:23,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:23,831 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:23,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:23:23,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-03 09:23:23,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:23:23,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:23:23,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:23,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:23:23,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 09:23:23,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 09:23:23,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324636815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:23,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:23,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-03 09:23:23,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086846026] [2025-03-03 09:23:23,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:23,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:23:23,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:23,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:23:23,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:23:23,995 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:24,121 INFO L93 Difference]: Finished difference Result 130 states and 166 transitions. [2025-03-03 09:23:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:23:24,122 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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 51 [2025-03-03 09:23:24,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:24,122 INFO L225 Difference]: With dead ends: 130 [2025-03-03 09:23:24,122 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 09:23:24,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:23:24,123 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:24,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 22 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:23:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 09:23:24,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-03 09:23:24,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2025-03-03 09:23:24,137 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 51 [2025-03-03 09:23:24,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:24,137 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2025-03-03 09:23:24,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2025-03-03 09:23:24,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 09:23:24,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:24,138 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:24,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:23:24,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:23:24,339 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:24,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash 716586835, now seen corresponding path program 9 times [2025-03-03 09:23:24,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:24,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539235213] [2025-03-03 09:23:24,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:23:24,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:24,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 3 equivalence classes. [2025-03-03 09:23:24,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 09:23:24,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:23:24,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:23:27,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:27,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539235213] [2025-03-03 09:23:27,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539235213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:27,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27372594] [2025-03-03 09:23:27,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:23:27,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:27,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:27,715 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:27,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:23:27,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 3 equivalence classes. [2025-03-03 09:23:27,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 09:23:27,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:23:27,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:27,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 189 conjuncts are in the unsatisfiable core [2025-03-03 09:23:27,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:29,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:23:29,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2025-03-03 09:23:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:23:29,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:30,593 INFO L349 Elim1Store]: treesize reduction 24, result has 85.5 percent of original size [2025-03-03 09:23:30,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 69 treesize of output 153 [2025-03-03 09:23:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:23:31,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27372594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:31,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:31,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 31, 34] total 105 [2025-03-03 09:23:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284867652] [2025-03-03 09:23:31,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:31,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2025-03-03 09:23:31,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:31,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2025-03-03 09:23:31,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=10155, Unknown=0, NotChecked=0, Total=10920 [2025-03-03 09:23:31,438 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 105 states, 105 states have (on average 1.619047619047619) internal successors, (170), 105 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:34,750 INFO L93 Difference]: Finished difference Result 185 states and 235 transitions. [2025-03-03 09:23:34,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-03 09:23:34,751 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 1.619047619047619) internal successors, (170), 105 states have internal predecessors, (170), 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 60 [2025-03-03 09:23:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:34,752 INFO L225 Difference]: With dead ends: 185 [2025-03-03 09:23:34,752 INFO L226 Difference]: Without dead ends: 182 [2025-03-03 09:23:34,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6619 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1307, Invalid=15723, Unknown=0, NotChecked=0, Total=17030 [2025-03-03 09:23:34,756 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4379 mSolverCounterSat, 695 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 5074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 695 IncrementalHoareTripleChecker+Valid, 4379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:34,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 5074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [695 Valid, 4379 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 09:23:34,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-03 09:23:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2025-03-03 09:23:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.2738095238095237) internal successors, (214), 168 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 214 transitions. [2025-03-03 09:23:34,788 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 214 transitions. Word has length 60 [2025-03-03 09:23:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:34,788 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 214 transitions. [2025-03-03 09:23:34,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 1.619047619047619) internal successors, (170), 105 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 214 transitions. [2025-03-03 09:23:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 09:23:34,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:34,789 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:34,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:23:34,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:34,990 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:34,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash 674743026, now seen corresponding path program 10 times [2025-03-03 09:23:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:34,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605836547] [2025-03-03 09:23:34,990 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:23:34,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:34,996 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 61 statements into 2 equivalence classes. [2025-03-03 09:23:35,000 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 61 statements. [2025-03-03 09:23:35,000 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:23:35,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 09:23:35,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:35,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605836547] [2025-03-03 09:23:35,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605836547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:35,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709991927] [2025-03-03 09:23:35,087 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:23:35,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:35,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:35,089 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:35,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:23:35,132 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 61 statements into 2 equivalence classes. [2025-03-03 09:23:35,154 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 61 statements. [2025-03-03 09:23:35,154 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:23:35,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:35,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:23:35,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 09:23:35,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 09:23:35,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709991927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:35,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:35,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-03 09:23:35,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398889628] [2025-03-03 09:23:35,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:35,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:23:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:35,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:23:35,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:23:35,338 INFO L87 Difference]: Start difference. First operand 169 states and 214 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:35,603 INFO L93 Difference]: Finished difference Result 310 states and 386 transitions. [2025-03-03 09:23:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:23:35,603 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 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 61 [2025-03-03 09:23:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:35,604 INFO L225 Difference]: With dead ends: 310 [2025-03-03 09:23:35,604 INFO L226 Difference]: Without dead ends: 120 [2025-03-03 09:23:35,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 107 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:23:35,606 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:35,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:23:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-03 09:23:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2025-03-03 09:23:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.1743119266055047) internal successors, (128), 109 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2025-03-03 09:23:35,625 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 61 [2025-03-03 09:23:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:35,625 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2025-03-03 09:23:35,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2025-03-03 09:23:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 09:23:35,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:35,626 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:35,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 09:23:35,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:23:35,826 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:35,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:35,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1309273358, now seen corresponding path program 11 times [2025-03-03 09:23:35,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:35,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357679144] [2025-03-03 09:23:35,827 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:23:35,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:35,832 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 61 statements into 4 equivalence classes. [2025-03-03 09:23:35,847 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 09:23:35,848 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 09:23:35,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 09:23:35,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:35,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357679144] [2025-03-03 09:23:35,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357679144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:35,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212082630] [2025-03-03 09:23:35,942 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:23:35,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:35,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:35,944 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-03 09:23:35,950 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-03 09:23:35,986 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 61 statements into 4 equivalence classes. [2025-03-03 09:23:36,109 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 09:23:36,109 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 09:23:36,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:36,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:23:36,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 09:23:36,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 09:23:36,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212082630] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:36,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:36,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-03 09:23:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567955733] [2025-03-03 09:23:36,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:36,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:23:36,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:36,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:23:36,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:23:36,237 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:36,408 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2025-03-03 09:23:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:23:36,408 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 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 61 [2025-03-03 09:23:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:36,409 INFO L225 Difference]: With dead ends: 114 [2025-03-03 09:23:36,409 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 09:23:36,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 106 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:23:36,410 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:36,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:23:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 09:23:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 09:23:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2025-03-03 09:23:36,421 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 61 [2025-03-03 09:23:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:36,421 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2025-03-03 09:23:36,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2025-03-03 09:23:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 09:23:36,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:36,422 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:36,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 09:23:36,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:23:36,622 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:36,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:36,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1705437011, now seen corresponding path program 12 times [2025-03-03 09:23:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:36,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693110600] [2025-03-03 09:23:36,623 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:23:36,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:36,629 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 4 equivalence classes. [2025-03-03 09:23:36,650 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 09:23:36,650 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 09:23:36,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-03 09:23:36,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:36,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693110600] [2025-03-03 09:23:36,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693110600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:36,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056183663] [2025-03-03 09:23:36,760 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:23:36,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:36,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:36,762 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:36,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:23:36,808 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 4 equivalence classes. [2025-03-03 09:23:36,847 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 09:23:36,847 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 09:23:36,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:36,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:23:36,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-03 09:23:36,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-03 09:23:36,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056183663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:36,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:36,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-03 09:23:36,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140696508] [2025-03-03 09:23:36,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:36,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:23:36,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:36,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:23:36,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:23:36,996 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:37,066 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2025-03-03 09:23:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:23:37,066 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 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 70 [2025-03-03 09:23:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:37,067 INFO L225 Difference]: With dead ends: 135 [2025-03-03 09:23:37,067 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 09:23:37,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 124 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:23:37,067 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:37,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:23:37,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 09:23:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-03 09:23:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2025-03-03 09:23:37,079 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 70 [2025-03-03 09:23:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:37,079 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2025-03-03 09:23:37,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2025-03-03 09:23:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 09:23:37,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:37,080 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:37,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:23:37,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:23:37,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:37,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:37,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1787393966, now seen corresponding path program 13 times [2025-03-03 09:23:37,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:37,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838012166] [2025-03-03 09:23:37,281 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:23:37,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:37,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 09:23:37,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:23:37,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:23:37,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 9 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:23:42,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838012166] [2025-03-03 09:23:42,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838012166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221252458] [2025-03-03 09:23:42,198 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:23:42,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:42,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:42,200 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:42,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:23:42,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 09:23:42,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:23:42,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:23:42,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:42,289 WARN L254 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 222 conjuncts are in the unsatisfiable core [2025-03-03 09:23:42,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:42,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:23:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:23:42,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:23:43,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221252458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:43,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:43,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 21, 15] total 68 [2025-03-03 09:23:43,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150696334] [2025-03-03 09:23:43,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:43,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-03 09:23:43,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:43,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-03 09:23:43,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4295, Unknown=0, NotChecked=0, Total=4556 [2025-03-03 09:23:43,341 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 68 states, 68 states have (on average 2.8088235294117645) internal successors, (191), 68 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:46,123 INFO L93 Difference]: Finished difference Result 156 states and 193 transitions. [2025-03-03 09:23:46,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-03 09:23:46,123 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.8088235294117645) internal successors, (191), 68 states have internal predecessors, (191), 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 71 [2025-03-03 09:23:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:46,124 INFO L225 Difference]: With dead ends: 156 [2025-03-03 09:23:46,124 INFO L226 Difference]: Without dead ends: 153 [2025-03-03 09:23:46,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=642, Invalid=8288, Unknown=0, NotChecked=0, Total=8930 [2025-03-03 09:23:46,126 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 3436 mSolverCounterSat, 637 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 4073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 637 IncrementalHoareTripleChecker+Valid, 3436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:46,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 101 Invalid, 4073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [637 Valid, 3436 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 09:23:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-03 09:23:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 74. [2025-03-03 09:23:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2025-03-03 09:23:46,146 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 71 [2025-03-03 09:23:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:46,146 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-03-03 09:23:46,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.8088235294117645) internal successors, (191), 68 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2025-03-03 09:23:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 09:23:46,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:46,147 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:46,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:23:46,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:23:46,348 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:46,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash 425393651, now seen corresponding path program 14 times [2025-03-03 09:23:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441577016] [2025-03-03 09:23:46,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:23:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:46,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-03 09:23:46,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 09:23:46,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:23:46,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-03 09:23:46,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441577016] [2025-03-03 09:23:46,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441577016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27818097] [2025-03-03 09:23:46,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:23:46,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:46,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:46,498 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:46,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:23:46,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-03 09:23:46,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 09:23:46,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:23:46,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:46,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:23:46,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-03 09:23:46,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-03 09:23:46,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27818097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:46,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:46,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-03-03 09:23:46,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452412327] [2025-03-03 09:23:46,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:46,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:23:46,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:46,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:23:46,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:23:46,820 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:47,013 INFO L93 Difference]: Finished difference Result 195 states and 226 transitions. [2025-03-03 09:23:47,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 09:23:47,013 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 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 72 [2025-03-03 09:23:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:47,014 INFO L225 Difference]: With dead ends: 195 [2025-03-03 09:23:47,014 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 09:23:47,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:23:47,014 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:47,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:23:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 09:23:47,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-03 09:23:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.162162162162162) internal successors, (86), 74 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2025-03-03 09:23:47,034 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 72 [2025-03-03 09:23:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:47,034 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2025-03-03 09:23:47,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2025-03-03 09:23:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 09:23:47,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:47,035 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:47,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 09:23:47,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:47,240 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:47,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:47,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1815717070, now seen corresponding path program 15 times [2025-03-03 09:23:47,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:47,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821811315] [2025-03-03 09:23:47,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:23:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:47,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 4 equivalence classes. [2025-03-03 09:23:47,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 09:23:47,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:23:47,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-03 09:23:47,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:47,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821811315] [2025-03-03 09:23:47,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821811315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:47,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586990316] [2025-03-03 09:23:47,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:23:47,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:47,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:47,417 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:47,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:23:47,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 4 equivalence classes. [2025-03-03 09:23:47,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 09:23:47,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:23:47,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:47,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:23:47,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-03 09:23:47,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-03 09:23:47,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586990316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:47,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:47,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-03-03 09:23:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915573218] [2025-03-03 09:23:47,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:47,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:23:47,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:47,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:23:47,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:23:47,699 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:47,965 INFO L93 Difference]: Finished difference Result 194 states and 230 transitions. [2025-03-03 09:23:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 09:23:47,965 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 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 73 [2025-03-03 09:23:47,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:47,966 INFO L225 Difference]: With dead ends: 194 [2025-03-03 09:23:47,966 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 09:23:47,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 132 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:23:47,966 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:47,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:23:47,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 09:23:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2025-03-03 09:23:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 81 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-03-03 09:23:47,987 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 73 [2025-03-03 09:23:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:47,987 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-03-03 09:23:47,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-03-03 09:23:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 09:23:47,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:47,988 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:47,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 09:23:48,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 09:23:48,189 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:48,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:48,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1557331026, now seen corresponding path program 16 times [2025-03-03 09:23:48,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:48,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193219322] [2025-03-03 09:23:48,189 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:23:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:48,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-03-03 09:23:48,205 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 72 of 81 statements. [2025-03-03 09:23:48,205 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:23:48,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-03 09:23:48,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:48,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193219322] [2025-03-03 09:23:48,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193219322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:48,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110335392] [2025-03-03 09:23:48,333 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:23:48,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:48,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:48,335 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:48,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 09:23:48,384 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-03-03 09:23:48,413 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 72 of 81 statements. [2025-03-03 09:23:48,413 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:23:48,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:48,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:23:48,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-03 09:23:48,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-03 09:23:48,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110335392] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:48,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:48,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2025-03-03 09:23:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676787962] [2025-03-03 09:23:48,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:48,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 09:23:48,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:48,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 09:23:48,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:23:48,635 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:48,862 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2025-03-03 09:23:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:23:48,862 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 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 81 [2025-03-03 09:23:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:48,863 INFO L225 Difference]: With dead ends: 86 [2025-03-03 09:23:48,863 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 09:23:48,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 143 SyntacticMatches, 13 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:23:48,863 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:48,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 25 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:23:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 09:23:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 09:23:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2025-03-03 09:23:48,885 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 81 [2025-03-03 09:23:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:48,885 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2025-03-03 09:23:48,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2025-03-03 09:23:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 09:23:48,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:48,886 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:48,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 09:23:49,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 09:23:49,090 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:49,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:49,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1032653299, now seen corresponding path program 17 times [2025-03-03 09:23:49,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:49,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202933237] [2025-03-03 09:23:49,090 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:23:49,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:49,097 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 82 statements into 4 equivalence classes. [2025-03-03 09:23:49,459 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 09:23:49,459 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 09:23:49,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:23:55,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:55,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202933237] [2025-03-03 09:23:55,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202933237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:55,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641968202] [2025-03-03 09:23:55,084 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:23:55,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:55,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:55,087 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:55,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 09:23:55,139 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 82 statements into 4 equivalence classes. [2025-03-03 09:23:55,266 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 09:23:55,267 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 09:23:55,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:55,271 WARN L254 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 261 conjuncts are in the unsatisfiable core [2025-03-03 09:23:55,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:55,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:23:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:23:55,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:23:56,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641968202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:56,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:56,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 24, 17] total 51 [2025-03-03 09:23:56,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483729720] [2025-03-03 09:23:56,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:56,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-03 09:23:56,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:56,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-03 09:23:56,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2392, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 09:23:56,004 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 51 states, 51 states have (on average 3.9019607843137254) internal successors, (199), 51 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:57,072 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2025-03-03 09:23:57,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 09:23:57,072 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.9019607843137254) internal successors, (199), 51 states have internal predecessors, (199), 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 82 [2025-03-03 09:23:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:57,073 INFO L225 Difference]: With dead ends: 150 [2025-03-03 09:23:57,073 INFO L226 Difference]: Without dead ends: 147 [2025-03-03 09:23:57,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=2392, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 09:23:57,074 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 2871 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:57,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 189 Invalid, 2872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2871 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 09:23:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-03 09:23:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2025-03-03 09:23:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.1428571428571428) internal successors, (160), 140 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2025-03-03 09:23:57,115 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 82 [2025-03-03 09:23:57,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:57,115 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2025-03-03 09:23:57,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.9019607843137254) internal successors, (199), 51 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2025-03-03 09:23:57,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 09:23:57,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:57,116 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:57,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 09:23:57,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:57,317 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:57,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:57,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1947512946, now seen corresponding path program 18 times [2025-03-03 09:23:57,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:57,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867367695] [2025-03-03 09:23:57,318 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:23:57,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:57,325 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 83 statements into 5 equivalence classes. [2025-03-03 09:23:57,341 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 09:23:57,341 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:23:57,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-03 09:23:57,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:57,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867367695] [2025-03-03 09:23:57,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867367695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:57,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457087713] [2025-03-03 09:23:57,485 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:23:57,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:57,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:57,487 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:57,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 09:23:57,537 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 83 statements into 5 equivalence classes. [2025-03-03 09:23:57,585 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 09:23:57,585 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:23:57,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:57,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:23:57,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-03 09:23:57,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-03 09:23:57,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457087713] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:57,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:57,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2025-03-03 09:23:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258839570] [2025-03-03 09:23:57,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:57,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 09:23:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:57,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 09:23:57,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:23:57,908 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:58,381 INFO L93 Difference]: Finished difference Result 290 states and 336 transitions. [2025-03-03 09:23:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 09:23:58,381 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-03 09:23:58,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:58,382 INFO L225 Difference]: With dead ends: 290 [2025-03-03 09:23:58,382 INFO L226 Difference]: Without dead ends: 153 [2025-03-03 09:23:58,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 144 SyntacticMatches, 13 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=283, Invalid=1123, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 09:23:58,383 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:58,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:23:58,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-03 09:23:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2025-03-03 09:23:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.1283783783783783) internal successors, (167), 148 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2025-03-03 09:23:58,439 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 83 [2025-03-03 09:23:58,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:58,439 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2025-03-03 09:23:58,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2025-03-03 09:23:58,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 09:23:58,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:58,439 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:58,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-03 09:23:58,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:58,640 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:58,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:58,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1737262669, now seen corresponding path program 19 times [2025-03-03 09:23:58,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:58,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791754983] [2025-03-03 09:23:58,640 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:23:58,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:58,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 09:23:58,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 09:23:58,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:23:58,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-03 09:23:58,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:58,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791754983] [2025-03-03 09:23:58,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791754983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:58,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907559458] [2025-03-03 09:23:58,814 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:23:58,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:58,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:58,816 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:23:58,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 09:23:58,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 09:23:58,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 09:23:58,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:23:58,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:58,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:23:58,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-03 09:23:58,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-03 09:23:59,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907559458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:59,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:59,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2025-03-03 09:23:59,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077736835] [2025-03-03 09:23:59,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:59,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 09:23:59,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:59,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 09:23:59,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:23:59,077 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:59,237 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2025-03-03 09:23:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 09:23:59,238 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 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 84 [2025-03-03 09:23:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:59,239 INFO L225 Difference]: With dead ends: 153 [2025-03-03 09:23:59,239 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 09:23:59,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 145 SyntacticMatches, 14 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2025-03-03 09:23:59,239 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:59,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 23 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:23:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 09:23:59,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-03 09:23:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.118279569892473) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2025-03-03 09:23:59,266 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 84 [2025-03-03 09:23:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:59,266 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2025-03-03 09:23:59,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:23:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2025-03-03 09:23:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 09:23:59,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:59,267 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:59,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-03 09:23:59,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:59,467 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:59,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash 582347186, now seen corresponding path program 20 times [2025-03-03 09:23:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:59,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50080058] [2025-03-03 09:23:59,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:23:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:59,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-03 09:23:59,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 09:23:59,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:23:59,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:24:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:24:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:24:07,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50080058] [2025-03-03 09:24:07,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50080058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:24:07,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139794284] [2025-03-03 09:24:07,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:24:07,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:24:07,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:24:07,868 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:24:07,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 09:24:07,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-03 09:24:07,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 09:24:07,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:24:07,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:24:07,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 303 conjuncts are in the unsatisfiable core [2025-03-03 09:24:07,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:24:08,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:24:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:24:08,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:24:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 09:24:09,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139794284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:24:09,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:24:09,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 27, 19] total 85 [2025-03-03 09:24:09,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555512729] [2025-03-03 09:24:09,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:24:09,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2025-03-03 09:24:09,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:24:09,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2025-03-03 09:24:09,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=6473, Unknown=0, NotChecked=0, Total=7140 [2025-03-03 09:24:09,342 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 85 states, 85 states have (on average 2.6941176470588237) internal successors, (229), 85 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:24:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:24:12,270 INFO L93 Difference]: Finished difference Result 212 states and 259 transitions. [2025-03-03 09:24:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 09:24:12,270 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 2.6941176470588237) internal successors, (229), 85 states have internal predecessors, (229), 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 93 [2025-03-03 09:24:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:24:12,272 INFO L225 Difference]: With dead ends: 212 [2025-03-03 09:24:12,272 INFO L226 Difference]: Without dead ends: 209 [2025-03-03 09:24:12,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1246, Invalid=11186, Unknown=0, NotChecked=0, Total=12432 [2025-03-03 09:24:12,274 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 4626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:24:12,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 129 Invalid, 4626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 4085 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 09:24:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-03 09:24:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 193. [2025-03-03 09:24:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.2395833333333333) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:24:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 238 transitions. [2025-03-03 09:24:12,336 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 238 transitions. Word has length 93 [2025-03-03 09:24:12,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:24:12,336 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 238 transitions. [2025-03-03 09:24:12,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 2.6941176470588237) internal successors, (229), 85 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:24:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2025-03-03 09:24:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 09:24:12,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:24:12,337 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:24:12,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-03 09:24:12,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 09:24:12,538 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:24:12,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:24:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash 872925331, now seen corresponding path program 21 times [2025-03-03 09:24:12,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:24:12,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705459629] [2025-03-03 09:24:12,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:24:12,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:24:12,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 94 statements into 5 equivalence classes. [2025-03-03 09:24:12,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 09:24:12,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:24:12,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:24:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-03 09:24:12,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:24:12,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705459629] [2025-03-03 09:24:12,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705459629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:24:12,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307195737] [2025-03-03 09:24:12,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:24:12,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:24:12,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:24:12,795 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:24:12,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 09:24:12,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 94 statements into 5 equivalence classes. [2025-03-03 09:24:12,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 09:24:12,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:24:12,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:24:12,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:24:12,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:24:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-03 09:24:13,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:24:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-03 09:24:13,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307195737] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:24:13,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:24:13,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 29 [2025-03-03 09:24:13,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680994536] [2025-03-03 09:24:13,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:24:13,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 09:24:13,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:24:13,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 09:24:13,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2025-03-03 09:24:13,246 INFO L87 Difference]: Start difference. First operand 193 states and 238 transitions. Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:24:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:24:13,532 INFO L93 Difference]: Finished difference Result 427 states and 518 transitions. [2025-03-03 09:24:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:24:13,533 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 09:24:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:24:13,534 INFO L225 Difference]: With dead ends: 427 [2025-03-03 09:24:13,534 INFO L226 Difference]: Without dead ends: 181 [2025-03-03 09:24:13,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 163 SyntacticMatches, 15 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2025-03-03 09:24:13,535 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:24:13,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:24:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-03 09:24:13,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-03 09:24:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.2222222222222223) internal successors, (220), 180 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:24:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 220 transitions. [2025-03-03 09:24:13,599 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 220 transitions. Word has length 94 [2025-03-03 09:24:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:24:13,599 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 220 transitions. [2025-03-03 09:24:13,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:24:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 220 transitions. [2025-03-03 09:24:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 09:24:13,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:24:13,600 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:24:13,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-03 09:24:13,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 09:24:13,800 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:24:13,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:24:13,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2095833966, now seen corresponding path program 22 times [2025-03-03 09:24:13,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:24:13,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029448836] [2025-03-03 09:24:13,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:24:13,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:24:13,808 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-03-03 09:24:13,816 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 84 of 95 statements. [2025-03-03 09:24:13,816 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:24:13,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:24:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 09:24:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:24:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029448836] [2025-03-03 09:24:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029448836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:24:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325038043] [2025-03-03 09:24:13,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:24:13,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:24:13,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:24:13,976 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:24:13,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 09:24:14,031 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-03-03 09:24:14,060 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 84 of 95 statements. [2025-03-03 09:24:14,060 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:24:14,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:24:14,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:24:14,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:24:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 09:24:14,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:24:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 09:24:14,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325038043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:24:14,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:24:14,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 27 [2025-03-03 09:24:14,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852378905] [2025-03-03 09:24:14,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:24:14,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 09:24:14,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:24:14,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 09:24:14,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2025-03-03 09:24:14,319 INFO L87 Difference]: Start difference. First operand 181 states and 220 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:24:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:24:14,708 INFO L93 Difference]: Finished difference Result 381 states and 450 transitions. [2025-03-03 09:24:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:24:14,708 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 09:24:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:24:14,709 INFO L225 Difference]: With dead ends: 381 [2025-03-03 09:24:14,709 INFO L226 Difference]: Without dead ends: 172 [2025-03-03 09:24:14,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 166 SyntacticMatches, 16 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=879, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:24:14,710 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:24:14,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 37 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:24:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-03 09:24:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2025-03-03 09:24:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.1137724550898203) internal successors, (186), 167 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:24:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2025-03-03 09:24:14,761 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 95 [2025-03-03 09:24:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:24:14,761 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2025-03-03 09:24:14,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:24:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2025-03-03 09:24:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 09:24:14,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:24:14,762 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:24:14,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-03 09:24:14,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:24:14,962 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:24:14,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:24:14,963 INFO L85 PathProgramCache]: Analyzing trace with hash -126831182, now seen corresponding path program 23 times [2025-03-03 09:24:14,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:24:14,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913850246] [2025-03-03 09:24:14,963 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:24:14,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:24:14,970 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 95 statements into 5 equivalence classes. [2025-03-03 09:24:14,993 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 09:24:14,993 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:24:14,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:24:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 09:24:15,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:24:15,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913850246] [2025-03-03 09:24:15,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913850246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:24:15,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639012775] [2025-03-03 09:24:15,173 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:24:15,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:24:15,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:24:15,176 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:24:15,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 09:24:15,233 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 95 statements into 5 equivalence classes. [2025-03-03 09:24:15,965 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 09:24:15,965 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:24:15,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:24:15,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:24:15,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:24:16,060 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 09:24:16,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:24:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 09:24:16,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639012775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:24:16,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:24:16,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 27 [2025-03-03 09:24:16,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859133136] [2025-03-03 09:24:16,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:24:16,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 09:24:16,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:24:16,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 09:24:16,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2025-03-03 09:24:16,156 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:24:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:24:16,377 INFO L93 Difference]: Finished difference Result 172 states and 190 transitions. [2025-03-03 09:24:16,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 09:24:16,378 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 09:24:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:24:16,379 INFO L225 Difference]: With dead ends: 172 [2025-03-03 09:24:16,379 INFO L226 Difference]: Without dead ends: 105 [2025-03-03 09:24:16,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 165 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:24:16,380 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:24:16,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 17 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:24:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-03 09:24:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-03 09:24:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.1057692307692308) internal successors, (115), 104 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:24:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2025-03-03 09:24:16,412 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 95 [2025-03-03 09:24:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:24:16,412 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2025-03-03 09:24:16,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:24:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2025-03-03 09:24:16,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 09:24:16,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:24:16,412 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:24:16,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-03 09:24:16,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:24:16,613 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:24:16,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:24:16,613 INFO L85 PathProgramCache]: Analyzing trace with hash 470817939, now seen corresponding path program 24 times [2025-03-03 09:24:16,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:24:16,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833908015] [2025-03-03 09:24:16,613 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:24:16,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:24:16,627 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 5 equivalence classes. [2025-03-03 09:24:16,769 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 09:24:16,769 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:24:16,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:24:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 09:24:26,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:24:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833908015] [2025-03-03 09:24:26,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833908015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:24:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833579558] [2025-03-03 09:24:26,441 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:24:26,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:24:26,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:24:26,443 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:24:26,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-03 09:24:26,516 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 5 equivalence classes. [2025-03-03 09:24:26,711 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 09:24:26,711 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:24:26,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:24:26,719 WARN L254 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 361 conjuncts are in the unsatisfiable core [2025-03-03 09:24:26,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:24:26,947 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 19 treesize of output 1 [2025-03-03 09:24:31,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:24:31,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:24:31,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 86 treesize of output 185 [2025-03-03 09:24:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 2 proven. 393 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:24:32,162 INFO L312 TraceCheckSpWp]: Computing backward predicates...