./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label28.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/eca-rers2012/Problem11_label28.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 8ff48638f08507efa79a38e2e8775c5b4b14feea4f002913b53cd095f4b7874d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:32:39,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:32:39,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:32:39,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:32:39,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:32:39,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:32:39,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:32:39,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:32:39,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:32:39,474 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:32:39,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:32:39,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:32:39,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:32:39,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:32:39,475 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:32:39,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:32:39,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:32:39,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:32:39,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:32:39,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:32:39,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:32:39,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:32:39,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:32:39,477 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:32:39,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:32:39,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:32:39,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:32:39,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:32:39,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:32:39,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:32:39,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:32:39,477 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 -> 8ff48638f08507efa79a38e2e8775c5b4b14feea4f002913b53cd095f4b7874d [2025-03-03 10:32:39,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:32:39,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:32:39,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:32:39,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:32:39,718 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:32:39,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label28.c [2025-03-03 10:32:40,826 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97cbcda8/da0c3359f66f4e03919794fb2a738571/FLAG1790e62fc [2025-03-03 10:32:41,135 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:32:41,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label28.c [2025-03-03 10:32:41,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97cbcda8/da0c3359f66f4e03919794fb2a738571/FLAG1790e62fc [2025-03-03 10:32:41,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97cbcda8/da0c3359f66f4e03919794fb2a738571 [2025-03-03 10:32:41,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:32:41,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:32:41,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:32:41,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:32:41,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:32:41,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b8e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41, skipping insertion in model container [2025-03-03 10:32:41,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:32:41,370 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/eca-rers2012/Problem11_label28.c[6999,7012] [2025-03-03 10:32:41,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:32:41,572 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:32:41,595 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/eca-rers2012/Problem11_label28.c[6999,7012] [2025-03-03 10:32:41,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:32:41,686 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:32:41,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41 WrapperNode [2025-03-03 10:32:41,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:32:41,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:32:41,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:32:41,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:32:41,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,774 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-03 10:32:41,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:32:41,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:32:41,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:32:41,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:32:41,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,842 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:32:41,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:32:41,914 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:32:41,914 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:32:41,914 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:32:41,915 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (1/1) ... [2025-03-03 10:32:41,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:32:41,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:41,970 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 10:32:41,975 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 10:32:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:32:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:32:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:32:41,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:32:42,031 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:32:42,032 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:32:43,210 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-03 10:32:43,210 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:32:43,223 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:32:43,224 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:32:43,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:32:43 BoogieIcfgContainer [2025-03-03 10:32:43,225 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:32:43,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:32:43,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:32:43,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:32:43,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:32:41" (1/3) ... [2025-03-03 10:32:43,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2546647f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:32:43, skipping insertion in model container [2025-03-03 10:32:43,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:41" (2/3) ... [2025-03-03 10:32:43,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2546647f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:32:43, skipping insertion in model container [2025-03-03 10:32:43,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:32:43" (3/3) ... [2025-03-03 10:32:43,232 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label28.c [2025-03-03 10:32:43,243 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:32:43,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label28.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:32:43,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:32:43,294 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;@2c9a8186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:32:43,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:32:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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 10:32:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 10:32:43,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:43,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:43,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:43,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1575436991, now seen corresponding path program 1 times [2025-03-03 10:32:43,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:43,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276060701] [2025-03-03 10:32:43,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:43,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:43,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 10:32:43,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 10:32:43,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:43,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:43,603 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 10:32:43,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:43,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276060701] [2025-03-03 10:32:43,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276060701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:43,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:43,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:43,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977706539] [2025-03-03 10:32:43,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:43,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:43,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:43,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:43,628 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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 10:32:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:44,498 INFO L93 Difference]: Finished difference Result 769 states and 1357 transitions. [2025-03-03 10:32:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:44,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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 10:32:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:44,510 INFO L225 Difference]: With dead ends: 769 [2025-03-03 10:32:44,510 INFO L226 Difference]: Without dead ends: 422 [2025-03-03 10:32:44,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:32:44,517 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 192 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:44,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 164 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:32:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-03 10:32:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2025-03-03 10:32:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 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 10:32:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2025-03-03 10:32:44,571 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 48 [2025-03-03 10:32:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:44,571 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2025-03-03 10:32:44,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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 10:32:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2025-03-03 10:32:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 10:32:44,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:44,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:44,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:32:44,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:44,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1991775399, now seen corresponding path program 1 times [2025-03-03 10:32:44,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:44,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118865264] [2025-03-03 10:32:44,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:44,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:44,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 10:32:44,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 10:32:44,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:44,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:44,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:44,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118865264] [2025-03-03 10:32:44,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118865264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:44,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:44,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:44,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892493152] [2025-03-03 10:32:44,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:44,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:44,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:44,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:44,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:44,814 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 10:32:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:45,427 INFO L93 Difference]: Finished difference Result 1199 states and 1829 transitions. [2025-03-03 10:32:45,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:45,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 114 [2025-03-03 10:32:45,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:45,431 INFO L225 Difference]: With dead ends: 1199 [2025-03-03 10:32:45,431 INFO L226 Difference]: Without dead ends: 789 [2025-03-03 10:32:45,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:32:45,432 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:45,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 176 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-03 10:32:45,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-03-03 10:32:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 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 10:32:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-03-03 10:32:45,452 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 114 [2025-03-03 10:32:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:45,453 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-03-03 10:32:45,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 10:32:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-03-03 10:32:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 10:32:45,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:45,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:45,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:32:45,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:45,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:45,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1206122289, now seen corresponding path program 1 times [2025-03-03 10:32:45,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:45,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665172611] [2025-03-03 10:32:45,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:45,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:45,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 10:32:45,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 10:32:45,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:45,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:45,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:45,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665172611] [2025-03-03 10:32:45,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665172611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:45,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:45,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:45,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142428746] [2025-03-03 10:32:45,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:45,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:45,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:45,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:45,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:45,741 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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 10:32:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:46,376 INFO L93 Difference]: Finished difference Result 2314 states and 3181 transitions. [2025-03-03 10:32:46,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:46,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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 118 [2025-03-03 10:32:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:46,381 INFO L225 Difference]: With dead ends: 2314 [2025-03-03 10:32:46,381 INFO L226 Difference]: Without dead ends: 1527 [2025-03-03 10:32:46,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:32:46,383 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:46,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-03-03 10:32:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2025-03-03 10:32:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.217049180327869) internal successors, (1856), 1525 states have internal predecessors, (1856), 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 10:32:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1856 transitions. [2025-03-03 10:32:46,408 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1856 transitions. Word has length 118 [2025-03-03 10:32:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:46,409 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1856 transitions. [2025-03-03 10:32:46,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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 10:32:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1856 transitions. [2025-03-03 10:32:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 10:32:46,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:46,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:46,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:32:46,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:46,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:46,419 INFO L85 PathProgramCache]: Analyzing trace with hash -438791678, now seen corresponding path program 1 times [2025-03-03 10:32:46,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:46,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253588822] [2025-03-03 10:32:46,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:46,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:46,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 10:32:46,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 10:32:46,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:46,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:46,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:46,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253588822] [2025-03-03 10:32:46,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253588822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:46,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:46,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:46,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772159900] [2025-03-03 10:32:46,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:46,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:46,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:46,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:46,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:46,628 INFO L87 Difference]: Start difference. First operand 1526 states and 1856 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 10:32:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:47,224 INFO L93 Difference]: Finished difference Result 3614 states and 4469 transitions. [2025-03-03 10:32:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:47,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 175 [2025-03-03 10:32:47,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:47,230 INFO L225 Difference]: With dead ends: 3614 [2025-03-03 10:32:47,231 INFO L226 Difference]: Without dead ends: 2274 [2025-03-03 10:32:47,232 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 10:32:47,233 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 157 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:47,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 336 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2025-03-03 10:32:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1897. [2025-03-03 10:32:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1896 states have (on average 1.215717299578059) internal successors, (2305), 1896 states have internal predecessors, (2305), 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 10:32:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2305 transitions. [2025-03-03 10:32:47,260 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2305 transitions. Word has length 175 [2025-03-03 10:32:47,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:47,261 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 2305 transitions. [2025-03-03 10:32:47,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 10:32:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2305 transitions. [2025-03-03 10:32:47,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 10:32:47,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:47,264 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1] [2025-03-03 10:32:47,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:32:47,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:47,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1901744084, now seen corresponding path program 1 times [2025-03-03 10:32:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:47,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923898672] [2025-03-03 10:32:47,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:47,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 10:32:47,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 10:32:47,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:47,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 10:32:47,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:47,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923898672] [2025-03-03 10:32:47,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923898672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:47,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:47,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:47,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31651111] [2025-03-03 10:32:47,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:47,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:47,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:47,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:47,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:47,430 INFO L87 Difference]: Start difference. First operand 1897 states and 2305 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 10:32:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:48,043 INFO L93 Difference]: Finished difference Result 4351 states and 5354 transitions. [2025-03-03 10:32:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:48,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 230 [2025-03-03 10:32:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:48,050 INFO L225 Difference]: With dead ends: 4351 [2025-03-03 10:32:48,050 INFO L226 Difference]: Without dead ends: 2456 [2025-03-03 10:32:48,052 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 10:32:48,054 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 149 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:48,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 387 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:48,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2025-03-03 10:32:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2265. [2025-03-03 10:32:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2264 states have (on average 1.2151060070671378) internal successors, (2751), 2264 states have internal predecessors, (2751), 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 10:32:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 2751 transitions. [2025-03-03 10:32:48,085 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 2751 transitions. Word has length 230 [2025-03-03 10:32:48,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:48,086 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 2751 transitions. [2025-03-03 10:32:48,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 10:32:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 2751 transitions. [2025-03-03 10:32:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-03 10:32:48,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:48,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-03-03 10:32:48,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:32:48,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:48,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash 724264263, now seen corresponding path program 1 times [2025-03-03 10:32:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177979946] [2025-03-03 10:32:48,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:48,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:48,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-03 10:32:48,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-03 10:32:48,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:48,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:48,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:48,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177979946] [2025-03-03 10:32:48,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177979946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:48,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:48,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:48,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219209269] [2025-03-03 10:32:48,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:48,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:48,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:48,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:48,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:48,325 INFO L87 Difference]: Start difference. First operand 2265 states and 2751 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 10:32:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:48,957 INFO L93 Difference]: Finished difference Result 6017 states and 7428 transitions. [2025-03-03 10:32:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:48,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 257 [2025-03-03 10:32:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:48,968 INFO L225 Difference]: With dead ends: 6017 [2025-03-03 10:32:48,968 INFO L226 Difference]: Without dead ends: 3754 [2025-03-03 10:32:48,970 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 10:32:48,971 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 118 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:48,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 181 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2025-03-03 10:32:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3750. [2025-03-03 10:32:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3750 states, 3749 states have (on average 1.2115230728194184) internal successors, (4542), 3749 states have internal predecessors, (4542), 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 10:32:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3750 states to 3750 states and 4542 transitions. [2025-03-03 10:32:49,019 INFO L78 Accepts]: Start accepts. Automaton has 3750 states and 4542 transitions. Word has length 257 [2025-03-03 10:32:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:49,019 INFO L471 AbstractCegarLoop]: Abstraction has 3750 states and 4542 transitions. [2025-03-03 10:32:49,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 10:32:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3750 states and 4542 transitions. [2025-03-03 10:32:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-03 10:32:49,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:49,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1] [2025-03-03 10:32:49,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:32:49,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:49,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:49,025 INFO L85 PathProgramCache]: Analyzing trace with hash 337302748, now seen corresponding path program 1 times [2025-03-03 10:32:49,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:49,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882899419] [2025-03-03 10:32:49,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:49,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:49,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 10:32:49,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 10:32:49,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:49,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:49,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882899419] [2025-03-03 10:32:49,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882899419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:49,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:49,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421148997] [2025-03-03 10:32:49,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:49,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:49,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:49,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:49,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:49,346 INFO L87 Difference]: Start difference. First operand 3750 states and 4542 transitions. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 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 10:32:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:50,376 INFO L93 Difference]: Finished difference Result 10642 states and 13073 transitions. [2025-03-03 10:32:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:50,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 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 267 [2025-03-03 10:32:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:50,395 INFO L225 Difference]: With dead ends: 10642 [2025-03-03 10:32:50,396 INFO L226 Difference]: Without dead ends: 6894 [2025-03-03 10:32:50,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:50,401 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 230 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:50,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 70 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:32:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6894 states. [2025-03-03 10:32:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6894 to 6886. [2025-03-03 10:32:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6886 states, 6885 states have (on average 1.2178649237472767) internal successors, (8385), 6885 states have internal predecessors, (8385), 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 10:32:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6886 states to 6886 states and 8385 transitions. [2025-03-03 10:32:50,514 INFO L78 Accepts]: Start accepts. Automaton has 6886 states and 8385 transitions. Word has length 267 [2025-03-03 10:32:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:50,514 INFO L471 AbstractCegarLoop]: Abstraction has 6886 states and 8385 transitions. [2025-03-03 10:32:50,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 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 10:32:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 6886 states and 8385 transitions. [2025-03-03 10:32:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-03 10:32:50,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:50,518 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:50,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:32:50,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:50,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:50,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1014583680, now seen corresponding path program 1 times [2025-03-03 10:32:50,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:50,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015999070] [2025-03-03 10:32:50,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:50,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:50,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 10:32:50,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 10:32:50,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:50,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:50,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:50,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015999070] [2025-03-03 10:32:50,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015999070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:50,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:50,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:32:50,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109850087] [2025-03-03 10:32:50,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:50,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:32:50,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:50,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:32:50,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:32:50,968 INFO L87 Difference]: Start difference. First operand 6886 states and 8385 transitions. Second operand has 5 states, 5 states have (on average 53.4) internal successors, (267), 4 states have internal predecessors, (267), 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 10:32:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:52,385 INFO L93 Difference]: Finished difference Result 15808 states and 19541 transitions. [2025-03-03 10:32:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:32:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.4) internal successors, (267), 4 states have internal predecessors, (267), 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 267 [2025-03-03 10:32:52,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:52,416 INFO L225 Difference]: With dead ends: 15808 [2025-03-03 10:32:52,416 INFO L226 Difference]: Without dead ends: 9292 [2025-03-03 10:32:52,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:32:52,422 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 384 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:52,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 83 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:32:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9292 states. [2025-03-03 10:32:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9292 to 8358. [2025-03-03 10:32:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8358 states, 8357 states have (on average 1.2046188823740578) internal successors, (10067), 8357 states have internal predecessors, (10067), 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 10:32:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8358 states to 8358 states and 10067 transitions. [2025-03-03 10:32:52,536 INFO L78 Accepts]: Start accepts. Automaton has 8358 states and 10067 transitions. Word has length 267 [2025-03-03 10:32:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:52,537 INFO L471 AbstractCegarLoop]: Abstraction has 8358 states and 10067 transitions. [2025-03-03 10:32:52,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.4) internal successors, (267), 4 states have internal predecessors, (267), 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 10:32:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 8358 states and 10067 transitions. [2025-03-03 10:32:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-03 10:32:52,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:52,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:52,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:32:52,542 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:52,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:52,543 INFO L85 PathProgramCache]: Analyzing trace with hash 476112914, now seen corresponding path program 1 times [2025-03-03 10:32:52,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:52,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917112363] [2025-03-03 10:32:52,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:52,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:52,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 10:32:52,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 10:32:52,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:52,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 10:32:52,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917112363] [2025-03-03 10:32:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917112363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:52,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:52,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:52,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302789891] [2025-03-03 10:32:52,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:52,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:52,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:52,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:52,656 INFO L87 Difference]: Start difference. First operand 8358 states and 10067 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 10:32:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:53,291 INFO L93 Difference]: Finished difference Result 19472 states and 23738 transitions. [2025-03-03 10:32:53,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:53,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 278 [2025-03-03 10:32:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:53,309 INFO L225 Difference]: With dead ends: 19472 [2025-03-03 10:32:53,309 INFO L226 Difference]: Without dead ends: 11484 [2025-03-03 10:32:53,315 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 10:32:53,316 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 174 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:53,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 348 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11484 states. [2025-03-03 10:32:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11484 to 11300. [2025-03-03 10:32:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11300 states, 11299 states have (on average 1.1962120541640853) internal successors, (13516), 11299 states have internal predecessors, (13516), 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 10:32:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11300 states to 11300 states and 13516 transitions. [2025-03-03 10:32:53,432 INFO L78 Accepts]: Start accepts. Automaton has 11300 states and 13516 transitions. Word has length 278 [2025-03-03 10:32:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:53,432 INFO L471 AbstractCegarLoop]: Abstraction has 11300 states and 13516 transitions. [2025-03-03 10:32:53,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 10:32:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 11300 states and 13516 transitions. [2025-03-03 10:32:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-03 10:32:53,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:53,437 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:53,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:32:53,437 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:53,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:53,438 INFO L85 PathProgramCache]: Analyzing trace with hash -817471563, now seen corresponding path program 1 times [2025-03-03 10:32:53,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:53,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424694024] [2025-03-03 10:32:53,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:53,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:53,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-03 10:32:53,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-03 10:32:53,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:53,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:53,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:53,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424694024] [2025-03-03 10:32:53,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424694024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:53,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025876873] [2025-03-03 10:32:53,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:53,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:53,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:53,665 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 10:32:53,666 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 10:32:53,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-03 10:32:53,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-03 10:32:53,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:53,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:53,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:32:53,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:54,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025876873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:54,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:54,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:32:54,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459769860] [2025-03-03 10:32:54,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:54,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:54,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:54,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:54,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:32:54,101 INFO L87 Difference]: Start difference. First operand 11300 states and 13516 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 10:32:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:54,680 INFO L93 Difference]: Finished difference Result 23538 states and 28257 transitions. [2025-03-03 10:32:54,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:54,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 281 [2025-03-03 10:32:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:54,697 INFO L225 Difference]: With dead ends: 23538 [2025-03-03 10:32:54,697 INFO L226 Difference]: Without dead ends: 12608 [2025-03-03 10:32:54,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:32:54,707 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 99 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:54,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 354 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:54,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12608 states. [2025-03-03 10:32:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12608 to 12599. [2025-03-03 10:32:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12599 states, 12598 states have (on average 1.192570249245912) internal successors, (15024), 12598 states have internal predecessors, (15024), 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 10:32:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12599 states to 12599 states and 15024 transitions. [2025-03-03 10:32:54,873 INFO L78 Accepts]: Start accepts. Automaton has 12599 states and 15024 transitions. Word has length 281 [2025-03-03 10:32:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:54,873 INFO L471 AbstractCegarLoop]: Abstraction has 12599 states and 15024 transitions. [2025-03-03 10:32:54,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 10:32:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 12599 states and 15024 transitions. [2025-03-03 10:32:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-03 10:32:54,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:54,880 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:54,887 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 10:32:55,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 10:32:55,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:55,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:55,082 INFO L85 PathProgramCache]: Analyzing trace with hash -96402539, now seen corresponding path program 1 times [2025-03-03 10:32:55,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:55,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715748177] [2025-03-03 10:32:55,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:55,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:55,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-03 10:32:55,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-03 10:32:55,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:55,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:32:55,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:55,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715748177] [2025-03-03 10:32:55,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715748177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:55,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:55,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:55,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134803773] [2025-03-03 10:32:55,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:55,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:55,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:55,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:55,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:55,288 INFO L87 Difference]: Start difference. First operand 12599 states and 15024 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 10:32:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:55,844 INFO L93 Difference]: Finished difference Result 27404 states and 32946 transitions. [2025-03-03 10:32:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:55,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 284 [2025-03-03 10:32:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:55,866 INFO L225 Difference]: With dead ends: 27404 [2025-03-03 10:32:55,866 INFO L226 Difference]: Without dead ends: 15175 [2025-03-03 10:32:55,877 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 10:32:55,877 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 173 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:55,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 155 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:55,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15175 states. [2025-03-03 10:32:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15175 to 14807. [2025-03-03 10:32:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14807 states, 14806 states have (on average 1.1718222342293665) internal successors, (17350), 14806 states have internal predecessors, (17350), 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 10:32:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14807 states to 14807 states and 17350 transitions. [2025-03-03 10:32:56,055 INFO L78 Accepts]: Start accepts. Automaton has 14807 states and 17350 transitions. Word has length 284 [2025-03-03 10:32:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:56,055 INFO L471 AbstractCegarLoop]: Abstraction has 14807 states and 17350 transitions. [2025-03-03 10:32:56,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 10:32:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 14807 states and 17350 transitions. [2025-03-03 10:32:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-03 10:32:56,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:56,063 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-03-03 10:32:56,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:32:56,064 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:56,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1530950959, now seen corresponding path program 1 times [2025-03-03 10:32:56,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:56,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088581609] [2025-03-03 10:32:56,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:56,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:56,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-03 10:32:56,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-03 10:32:56,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:56,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:32:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088581609] [2025-03-03 10:32:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088581609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:56,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:56,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030634906] [2025-03-03 10:32:56,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:56,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:56,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:56,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:56,167 INFO L87 Difference]: Start difference. First operand 14807 states and 17350 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 10:32:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:56,745 INFO L93 Difference]: Finished difference Result 32187 states and 38001 transitions. [2025-03-03 10:32:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:56,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 310 [2025-03-03 10:32:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:56,771 INFO L225 Difference]: With dead ends: 32187 [2025-03-03 10:32:56,771 INFO L226 Difference]: Without dead ends: 17566 [2025-03-03 10:32:56,785 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 10:32:56,786 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 150 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:56,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 372 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17566 states. [2025-03-03 10:32:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17566 to 16646. [2025-03-03 10:32:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16646 states, 16645 states have (on average 1.164734154400721) internal successors, (19387), 16645 states have internal predecessors, (19387), 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 10:32:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16646 states to 16646 states and 19387 transitions. [2025-03-03 10:32:57,008 INFO L78 Accepts]: Start accepts. Automaton has 16646 states and 19387 transitions. Word has length 310 [2025-03-03 10:32:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:57,009 INFO L471 AbstractCegarLoop]: Abstraction has 16646 states and 19387 transitions. [2025-03-03 10:32:57,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 10:32:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 16646 states and 19387 transitions. [2025-03-03 10:32:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-03 10:32:57,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:57,018 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-03-03 10:32:57,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:32:57,019 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:57,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash -394374803, now seen corresponding path program 1 times [2025-03-03 10:32:57,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:57,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819813049] [2025-03-03 10:32:57,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:57,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-03 10:32:57,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-03 10:32:57,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:57,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 10:32:57,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:57,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819813049] [2025-03-03 10:32:57,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819813049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:57,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:57,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:57,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452735823] [2025-03-03 10:32:57,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:57,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:57,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:57,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:57,124 INFO L87 Difference]: Start difference. First operand 16646 states and 19387 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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 10:32:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:57,633 INFO L93 Difference]: Finished difference Result 33288 states and 38878 transitions. [2025-03-03 10:32:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:57,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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 331 [2025-03-03 10:32:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:57,656 INFO L225 Difference]: With dead ends: 33288 [2025-03-03 10:32:57,656 INFO L226 Difference]: Without dead ends: 17012 [2025-03-03 10:32:57,667 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 10:32:57,668 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 138 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:57,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 147 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17012 states. [2025-03-03 10:32:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17012 to 15538. [2025-03-03 10:32:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15538 states, 15537 states have (on average 1.1358048529317113) internal successors, (17647), 15537 states have internal predecessors, (17647), 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 10:32:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15538 states to 15538 states and 17647 transitions. [2025-03-03 10:32:57,878 INFO L78 Accepts]: Start accepts. Automaton has 15538 states and 17647 transitions. Word has length 331 [2025-03-03 10:32:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:57,879 INFO L471 AbstractCegarLoop]: Abstraction has 15538 states and 17647 transitions. [2025-03-03 10:32:57,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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 10:32:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 15538 states and 17647 transitions. [2025-03-03 10:32:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-03 10:32:57,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:57,885 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:57,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:32:57,886 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:57,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash 698341378, now seen corresponding path program 1 times [2025-03-03 10:32:57,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:57,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596236965] [2025-03-03 10:32:57,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:57,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-03 10:32:57,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-03 10:32:57,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:57,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 281 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:58,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:58,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596236965] [2025-03-03 10:32:58,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596236965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:58,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889604037] [2025-03-03 10:32:58,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:58,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:58,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:58,571 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 10:32:58,572 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 10:32:58,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-03 10:32:58,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-03 10:32:58,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:58,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:58,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:32:58,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 10:32:58,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:58,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889604037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:58,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:58,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:32:58,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689621964] [2025-03-03 10:32:58,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:58,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:58,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:58,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:58,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:32:58,967 INFO L87 Difference]: Start difference. First operand 15538 states and 17647 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 10:32:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:59,451 INFO L93 Difference]: Finished difference Result 33107 states and 37582 transitions. [2025-03-03 10:32:59,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:59,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 335 [2025-03-03 10:32:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:59,468 INFO L225 Difference]: With dead ends: 33107 [2025-03-03 10:32:59,468 INFO L226 Difference]: Without dead ends: 17755 [2025-03-03 10:32:59,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:32:59,479 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 84 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:59,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 364 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17755 states. [2025-03-03 10:32:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17755 to 16280. [2025-03-03 10:32:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16280 states, 16279 states have (on average 1.1320719945942626) internal successors, (18429), 16279 states have internal predecessors, (18429), 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 10:32:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16280 states to 16280 states and 18429 transitions. [2025-03-03 10:32:59,677 INFO L78 Accepts]: Start accepts. Automaton has 16280 states and 18429 transitions. Word has length 335 [2025-03-03 10:32:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:59,677 INFO L471 AbstractCegarLoop]: Abstraction has 16280 states and 18429 transitions. [2025-03-03 10:32:59,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 10:32:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 16280 states and 18429 transitions. [2025-03-03 10:32:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-03 10:32:59,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:59,684 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:59,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:32:59,885 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,SelfDestructingSolverStorable13 [2025-03-03 10:32:59,885 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:59,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1250846035, now seen corresponding path program 1 times [2025-03-03 10:32:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:59,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580446274] [2025-03-03 10:32:59,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:59,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-03 10:32:59,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-03 10:32:59,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:59,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 252 proven. 51 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-03 10:33:00,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:00,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580446274] [2025-03-03 10:33:00,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580446274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:00,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783129043] [2025-03-03 10:33:00,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:00,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:00,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:00,476 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 10:33:00,477 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 10:33:00,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-03 10:33:00,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-03 10:33:00,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:00,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:00,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:33:00,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-03 10:33:00,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:33:00,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783129043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:00,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:33:00,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:33:00,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393795369] [2025-03-03 10:33:00,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:00,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:00,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:00,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:00,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:33:00,783 INFO L87 Difference]: Start difference. First operand 16280 states and 18429 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 10:33:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:01,247 INFO L93 Difference]: Finished difference Result 33295 states and 37629 transitions. [2025-03-03 10:33:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:01,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 356 [2025-03-03 10:33:01,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:01,263 INFO L225 Difference]: With dead ends: 33295 [2025-03-03 10:33:01,263 INFO L226 Difference]: Without dead ends: 17017 [2025-03-03 10:33:01,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:33:01,273 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 91 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:01,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 167 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17017 states. [2025-03-03 10:33:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17017 to 14992. [2025-03-03 10:33:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14992 states, 14991 states have (on average 1.1282769661797079) internal successors, (16914), 14991 states have internal predecessors, (16914), 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 10:33:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14992 states to 14992 states and 16914 transitions. [2025-03-03 10:33:01,389 INFO L78 Accepts]: Start accepts. Automaton has 14992 states and 16914 transitions. Word has length 356 [2025-03-03 10:33:01,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:01,389 INFO L471 AbstractCegarLoop]: Abstraction has 14992 states and 16914 transitions. [2025-03-03 10:33:01,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 10:33:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 14992 states and 16914 transitions. [2025-03-03 10:33:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-03 10:33:01,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:01,396 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:01,402 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 10:33:01,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:01,598 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:01,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:01,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1982918989, now seen corresponding path program 1 times [2025-03-03 10:33:01,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:01,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846436249] [2025-03-03 10:33:01,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:01,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:01,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-03 10:33:01,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-03 10:33:01,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:01,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 281 proven. 58 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 10:33:02,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846436249] [2025-03-03 10:33:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846436249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348007058] [2025-03-03 10:33:02,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:02,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:02,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:02,164 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 10:33:02,166 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 10:33:02,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-03 10:33:02,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-03 10:33:02,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:02,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:02,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 10:33:02,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 202 proven. 137 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 10:33:02,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:33:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 293 proven. 46 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 10:33:03,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348007058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:33:03,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:33:03,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-03-03 10:33:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454639630] [2025-03-03 10:33:03,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:33:03,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 10:33:03,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:03,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 10:33:03,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:33:03,085 INFO L87 Difference]: Start difference. First operand 14992 states and 16914 transitions. Second operand has 11 states, 11 states have (on average 75.63636363636364) internal successors, (832), 11 states have internal predecessors, (832), 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 10:33:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:06,975 INFO L93 Difference]: Finished difference Result 40110 states and 45273 transitions. [2025-03-03 10:33:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 10:33:06,976 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 75.63636363636364) internal successors, (832), 11 states have internal predecessors, (832), 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 373 [2025-03-03 10:33:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:07,000 INFO L225 Difference]: With dead ends: 40110 [2025-03-03 10:33:07,000 INFO L226 Difference]: Without dead ends: 24568 [2025-03-03 10:33:07,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-03-03 10:33:07,014 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 2659 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 6236 mSolverCounterSat, 768 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2659 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 7004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 768 IncrementalHoareTripleChecker+Valid, 6236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:07,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2659 Valid, 226 Invalid, 7004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [768 Valid, 6236 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-03 10:33:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24568 states. [2025-03-03 10:33:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24568 to 16267. [2025-03-03 10:33:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16267 states, 16266 states have (on average 1.1097381040206566) internal successors, (18051), 16266 states have internal predecessors, (18051), 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 10:33:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16267 states to 16267 states and 18051 transitions. [2025-03-03 10:33:07,182 INFO L78 Accepts]: Start accepts. Automaton has 16267 states and 18051 transitions. Word has length 373 [2025-03-03 10:33:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:07,183 INFO L471 AbstractCegarLoop]: Abstraction has 16267 states and 18051 transitions. [2025-03-03 10:33:07,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 75.63636363636364) internal successors, (832), 11 states have internal predecessors, (832), 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 10:33:07,183 INFO L276 IsEmpty]: Start isEmpty. Operand 16267 states and 18051 transitions. [2025-03-03 10:33:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-03 10:33:07,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:07,191 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-03-03 10:33:07,198 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 10:33:07,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 10:33:07,391 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:07,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:07,392 INFO L85 PathProgramCache]: Analyzing trace with hash -282364868, now seen corresponding path program 1 times [2025-03-03 10:33:07,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:07,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143251398] [2025-03-03 10:33:07,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:07,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:07,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-03 10:33:07,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-03 10:33:07,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:07,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 137 proven. 202 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-03 10:33:07,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:07,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143251398] [2025-03-03 10:33:07,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143251398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:07,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455138891] [2025-03-03 10:33:07,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:07,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:07,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:07,663 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 10:33:07,665 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 10:33:07,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-03 10:33:07,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-03 10:33:07,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:07,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:07,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:33:07,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 10:33:07,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:33:07,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455138891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:07,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:33:07,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:33:07,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149289714] [2025-03-03 10:33:07,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:07,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:33:07,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:07,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:33:07,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:33:07,969 INFO L87 Difference]: Start difference. First operand 16267 states and 18051 transitions. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 3 states have internal predecessors, (334), 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 10:33:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:08,744 INFO L93 Difference]: Finished difference Result 34012 states and 37780 transitions. [2025-03-03 10:33:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:33:08,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 3 states have internal predecessors, (334), 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 379 [2025-03-03 10:33:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:08,759 INFO L225 Difference]: With dead ends: 34012 [2025-03-03 10:33:08,759 INFO L226 Difference]: Without dead ends: 18115 [2025-03-03 10:33:08,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:33:08,768 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 200 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:08,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 136 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:33:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18115 states. [2025-03-03 10:33:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18115 to 16453. [2025-03-03 10:33:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 16452 states have (on average 1.1094091903719911) internal successors, (18252), 16452 states have internal predecessors, (18252), 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 10:33:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 18252 transitions. [2025-03-03 10:33:08,892 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 18252 transitions. Word has length 379 [2025-03-03 10:33:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:08,892 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 18252 transitions. [2025-03-03 10:33:08,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 3 states have internal predecessors, (334), 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 10:33:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 18252 transitions. [2025-03-03 10:33:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-03 10:33:08,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:08,900 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-03-03 10:33:08,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:33:09,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 10:33:09,100 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:09,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1689619307, now seen corresponding path program 1 times [2025-03-03 10:33:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399651131] [2025-03-03 10:33:09,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:09,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-03 10:33:09,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-03 10:33:09,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:09,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 137 proven. 229 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:33:09,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:09,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399651131] [2025-03-03 10:33:09,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399651131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:09,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733536560] [2025-03-03 10:33:09,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:09,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:09,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:09,346 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 10:33:09,347 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 10:33:09,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-03 10:33:09,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-03 10:33:09,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:09,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:09,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 10:33:09,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 242 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:10,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:33:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 242 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:12,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733536560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:33:12,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:33:12,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2025-03-03 10:33:12,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482221739] [2025-03-03 10:33:12,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:33:12,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 10:33:12,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:12,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 10:33:12,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-03 10:33:12,216 INFO L87 Difference]: Start difference. First operand 16453 states and 18252 transitions. Second operand has 12 states, 12 states have (on average 80.5) internal successors, (966), 11 states have internal predecessors, (966), 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 10:33:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:16,734 INFO L93 Difference]: Finished difference Result 49162 states and 54232 transitions. [2025-03-03 10:33:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 10:33:16,734 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 80.5) internal successors, (966), 11 states have internal predecessors, (966), 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 415 [2025-03-03 10:33:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:16,761 INFO L225 Difference]: With dead ends: 49162 [2025-03-03 10:33:16,761 INFO L226 Difference]: Without dead ends: 32895 [2025-03-03 10:33:16,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 822 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 10:33:16,771 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 3707 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6592 mSolverCounterSat, 986 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3707 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 986 IncrementalHoareTripleChecker+Valid, 6592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:16,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3707 Valid, 178 Invalid, 7578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [986 Valid, 6592 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 10:33:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32895 states. [2025-03-03 10:33:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32895 to 19581. [2025-03-03 10:33:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19581 states, 19580 states have (on average 1.0849336057201227) internal successors, (21243), 19580 states have internal predecessors, (21243), 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 10:33:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19581 states to 19581 states and 21243 transitions. [2025-03-03 10:33:16,960 INFO L78 Accepts]: Start accepts. Automaton has 19581 states and 21243 transitions. Word has length 415 [2025-03-03 10:33:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:16,961 INFO L471 AbstractCegarLoop]: Abstraction has 19581 states and 21243 transitions. [2025-03-03 10:33:16,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 80.5) internal successors, (966), 11 states have internal predecessors, (966), 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 10:33:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 19581 states and 21243 transitions. [2025-03-03 10:33:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-03 10:33:16,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:16,968 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:16,974 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 10:33:17,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 10:33:17,168 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:17,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:17,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1794785296, now seen corresponding path program 1 times [2025-03-03 10:33:17,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:17,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204104857] [2025-03-03 10:33:17,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:17,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:17,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-03 10:33:17,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-03 10:33:17,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:17,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 474 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:17,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:17,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204104857] [2025-03-03 10:33:17,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204104857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:17,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173503231] [2025-03-03 10:33:17,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:17,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:17,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:17,738 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 10:33:17,739 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 10:33:17,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-03 10:33:17,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-03 10:33:17,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:17,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:17,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 10:33:17,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-03 10:33:18,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:33:18,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173503231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:18,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:33:18,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:33:18,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393768917] [2025-03-03 10:33:18,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:18,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:18,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:18,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:18,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:33:18,146 INFO L87 Difference]: Start difference. First operand 19581 states and 21243 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 10:33:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:18,582 INFO L93 Difference]: Finished difference Result 37321 states and 40557 transitions. [2025-03-03 10:33:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:18,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 431 [2025-03-03 10:33:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:18,599 INFO L225 Difference]: With dead ends: 37321 [2025-03-03 10:33:18,599 INFO L226 Difference]: Without dead ends: 18110 [2025-03-03 10:33:18,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:33:18,610 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 44 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:18,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 350 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18110 states. [2025-03-03 10:33:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18110 to 18107. [2025-03-03 10:33:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18107 states, 18106 states have (on average 1.0838948414890093) internal successors, (19625), 18106 states have internal predecessors, (19625), 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 10:33:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18107 states to 18107 states and 19625 transitions. [2025-03-03 10:33:18,743 INFO L78 Accepts]: Start accepts. Automaton has 18107 states and 19625 transitions. Word has length 431 [2025-03-03 10:33:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:18,744 INFO L471 AbstractCegarLoop]: Abstraction has 18107 states and 19625 transitions. [2025-03-03 10:33:18,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 10:33:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 18107 states and 19625 transitions. [2025-03-03 10:33:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-03 10:33:18,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:18,756 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:18,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 10:33:18,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:18,956 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:18,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash 450812487, now seen corresponding path program 1 times [2025-03-03 10:33:18,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:18,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809134339] [2025-03-03 10:33:18,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:18,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:18,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-03 10:33:19,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-03 10:33:19,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:19,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 183 proven. 406 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-03 10:33:19,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:19,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809134339] [2025-03-03 10:33:19,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809134339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:19,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608567298] [2025-03-03 10:33:19,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:19,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:19,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:19,312 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 10:33:19,313 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 10:33:19,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-03 10:33:19,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-03 10:33:19,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:19,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:19,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:33:19,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 235 proven. 452 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-03 10:33:19,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:33:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 183 proven. 406 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-03 10:33:21,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608567298] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:33:21,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:33:21,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-03-03 10:33:21,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056894438] [2025-03-03 10:33:21,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:33:21,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 10:33:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:21,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 10:33:21,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:33:21,182 INFO L87 Difference]: Start difference. First operand 18107 states and 19625 transitions. Second operand has 10 states, 10 states have (on average 80.0) internal successors, (800), 9 states have internal predecessors, (800), 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 10:33:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:23,368 INFO L93 Difference]: Finished difference Result 56879 states and 61375 transitions. [2025-03-03 10:33:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 10:33:23,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 80.0) internal successors, (800), 9 states have internal predecessors, (800), 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 570 [2025-03-03 10:33:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:23,404 INFO L225 Difference]: With dead ends: 56879 [2025-03-03 10:33:23,404 INFO L226 Difference]: Without dead ends: 39142 [2025-03-03 10:33:23,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1142 GetRequests, 1134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:33:23,417 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1016 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 3396 mSolverCounterSat, 588 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 3984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 588 IncrementalHoareTripleChecker+Valid, 3396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:23,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 135 Invalid, 3984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [588 Valid, 3396 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:33:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39142 states. [2025-03-03 10:33:23,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39142 to 27885. [2025-03-03 10:33:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27885 states, 27884 states have (on average 1.080153493042605) internal successors, (30119), 27884 states have internal predecessors, (30119), 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 10:33:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27885 states to 27885 states and 30119 transitions. [2025-03-03 10:33:23,744 INFO L78 Accepts]: Start accepts. Automaton has 27885 states and 30119 transitions. Word has length 570 [2025-03-03 10:33:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:23,744 INFO L471 AbstractCegarLoop]: Abstraction has 27885 states and 30119 transitions. [2025-03-03 10:33:23,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.0) internal successors, (800), 9 states have internal predecessors, (800), 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 10:33:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 27885 states and 30119 transitions. [2025-03-03 10:33:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-03-03 10:33:23,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:23,757 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:23,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 10:33:23,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:23,958 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:23,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:23,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1134230833, now seen corresponding path program 1 times [2025-03-03 10:33:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374173832] [2025-03-03 10:33:23,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:23,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:23,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-03 10:33:24,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-03 10:33:24,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:24,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1165 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 10:33:24,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:24,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374173832] [2025-03-03 10:33:24,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374173832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:24,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:24,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:24,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929620327] [2025-03-03 10:33:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:24,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:33:24,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:24,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:33:24,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:24,366 INFO L87 Difference]: Start difference. First operand 27885 states and 30119 transitions. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 3 states have internal predecessors, (364), 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 10:33:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:25,147 INFO L93 Difference]: Finished difference Result 65923 states and 71169 transitions. [2025-03-03 10:33:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:33:25,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 3 states have internal predecessors, (364), 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 584 [2025-03-03 10:33:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:25,181 INFO L225 Difference]: With dead ends: 65923 [2025-03-03 10:33:25,181 INFO L226 Difference]: Without dead ends: 37484 [2025-03-03 10:33:25,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:25,199 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 223 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:25,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 56 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:33:25,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37484 states. [2025-03-03 10:33:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37484 to 32303. [2025-03-03 10:33:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32303 states, 32302 states have (on average 1.0768992632035168) internal successors, (34786), 32302 states have internal predecessors, (34786), 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 10:33:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32303 states to 32303 states and 34786 transitions. [2025-03-03 10:33:25,507 INFO L78 Accepts]: Start accepts. Automaton has 32303 states and 34786 transitions. Word has length 584 [2025-03-03 10:33:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:25,507 INFO L471 AbstractCegarLoop]: Abstraction has 32303 states and 34786 transitions. [2025-03-03 10:33:25,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 3 states have internal predecessors, (364), 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 10:33:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 32303 states and 34786 transitions. [2025-03-03 10:33:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2025-03-03 10:33:25,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:25,522 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-03-03 10:33:25,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:33:25,522 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:25,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:25,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1574008626, now seen corresponding path program 1 times [2025-03-03 10:33:25,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:25,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877104781] [2025-03-03 10:33:25,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:25,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:25,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-03-03 10:33:25,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-03-03 10:33:25,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:25,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 873 proven. 172 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2025-03-03 10:33:26,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877104781] [2025-03-03 10:33:26,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877104781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8325179] [2025-03-03 10:33:26,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:26,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:26,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:26,634 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 10:33:26,634 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 10:33:26,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-03-03 10:33:26,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-03-03 10:33:26,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:26,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:26,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:33:26,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 953 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-03 10:33:26,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:33:26,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8325179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:26,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:33:26,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:33:26,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290541773] [2025-03-03 10:33:26,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:26,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:26,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:26,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:26,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:33:26,868 INFO L87 Difference]: Start difference. First operand 32303 states and 34786 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 10:33:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:27,410 INFO L93 Difference]: Finished difference Result 62767 states and 67641 transitions. [2025-03-03 10:33:27,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:27,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 610 [2025-03-03 10:33:27,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:27,439 INFO L225 Difference]: With dead ends: 62767 [2025-03-03 10:33:27,439 INFO L226 Difference]: Without dead ends: 32308 [2025-03-03 10:33:27,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:33:27,456 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 67 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:27,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 327 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32308 states. [2025-03-03 10:33:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32308 to 32303. [2025-03-03 10:33:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32303 states, 32302 states have (on average 1.0742988050275524) internal successors, (34702), 32302 states have internal predecessors, (34702), 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 10:33:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32303 states to 32303 states and 34702 transitions. [2025-03-03 10:33:27,719 INFO L78 Accepts]: Start accepts. Automaton has 32303 states and 34702 transitions. Word has length 610 [2025-03-03 10:33:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:27,720 INFO L471 AbstractCegarLoop]: Abstraction has 32303 states and 34702 transitions. [2025-03-03 10:33:27,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 10:33:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 32303 states and 34702 transitions. [2025-03-03 10:33:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-03 10:33:27,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:27,735 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:27,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 10:33:27,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:27,936 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:27,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1339488706, now seen corresponding path program 1 times [2025-03-03 10:33:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:27,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556036069] [2025-03-03 10:33:27,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:27,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:27,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-03 10:33:27,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-03 10:33:27,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:27,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 844 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2025-03-03 10:33:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556036069] [2025-03-03 10:33:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556036069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:28,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212110040] [2025-03-03 10:33:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:28,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:28,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:28,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:28,269 INFO L87 Difference]: Start difference. First operand 32303 states and 34702 transitions. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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 10:33:28,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:28,818 INFO L93 Difference]: Finished difference Result 67187 states and 72160 transitions. [2025-03-03 10:33:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:28,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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 626 [2025-03-03 10:33:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:28,851 INFO L225 Difference]: With dead ends: 67187 [2025-03-03 10:33:28,851 INFO L226 Difference]: Without dead ends: 36728 [2025-03-03 10:33:28,871 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 10:33:28,871 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 107 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:28,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 60 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36728 states. [2025-03-03 10:33:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36728 to 31559. [2025-03-03 10:33:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31559 states, 31558 states have (on average 1.0720577983395652) internal successors, (33832), 31558 states have internal predecessors, (33832), 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 10:33:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31559 states to 31559 states and 33832 transitions. [2025-03-03 10:33:29,188 INFO L78 Accepts]: Start accepts. Automaton has 31559 states and 33832 transitions. Word has length 626 [2025-03-03 10:33:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:29,189 INFO L471 AbstractCegarLoop]: Abstraction has 31559 states and 33832 transitions. [2025-03-03 10:33:29,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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 10:33:29,189 INFO L276 IsEmpty]: Start isEmpty. Operand 31559 states and 33832 transitions. [2025-03-03 10:33:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2025-03-03 10:33:29,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:29,205 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:29,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 10:33:29,205 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:29,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:29,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1196399905, now seen corresponding path program 1 times [2025-03-03 10:33:29,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:29,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896074833] [2025-03-03 10:33:29,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:29,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:29,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 722 statements into 1 equivalence classes. [2025-03-03 10:33:29,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 722 of 722 statements. [2025-03-03 10:33:29,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:29,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 933 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2025-03-03 10:33:29,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:29,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896074833] [2025-03-03 10:33:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896074833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:29,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:29,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:33:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186968140] [2025-03-03 10:33:29,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:29,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:33:29,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:29,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:33:29,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:33:29,730 INFO L87 Difference]: Start difference. First operand 31559 states and 33832 transitions. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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 10:33:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:30,863 INFO L93 Difference]: Finished difference Result 82478 states and 88436 transitions. [2025-03-03 10:33:30,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:33:30,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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 722 [2025-03-03 10:33:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:30,921 INFO L225 Difference]: With dead ends: 82478 [2025-03-03 10:33:30,921 INFO L226 Difference]: Without dead ends: 52763 [2025-03-03 10:33:30,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:33:30,944 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 458 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:30,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 89 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:33:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52763 states. [2025-03-03 10:33:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52763 to 38932. [2025-03-03 10:33:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38932 states, 38931 states have (on average 1.0725385939225809) internal successors, (41755), 38931 states have internal predecessors, (41755), 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 10:33:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38932 states to 38932 states and 41755 transitions. [2025-03-03 10:33:31,635 INFO L78 Accepts]: Start accepts. Automaton has 38932 states and 41755 transitions. Word has length 722 [2025-03-03 10:33:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:31,636 INFO L471 AbstractCegarLoop]: Abstraction has 38932 states and 41755 transitions. [2025-03-03 10:33:31,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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 10:33:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 38932 states and 41755 transitions. [2025-03-03 10:33:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2025-03-03 10:33:31,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:31,654 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-03-03 10:33:31,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:33:31,654 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:31,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:31,655 INFO L85 PathProgramCache]: Analyzing trace with hash -232369830, now seen corresponding path program 1 times [2025-03-03 10:33:31,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:31,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836404389] [2025-03-03 10:33:31,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:31,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 750 statements into 1 equivalence classes. [2025-03-03 10:33:31,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 750 of 750 statements. [2025-03-03 10:33:31,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:31,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 1256 proven. 77 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2025-03-03 10:33:32,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:32,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836404389] [2025-03-03 10:33:32,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836404389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:32,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018589800] [2025-03-03 10:33:32,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:32,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:32,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:32,141 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 10:33:32,142 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 10:33:32,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 750 statements into 1 equivalence classes. [2025-03-03 10:33:32,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 750 of 750 statements. [2025-03-03 10:33:32,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:32,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:32,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:33:32,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 1333 proven. 0 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2025-03-03 10:33:32,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:33:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018589800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:32,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:33:32,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:33:32,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007177286] [2025-03-03 10:33:32,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:32,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:32,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:32,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:32,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:33:32,517 INFO L87 Difference]: Start difference. First operand 38932 states and 41755 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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 10:33:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:33,046 INFO L93 Difference]: Finished difference Result 79506 states and 85273 transitions. [2025-03-03 10:33:33,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:33,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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 750 [2025-03-03 10:33:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:33,097 INFO L225 Difference]: With dead ends: 79506 [2025-03-03 10:33:33,097 INFO L226 Difference]: Without dead ends: 40760 [2025-03-03 10:33:33,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:33:33,125 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 60 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:33,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 132 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:33,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40760 states. [2025-03-03 10:33:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40760 to 14219. [2025-03-03 10:33:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14219 states, 14218 states have (on average 1.0687157124771416) internal successors, (15195), 14218 states have internal predecessors, (15195), 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 10:33:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14219 states to 14219 states and 15195 transitions. [2025-03-03 10:33:33,337 INFO L78 Accepts]: Start accepts. Automaton has 14219 states and 15195 transitions. Word has length 750 [2025-03-03 10:33:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:33,338 INFO L471 AbstractCegarLoop]: Abstraction has 14219 states and 15195 transitions. [2025-03-03 10:33:33,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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 10:33:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 14219 states and 15195 transitions. [2025-03-03 10:33:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-03 10:33:33,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:33,348 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:33,356 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 10:33:33,549 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,SelfDestructingSolverStorable24 [2025-03-03 10:33:33,549 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:33,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash -591140242, now seen corresponding path program 1 times [2025-03-03 10:33:33,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:33,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676233255] [2025-03-03 10:33:33,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:33,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:33,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-03 10:33:33,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-03 10:33:33,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:33,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1627 backedges. 1123 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-03 10:33:33,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:33,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676233255] [2025-03-03 10:33:33,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676233255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:33,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:33,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:33,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958975673] [2025-03-03 10:33:33,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:33,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:33,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:33,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:33,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:33,917 INFO L87 Difference]: Start difference. First operand 14219 states and 15195 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 10:33:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:34,367 INFO L93 Difference]: Finished difference Result 29176 states and 31114 transitions. [2025-03-03 10:33:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:34,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 757 [2025-03-03 10:33:34,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:34,378 INFO L225 Difference]: With dead ends: 29176 [2025-03-03 10:33:34,378 INFO L226 Difference]: Without dead ends: 14959 [2025-03-03 10:33:34,386 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 10:33:34,386 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 147 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:34,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 63 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14959 states. [2025-03-03 10:33:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14959 to 13299. [2025-03-03 10:33:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13299 states, 13298 states have (on average 1.0653481726575424) internal successors, (14167), 13298 states have internal predecessors, (14167), 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 10:33:34,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13299 states to 13299 states and 14167 transitions. [2025-03-03 10:33:34,487 INFO L78 Accepts]: Start accepts. Automaton has 13299 states and 14167 transitions. Word has length 757 [2025-03-03 10:33:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:34,487 INFO L471 AbstractCegarLoop]: Abstraction has 13299 states and 14167 transitions. [2025-03-03 10:33:34,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 10:33:34,487 INFO L276 IsEmpty]: Start isEmpty. Operand 13299 states and 14167 transitions. [2025-03-03 10:33:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2025-03-03 10:33:34,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:34,496 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:34,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 10:33:34,497 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:34,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1856033442, now seen corresponding path program 1 times [2025-03-03 10:33:34,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:34,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817024950] [2025-03-03 10:33:34,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:34,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:34,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 760 statements into 1 equivalence classes. [2025-03-03 10:33:34,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 760 of 760 statements. [2025-03-03 10:33:34,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:34,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 1273 proven. 64 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-03 10:33:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817024950] [2025-03-03 10:33:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817024950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736663282] [2025-03-03 10:33:35,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:35,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:35,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:35,084 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 10:33:35,085 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 10:33:35,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 760 statements into 1 equivalence classes. [2025-03-03 10:33:35,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 760 of 760 statements. [2025-03-03 10:33:35,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:35,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:35,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:33:35,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 1337 proven. 0 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-03 10:33:35,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:33:35,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736663282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:35,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:33:35,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:33:35,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292126135] [2025-03-03 10:33:35,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:35,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:35,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:35,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:35,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:33:35,386 INFO L87 Difference]: Start difference. First operand 13299 states and 14167 transitions. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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 10:33:35,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:35,862 INFO L93 Difference]: Finished difference Result 27708 states and 29490 transitions. [2025-03-03 10:33:35,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:35,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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 760 [2025-03-03 10:33:35,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:35,874 INFO L225 Difference]: With dead ends: 27708 [2025-03-03 10:33:35,874 INFO L226 Difference]: Without dead ends: 14411 [2025-03-03 10:33:35,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:33:35,882 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 76 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:35,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 336 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14411 states. [2025-03-03 10:33:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14411 to 12931. [2025-03-03 10:33:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12931 states, 12930 states have (on average 1.0638051044083527) internal successors, (13755), 12930 states have internal predecessors, (13755), 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 10:33:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12931 states to 12931 states and 13755 transitions. [2025-03-03 10:33:36,036 INFO L78 Accepts]: Start accepts. Automaton has 12931 states and 13755 transitions. Word has length 760 [2025-03-03 10:33:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:36,036 INFO L471 AbstractCegarLoop]: Abstraction has 12931 states and 13755 transitions. [2025-03-03 10:33:36,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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 10:33:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 12931 states and 13755 transitions. [2025-03-03 10:33:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-03-03 10:33:36,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:36,051 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:36,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 10:33:36,251 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,SelfDestructingSolverStorable26 [2025-03-03 10:33:36,252 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:36,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:36,252 INFO L85 PathProgramCache]: Analyzing trace with hash -459521779, now seen corresponding path program 1 times [2025-03-03 10:33:36,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:36,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530260636] [2025-03-03 10:33:36,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:36,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:36,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-03-03 10:33:36,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-03-03 10:33:36,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:36,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 1308 proven. 73 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-03-03 10:33:37,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:37,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530260636] [2025-03-03 10:33:37,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530260636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:37,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810785749] [2025-03-03 10:33:37,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:37,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:37,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:37,385 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 10:33:37,389 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 10:33:37,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-03-03 10:33:37,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-03-03 10:33:37,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:37,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:37,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 10:33:37,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 965 proven. 496 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-03-03 10:33:38,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:33:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 965 proven. 496 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-03-03 10:33:40,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810785749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:33:40,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:33:40,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 13 [2025-03-03 10:33:40,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361020318] [2025-03-03 10:33:40,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:33:40,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 10:33:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:40,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 10:33:40,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-03 10:33:40,407 INFO L87 Difference]: Start difference. First operand 12931 states and 13755 transitions. Second operand has 13 states, 13 states have (on average 98.53846153846153) internal successors, (1281), 13 states have internal predecessors, (1281), 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 10:33:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:44,762 INFO L93 Difference]: Finished difference Result 33096 states and 35155 transitions. [2025-03-03 10:33:44,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 10:33:44,762 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 98.53846153846153) internal successors, (1281), 13 states have internal predecessors, (1281), 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 833 [2025-03-03 10:33:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:44,779 INFO L225 Difference]: With dead ends: 33096 [2025-03-03 10:33:44,779 INFO L226 Difference]: Without dead ends: 20167 [2025-03-03 10:33:44,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1720 GetRequests, 1681 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=449, Invalid=1191, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 10:33:44,788 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 4572 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 8060 mSolverCounterSat, 1117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4572 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 9177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1117 IncrementalHoareTripleChecker+Valid, 8060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:44,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4572 Valid, 205 Invalid, 9177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1117 Valid, 8060 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 10:33:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20167 states. [2025-03-03 10:33:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20167 to 9789. [2025-03-03 10:33:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9789 states, 9788 states have (on average 1.061708214139763) internal successors, (10392), 9788 states have internal predecessors, (10392), 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 10:33:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9789 states to 9789 states and 10392 transitions. [2025-03-03 10:33:44,888 INFO L78 Accepts]: Start accepts. Automaton has 9789 states and 10392 transitions. Word has length 833 [2025-03-03 10:33:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:44,888 INFO L471 AbstractCegarLoop]: Abstraction has 9789 states and 10392 transitions. [2025-03-03 10:33:44,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 98.53846153846153) internal successors, (1281), 13 states have internal predecessors, (1281), 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 10:33:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 9789 states and 10392 transitions. [2025-03-03 10:33:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 890 [2025-03-03 10:33:44,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:44,896 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:44,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 10:33:45,096 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,SelfDestructingSolverStorable27 [2025-03-03 10:33:45,096 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:45,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1286504872, now seen corresponding path program 1 times [2025-03-03 10:33:45,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:45,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235728891] [2025-03-03 10:33:45,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:45,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:45,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 889 statements into 1 equivalence classes. [2025-03-03 10:33:45,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 889 of 889 statements. [2025-03-03 10:33:45,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:45,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2425 backedges. 1874 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-03-03 10:33:45,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:45,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235728891] [2025-03-03 10:33:45,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235728891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:45,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:45,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:33:45,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137985029] [2025-03-03 10:33:45,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:45,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:33:45,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:45,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:33:45,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:45,740 INFO L87 Difference]: Start difference. First operand 9789 states and 10392 transitions. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 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 10:33:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:46,395 INFO L93 Difference]: Finished difference Result 21977 states and 23308 transitions. [2025-03-03 10:33:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:33:46,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 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 889 [2025-03-03 10:33:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:46,405 INFO L225 Difference]: With dead ends: 21977 [2025-03-03 10:33:46,405 INFO L226 Difference]: Without dead ends: 12006 [2025-03-03 10:33:46,410 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 10:33:46,410 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 235 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:46,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 64 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:33:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12006 states. [2025-03-03 10:33:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12006 to 8501. [2025-03-03 10:33:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8501 states, 8500 states have (on average 1.0588235294117647) internal successors, (9000), 8500 states have internal predecessors, (9000), 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 10:33:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8501 states to 8501 states and 9000 transitions. [2025-03-03 10:33:46,481 INFO L78 Accepts]: Start accepts. Automaton has 8501 states and 9000 transitions. Word has length 889 [2025-03-03 10:33:46,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:46,481 INFO L471 AbstractCegarLoop]: Abstraction has 8501 states and 9000 transitions. [2025-03-03 10:33:46,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 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 10:33:46,481 INFO L276 IsEmpty]: Start isEmpty. Operand 8501 states and 9000 transitions. [2025-03-03 10:33:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2025-03-03 10:33:46,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:46,487 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:46,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 10:33:46,488 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:46,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash 636712118, now seen corresponding path program 1 times [2025-03-03 10:33:46,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:46,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644102376] [2025-03-03 10:33:46,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:46,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:46,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 945 statements into 1 equivalence classes. [2025-03-03 10:33:46,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 945 of 945 statements. [2025-03-03 10:33:46,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:46,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2555 backedges. 1898 proven. 0 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2025-03-03 10:33:47,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644102376] [2025-03-03 10:33:47,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644102376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:47,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:47,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:33:47,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204875107] [2025-03-03 10:33:47,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:47,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:33:47,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:47,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:33:47,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:47,130 INFO L87 Difference]: Start difference. First operand 8501 states and 9000 transitions. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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 10:33:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:47,655 INFO L93 Difference]: Finished difference Result 13859 states and 14607 transitions. [2025-03-03 10:33:47,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:33:47,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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 945 [2025-03-03 10:33:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:47,657 INFO L225 Difference]: With dead ends: 13859 [2025-03-03 10:33:47,657 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:33:47,660 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 10:33:47,660 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 202 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:47,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 33 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:33:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:33:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:33:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 10:33:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:33:47,661 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 945 [2025-03-03 10:33:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:47,661 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:33:47,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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 10:33:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:33:47,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:33:47,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:33:47,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 10:33:47,666 INFO L422 BasicCegarLoop]: Path program 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, 1, 1, 1] [2025-03-03 10:33:47,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.