./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/Problem03_label03.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 270b49fc6fbf3a6d565e1c23dc80c7cece24e766c52320c8c625102e15c9685f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:09:06,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:09:06,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:09:06,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:09:06,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:09:06,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:09:06,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:09:06,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:09:06,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:09:06,619 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:09:06,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:09:06,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:09:06,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:09:06,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:09:06,620 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:09:06,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:09:06,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:09:06,621 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:09:06,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:09:06,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:09:06,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:09:06,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:09:06,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:09:06,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:09:06,622 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:09:06,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:09:06,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:09:06,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:09:06,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:09:06,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:09:06,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:09:06,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:09:06,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:09:06,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:09:06,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:09:06,623 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:09:06,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:09:06,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:09:06,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:09:06,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:09:06,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:09:06,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:09:06,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:09:06,624 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 -> 270b49fc6fbf3a6d565e1c23dc80c7cece24e766c52320c8c625102e15c9685f [2025-03-16 14:09:06,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:09:06,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:09:06,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:09:06,906 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:09:06,906 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:09:06,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label03.c [2025-03-16 14:09:08,061 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5c7e085/2a7a7f7ef04a4828a04a53d5075c2b30/FLAG67c7a6cc4 [2025-03-16 14:09:08,368 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:09:08,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label03.c [2025-03-16 14:09:08,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5c7e085/2a7a7f7ef04a4828a04a53d5075c2b30/FLAG67c7a6cc4 [2025-03-16 14:09:08,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5c7e085/2a7a7f7ef04a4828a04a53d5075c2b30 [2025-03-16 14:09:08,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:09:08,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:09:08,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:09:08,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:09:08,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:09:08,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:09:08" (1/1) ... [2025-03-16 14:09:08,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c168c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:08, skipping insertion in model container [2025-03-16 14:09:08,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:09:08" (1/1) ... [2025-03-16 14:09:08,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:09:08,969 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/Problem03_label03.c[56355,56368] [2025-03-16 14:09:09,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:09:09,011 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:09:09,121 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/Problem03_label03.c[56355,56368] [2025-03-16 14:09:09,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:09:09,145 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:09:09,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09 WrapperNode [2025-03-16 14:09:09,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:09:09,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:09:09,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:09:09,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:09:09,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,246 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-16 14:09:09,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:09:09,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:09:09,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:09:09,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:09:09,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,299 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-16 14:09:09,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:09:09,358 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:09:09,358 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:09:09,358 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:09:09,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (1/1) ... [2025-03-16 14:09:09,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:09:09,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:09,410 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-16 14:09:09,413 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-16 14:09:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:09:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:09:09,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:09:09,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:09:09,495 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:09:09,496 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:09:10,906 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-16 14:09:10,906 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:09:10,918 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:09:10,920 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:09:10,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:09:10 BoogieIcfgContainer [2025-03-16 14:09:10,921 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:09:10,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:09:10,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:09:10,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:09:10,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:09:08" (1/3) ... [2025-03-16 14:09:10,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcc69a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:09:10, skipping insertion in model container [2025-03-16 14:09:10,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:09:09" (2/3) ... [2025-03-16 14:09:10,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcc69a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:09:10, skipping insertion in model container [2025-03-16 14:09:10,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:09:10" (3/3) ... [2025-03-16 14:09:10,928 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label03.c [2025-03-16 14:09:10,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:09:10,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label03.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:09:11,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:09:11,018 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;@6e596552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:09:11,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:09:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 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-16 14:09:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-16 14:09:11,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:11,036 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, 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, 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-16 14:09:11,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:11,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1916083534, now seen corresponding path program 1 times [2025-03-16 14:09:11,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:11,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784632668] [2025-03-16 14:09:11,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:11,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:11,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-16 14:09:11,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-16 14:09:11,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:11,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:11,483 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-16 14:09:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:11,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784632668] [2025-03-16 14:09:11,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784632668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:11,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:11,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:11,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950396062] [2025-03-16 14:09:11,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:11,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:09:11,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:11,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:09:11,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:09:11,506 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 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 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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-16 14:09:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:11,536 INFO L93 Difference]: Finished difference Result 481 states and 913 transitions. [2025-03-16 14:09:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:09:11,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-03-16 14:09:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:11,545 INFO L225 Difference]: With dead ends: 481 [2025-03-16 14:09:11,545 INFO L226 Difference]: Without dead ends: 238 [2025-03-16 14:09:11,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:09:11,548 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:11,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:09:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-16 14:09:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-16 14:09:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 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-16 14:09:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2025-03-16 14:09:11,591 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 163 [2025-03-16 14:09:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:11,591 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2025-03-16 14:09:11,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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-16 14:09:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2025-03-16 14:09:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-16 14:09:11,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:11,593 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, 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, 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-16 14:09:11,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:09:11,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:11,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:11,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1158763534, now seen corresponding path program 1 times [2025-03-16 14:09:11,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:11,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258376973] [2025-03-16 14:09:11,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:11,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:11,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-16 14:09:11,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-16 14:09:11,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:11,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:12,004 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-16 14:09:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:12,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258376973] [2025-03-16 14:09:12,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258376973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:12,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:12,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313512394] [2025-03-16 14:09:12,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:12,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:12,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:12,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:12,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:12,009 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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-16 14:09:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:12,709 INFO L93 Difference]: Finished difference Result 698 states and 1151 transitions. [2025-03-16 14:09:12,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:12,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-03-16 14:09:12,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:12,712 INFO L225 Difference]: With dead ends: 698 [2025-03-16 14:09:12,712 INFO L226 Difference]: Without dead ends: 461 [2025-03-16 14:09:12,713 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-16 14:09:12,713 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 92 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:12,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 149 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:09:12,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-16 14:09:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2025-03-16 14:09:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.539301310043668) internal successors, (705), 458 states have internal predecessors, (705), 0 states have call successors, (0), 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-16 14:09:12,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 705 transitions. [2025-03-16 14:09:12,730 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 705 transitions. Word has length 163 [2025-03-16 14:09:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:12,731 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 705 transitions. [2025-03-16 14:09:12,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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-16 14:09:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 705 transitions. [2025-03-16 14:09:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-16 14:09:12,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:12,733 INFO L218 NwaCegarLoop]: trace histogram [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, 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-16 14:09:12,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:09:12,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:12,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash 829582212, now seen corresponding path program 1 times [2025-03-16 14:09:12,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:12,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669430460] [2025-03-16 14:09:12,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:12,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:12,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 14:09:12,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 14:09:12,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:12,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:12,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:12,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669430460] [2025-03-16 14:09:12,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669430460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:12,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:12,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:12,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734367840] [2025-03-16 14:09:12,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:12,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:12,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:12,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:12,901 INFO L87 Difference]: Start difference. First operand 459 states and 705 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 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-16 14:09:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:13,574 INFO L93 Difference]: Finished difference Result 1343 states and 2078 transitions. [2025-03-16 14:09:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:13,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-03-16 14:09:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:13,578 INFO L225 Difference]: With dead ends: 1343 [2025-03-16 14:09:13,578 INFO L226 Difference]: Without dead ends: 885 [2025-03-16 14:09:13,579 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-16 14:09:13,579 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:13,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-16 14:09:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 869. [2025-03-16 14:09:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.5138248847926268) internal successors, (1314), 868 states have internal predecessors, (1314), 0 states have call successors, (0), 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-16 14:09:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1314 transitions. [2025-03-16 14:09:13,602 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1314 transitions. Word has length 171 [2025-03-16 14:09:13,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:13,602 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1314 transitions. [2025-03-16 14:09:13,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 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-16 14:09:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1314 transitions. [2025-03-16 14:09:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 14:09:13,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:13,604 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-16 14:09:13,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:09:13,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:13,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:13,605 INFO L85 PathProgramCache]: Analyzing trace with hash 32686817, now seen corresponding path program 1 times [2025-03-16 14:09:13,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:13,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124910524] [2025-03-16 14:09:13,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:13,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 14:09:13,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 14:09:13,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:13,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:09:13,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:13,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124910524] [2025-03-16 14:09:13,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124910524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:13,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:13,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:13,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334120498] [2025-03-16 14:09:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:13,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:13,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:13,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:13,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:13,805 INFO L87 Difference]: Start difference. First operand 869 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-16 14:09:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:14,469 INFO L93 Difference]: Finished difference Result 2558 states and 3881 transitions. [2025-03-16 14:09:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:14,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 178 [2025-03-16 14:09:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:14,477 INFO L225 Difference]: With dead ends: 2558 [2025-03-16 14:09:14,477 INFO L226 Difference]: Without dead ends: 1690 [2025-03-16 14:09:14,478 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-16 14:09:14,479 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 86 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:14,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 400 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2025-03-16 14:09:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1684. [2025-03-16 14:09:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.4390968508615567) internal successors, (2422), 1683 states have internal predecessors, (2422), 0 states have call successors, (0), 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-16 14:09:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2422 transitions. [2025-03-16 14:09:14,514 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2422 transitions. Word has length 178 [2025-03-16 14:09:14,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:14,515 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2422 transitions. [2025-03-16 14:09:14,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-16 14:09:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2422 transitions. [2025-03-16 14:09:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-16 14:09:14,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:14,521 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 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, 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-16 14:09:14,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:09:14,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:14,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1108069354, now seen corresponding path program 1 times [2025-03-16 14:09:14,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:14,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268018892] [2025-03-16 14:09:14,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:14,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:14,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 14:09:14,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 14:09:14,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:14,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:09:14,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:14,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268018892] [2025-03-16 14:09:14,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268018892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:14,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:14,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:14,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691908439] [2025-03-16 14:09:14,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:14,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:14,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:14,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:14,732 INFO L87 Difference]: Start difference. First operand 1684 states and 2422 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-16 14:09:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:15,388 INFO L93 Difference]: Finished difference Result 4995 states and 7191 transitions. [2025-03-16 14:09:15,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:15,389 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 184 [2025-03-16 14:09:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:15,399 INFO L225 Difference]: With dead ends: 4995 [2025-03-16 14:09:15,399 INFO L226 Difference]: Without dead ends: 3312 [2025-03-16 14:09:15,401 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-16 14:09:15,402 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 231 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:15,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 417 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:15,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2025-03-16 14:09:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3310. [2025-03-16 14:09:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3310 states, 3309 states have (on average 1.2910244786944696) internal successors, (4272), 3309 states have internal predecessors, (4272), 0 states have call successors, (0), 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-16 14:09:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4272 transitions. [2025-03-16 14:09:15,458 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4272 transitions. Word has length 184 [2025-03-16 14:09:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:15,459 INFO L471 AbstractCegarLoop]: Abstraction has 3310 states and 4272 transitions. [2025-03-16 14:09:15,459 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-16 14:09:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4272 transitions. [2025-03-16 14:09:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 14:09:15,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:15,464 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, 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, 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-16 14:09:15,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:09:15,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:15,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:15,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1882407003, now seen corresponding path program 1 times [2025-03-16 14:09:15,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:15,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336311067] [2025-03-16 14:09:15,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:15,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:15,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 14:09:15,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 14:09:15,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:15,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:15,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:15,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336311067] [2025-03-16 14:09:15,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336311067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:15,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:15,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:15,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134876729] [2025-03-16 14:09:15,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:15,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:15,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:15,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:15,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:15,623 INFO L87 Difference]: Start difference. First operand 3310 states and 4272 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:16,251 INFO L93 Difference]: Finished difference Result 9679 states and 12531 transitions. [2025-03-16 14:09:16,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:16,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2025-03-16 14:09:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:16,269 INFO L225 Difference]: With dead ends: 9679 [2025-03-16 14:09:16,270 INFO L226 Difference]: Without dead ends: 6370 [2025-03-16 14:09:16,274 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-16 14:09:16,275 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 239 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:16,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 172 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6370 states. [2025-03-16 14:09:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6370 to 6369. [2025-03-16 14:09:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6369 states, 6368 states have (on average 1.2526695979899498) internal successors, (7977), 6368 states have internal predecessors, (7977), 0 states have call successors, (0), 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-16 14:09:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6369 states to 6369 states and 7977 transitions. [2025-03-16 14:09:16,395 INFO L78 Accepts]: Start accepts. Automaton has 6369 states and 7977 transitions. Word has length 186 [2025-03-16 14:09:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:16,395 INFO L471 AbstractCegarLoop]: Abstraction has 6369 states and 7977 transitions. [2025-03-16 14:09:16,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 6369 states and 7977 transitions. [2025-03-16 14:09:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 14:09:16,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:16,405 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-16 14:09:16,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:09:16,405 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:16,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1437652706, now seen corresponding path program 1 times [2025-03-16 14:09:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:16,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682296683] [2025-03-16 14:09:16,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:16,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:16,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 14:09:16,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 14:09:16,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:16,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-16 14:09:16,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:16,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682296683] [2025-03-16 14:09:16,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682296683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:16,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:16,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:16,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841764020] [2025-03-16 14:09:16,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:16,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:16,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:16,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:16,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:16,561 INFO L87 Difference]: Start difference. First operand 6369 states and 7977 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:16,907 INFO L93 Difference]: Finished difference Result 12705 states and 15910 transitions. [2025-03-16 14:09:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:16,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-03-16 14:09:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:16,924 INFO L225 Difference]: With dead ends: 12705 [2025-03-16 14:09:16,924 INFO L226 Difference]: Without dead ends: 6337 [2025-03-16 14:09:16,931 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-16 14:09:16,931 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 321 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:16,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 30 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:09:16,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2025-03-16 14:09:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 6337. [2025-03-16 14:09:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6337 states, 6336 states have (on average 1.2258522727272727) internal successors, (7767), 6336 states have internal predecessors, (7767), 0 states have call successors, (0), 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-16 14:09:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6337 states to 6337 states and 7767 transitions. [2025-03-16 14:09:17,041 INFO L78 Accepts]: Start accepts. Automaton has 6337 states and 7767 transitions. Word has length 198 [2025-03-16 14:09:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:17,041 INFO L471 AbstractCegarLoop]: Abstraction has 6337 states and 7767 transitions. [2025-03-16 14:09:17,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 6337 states and 7767 transitions. [2025-03-16 14:09:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-16 14:09:17,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:17,049 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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-16 14:09:17,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:09:17,050 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:17,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1417157036, now seen corresponding path program 1 times [2025-03-16 14:09:17,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:17,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45745072] [2025-03-16 14:09:17,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:17,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-16 14:09:17,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-16 14:09:17,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:17,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 14:09:17,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:17,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45745072] [2025-03-16 14:09:17,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45745072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:17,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:17,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969911287] [2025-03-16 14:09:17,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:17,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:17,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:17,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:17,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:17,277 INFO L87 Difference]: Start difference. First operand 6337 states and 7767 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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-16 14:09:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:17,882 INFO L93 Difference]: Finished difference Result 15737 states and 19234 transitions. [2025-03-16 14:09:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:17,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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 223 [2025-03-16 14:09:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:17,906 INFO L225 Difference]: With dead ends: 15737 [2025-03-16 14:09:17,906 INFO L226 Difference]: Without dead ends: 9401 [2025-03-16 14:09:17,914 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-16 14:09:17,914 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 198 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:17,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 104 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:09:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9401 states. [2025-03-16 14:09:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9401 to 9400. [2025-03-16 14:09:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9400 states, 9399 states have (on average 1.2097031599106287) internal successors, (11370), 9399 states have internal predecessors, (11370), 0 states have call successors, (0), 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-16 14:09:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9400 states to 9400 states and 11370 transitions. [2025-03-16 14:09:18,064 INFO L78 Accepts]: Start accepts. Automaton has 9400 states and 11370 transitions. Word has length 223 [2025-03-16 14:09:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:18,064 INFO L471 AbstractCegarLoop]: Abstraction has 9400 states and 11370 transitions. [2025-03-16 14:09:18,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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-16 14:09:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 9400 states and 11370 transitions. [2025-03-16 14:09:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 14:09:18,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:18,079 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:18,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:09:18,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:18,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:18,079 INFO L85 PathProgramCache]: Analyzing trace with hash 850271278, now seen corresponding path program 1 times [2025-03-16 14:09:18,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:18,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349630355] [2025-03-16 14:09:18,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:18,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:18,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 14:09:18,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 14:09:18,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:18,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:18,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:18,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349630355] [2025-03-16 14:09:18,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349630355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:18,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:18,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:18,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496227223] [2025-03-16 14:09:18,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:18,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:18,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:18,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:18,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:18,305 INFO L87 Difference]: Start difference. First operand 9400 states and 11370 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 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-16 14:09:18,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:18,976 INFO L93 Difference]: Finished difference Result 22656 states and 27934 transitions. [2025-03-16 14:09:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:18,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-16 14:09:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:19,001 INFO L225 Difference]: With dead ends: 22656 [2025-03-16 14:09:19,001 INFO L226 Difference]: Without dead ends: 13257 [2025-03-16 14:09:19,013 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-16 14:09:19,014 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 152 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:19,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 149 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13257 states. [2025-03-16 14:09:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13257 to 13257. [2025-03-16 14:09:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13257 states, 13256 states have (on average 1.1725256487628244) internal successors, (15543), 13256 states have internal predecessors, (15543), 0 states have call successors, (0), 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-16 14:09:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13257 states to 13257 states and 15543 transitions. [2025-03-16 14:09:19,180 INFO L78 Accepts]: Start accepts. Automaton has 13257 states and 15543 transitions. Word has length 227 [2025-03-16 14:09:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:19,180 INFO L471 AbstractCegarLoop]: Abstraction has 13257 states and 15543 transitions. [2025-03-16 14:09:19,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 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-16 14:09:19,181 INFO L276 IsEmpty]: Start isEmpty. Operand 13257 states and 15543 transitions. [2025-03-16 14:09:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-16 14:09:19,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:19,194 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, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-03-16 14:09:19,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:09:19,194 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:19,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:19,195 INFO L85 PathProgramCache]: Analyzing trace with hash 323179189, now seen corresponding path program 1 times [2025-03-16 14:09:19,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:19,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791683763] [2025-03-16 14:09:19,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:19,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:19,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 14:09:19,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 14:09:19,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:19,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:19,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791683763] [2025-03-16 14:09:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791683763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:19,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:19,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:19,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012049828] [2025-03-16 14:09:19,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:19,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:19,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:19,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:19,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:19,404 INFO L87 Difference]: Start difference. First operand 13257 states and 15543 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:20,136 INFO L93 Difference]: Finished difference Result 34065 states and 39919 transitions. [2025-03-16 14:09:20,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:20,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-03-16 14:09:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:20,236 INFO L225 Difference]: With dead ends: 34065 [2025-03-16 14:09:20,236 INFO L226 Difference]: Without dead ends: 20809 [2025-03-16 14:09:20,243 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-16 14:09:20,244 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 159 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:20,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 152 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20809 states. [2025-03-16 14:09:20,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20809 to 20806. [2025-03-16 14:09:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20806 states, 20805 states have (on average 1.16986301369863) internal successors, (24339), 20805 states have internal predecessors, (24339), 0 states have call successors, (0), 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-16 14:09:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20806 states to 20806 states and 24339 transitions. [2025-03-16 14:09:20,458 INFO L78 Accepts]: Start accepts. Automaton has 20806 states and 24339 transitions. Word has length 238 [2025-03-16 14:09:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:20,458 INFO L471 AbstractCegarLoop]: Abstraction has 20806 states and 24339 transitions. [2025-03-16 14:09:20,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:09:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 20806 states and 24339 transitions. [2025-03-16 14:09:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-16 14:09:20,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:20,478 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1] [2025-03-16 14:09:20,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:09:20,478 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:20,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:20,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1485026760, now seen corresponding path program 1 times [2025-03-16 14:09:20,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:20,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233337259] [2025-03-16 14:09:20,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:20,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-16 14:09:20,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-16 14:09:20,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:20,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 81 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:21,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:21,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233337259] [2025-03-16 14:09:21,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233337259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:21,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849598816] [2025-03-16 14:09:21,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:21,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:21,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:21,514 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-16 14:09:21,516 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-16 14:09:21,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-16 14:09:21,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-16 14:09:21,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:21,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:21,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:09:21,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:09:21,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:21,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849598816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:21,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:21,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 14:09:21,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647583567] [2025-03-16 14:09:21,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:21,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:21,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:21,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:21,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:09:21,743 INFO L87 Difference]: Start difference. First operand 20806 states and 24339 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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-16 14:09:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:22,440 INFO L93 Difference]: Finished difference Result 54237 states and 63830 transitions. [2025-03-16 14:09:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:22,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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 245 [2025-03-16 14:09:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:22,518 INFO L225 Difference]: With dead ends: 54237 [2025-03-16 14:09:22,518 INFO L226 Difference]: Without dead ends: 33432 [2025-03-16 14:09:22,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:09:22,543 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:22,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 140 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:09:22,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33432 states. [2025-03-16 14:09:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33432 to 30962. [2025-03-16 14:09:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30962 states, 30961 states have (on average 1.1855237233939473) internal successors, (36705), 30961 states have internal predecessors, (36705), 0 states have call successors, (0), 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-16 14:09:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30962 states to 30962 states and 36705 transitions. [2025-03-16 14:09:22,887 INFO L78 Accepts]: Start accepts. Automaton has 30962 states and 36705 transitions. Word has length 245 [2025-03-16 14:09:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:22,888 INFO L471 AbstractCegarLoop]: Abstraction has 30962 states and 36705 transitions. [2025-03-16 14:09:22,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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-16 14:09:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 30962 states and 36705 transitions. [2025-03-16 14:09:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-16 14:09:22,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:22,914 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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, 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, 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-16 14:09:22,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:09:23,115 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,SelfDestructingSolverStorable10 [2025-03-16 14:09:23,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:23,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1139292141, now seen corresponding path program 1 times [2025-03-16 14:09:23,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:23,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020529856] [2025-03-16 14:09:23,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:23,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:23,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-16 14:09:23,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-16 14:09:23,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:23,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 14:09:23,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:23,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020529856] [2025-03-16 14:09:23,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020529856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:23,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:23,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869614759] [2025-03-16 14:09:23,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:23,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:09:23,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:23,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:09:23,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:09:23,346 INFO L87 Difference]: Start difference. First operand 30962 states and 36705 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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-16 14:09:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:24,248 INFO L93 Difference]: Finished difference Result 92624 states and 109821 transitions. [2025-03-16 14:09:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:09:24,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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 260 [2025-03-16 14:09:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:24,331 INFO L225 Difference]: With dead ends: 92624 [2025-03-16 14:09:24,332 INFO L226 Difference]: Without dead ends: 61663 [2025-03-16 14:09:24,362 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-16 14:09:24,363 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 551 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:24,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 434 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:09:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61663 states. [2025-03-16 14:09:24,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61663 to 61658. [2025-03-16 14:09:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61658 states, 61657 states have (on average 1.1646203999545874) internal successors, (71807), 61657 states have internal predecessors, (71807), 0 states have call successors, (0), 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-16 14:09:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61658 states to 61658 states and 71807 transitions. [2025-03-16 14:09:25,087 INFO L78 Accepts]: Start accepts. Automaton has 61658 states and 71807 transitions. Word has length 260 [2025-03-16 14:09:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:25,088 INFO L471 AbstractCegarLoop]: Abstraction has 61658 states and 71807 transitions. [2025-03-16 14:09:25,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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-16 14:09:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 61658 states and 71807 transitions. [2025-03-16 14:09:25,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-16 14:09:25,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:25,109 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:25,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:09:25,109 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:25,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:25,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1953519514, now seen corresponding path program 1 times [2025-03-16 14:09:25,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:25,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356998921] [2025-03-16 14:09:25,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:25,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:25,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-16 14:09:25,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-16 14:09:25,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:25,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-16 14:09:25,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:25,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356998921] [2025-03-16 14:09:25,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356998921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:25,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206883116] [2025-03-16 14:09:25,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:25,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:25,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:25,457 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-16 14:09:25,459 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-16 14:09:25,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-16 14:09:25,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-16 14:09:25,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:25,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:25,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:09:25,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 14:09:25,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:09:25,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206883116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:25,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:09:25,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:09:25,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818918822] [2025-03-16 14:09:25,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:25,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:25,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:25,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:25,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:09:25,750 INFO L87 Difference]: Start difference. First operand 61658 states and 71807 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-16 14:09:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:26,495 INFO L93 Difference]: Finished difference Result 122104 states and 142312 transitions. [2025-03-16 14:09:26,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:26,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 271 [2025-03-16 14:09:26,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:26,584 INFO L225 Difference]: With dead ends: 122104 [2025-03-16 14:09:26,584 INFO L226 Difference]: Without dead ends: 60447 [2025-03-16 14:09:26,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:09:26,626 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 100 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:26,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 288 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:09:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60447 states. [2025-03-16 14:09:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60447 to 60034. [2025-03-16 14:09:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60034 states, 60033 states have (on average 1.156497259840421) internal successors, (69428), 60033 states have internal predecessors, (69428), 0 states have call successors, (0), 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-16 14:09:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60034 states to 60034 states and 69428 transitions. [2025-03-16 14:09:27,552 INFO L78 Accepts]: Start accepts. Automaton has 60034 states and 69428 transitions. Word has length 271 [2025-03-16 14:09:27,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:27,553 INFO L471 AbstractCegarLoop]: Abstraction has 60034 states and 69428 transitions. [2025-03-16 14:09:27,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-16 14:09:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand 60034 states and 69428 transitions. [2025-03-16 14:09:27,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-16 14:09:27,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:27,588 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:09:27,595 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-16 14:09:27,788 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,SelfDestructingSolverStorable12 [2025-03-16 14:09:27,789 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:27,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash 254734345, now seen corresponding path program 1 times [2025-03-16 14:09:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:27,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291873413] [2025-03-16 14:09:27,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:27,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:27,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-16 14:09:27,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-16 14:09:27,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:27,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 14:09:28,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291873413] [2025-03-16 14:09:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291873413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:28,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:28,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:28,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694923802] [2025-03-16 14:09:28,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:28,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:09:28,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:28,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:09:28,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:09:28,068 INFO L87 Difference]: Start difference. First operand 60034 states and 69428 transitions. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-16 14:09:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:29,120 INFO L93 Difference]: Finished difference Result 129854 states and 149954 transitions. [2025-03-16 14:09:29,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:09:29,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 293 [2025-03-16 14:09:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:29,197 INFO L225 Difference]: With dead ends: 129854 [2025-03-16 14:09:29,197 INFO L226 Difference]: Without dead ends: 69821 [2025-03-16 14:09:29,241 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-16 14:09:29,242 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 353 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:29,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 88 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:09:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69821 states. [2025-03-16 14:09:29,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69821 to 68354. [2025-03-16 14:09:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68354 states, 68353 states have (on average 1.1287580647520958) internal successors, (77154), 68353 states have internal predecessors, (77154), 0 states have call successors, (0), 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-16 14:09:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68354 states to 68354 states and 77154 transitions. [2025-03-16 14:09:29,909 INFO L78 Accepts]: Start accepts. Automaton has 68354 states and 77154 transitions. Word has length 293 [2025-03-16 14:09:29,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:29,909 INFO L471 AbstractCegarLoop]: Abstraction has 68354 states and 77154 transitions. [2025-03-16 14:09:29,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-16 14:09:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 68354 states and 77154 transitions. [2025-03-16 14:09:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-16 14:09:29,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:29,945 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:29,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:09:29,946 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:29,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:29,946 INFO L85 PathProgramCache]: Analyzing trace with hash 811315895, now seen corresponding path program 2 times [2025-03-16 14:09:29,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:29,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834988662] [2025-03-16 14:09:29,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:09:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:29,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 299 statements into 2 equivalence classes. [2025-03-16 14:09:30,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 299 of 299 statements. [2025-03-16 14:09:30,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:09:30,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-16 14:09:30,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:30,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834988662] [2025-03-16 14:09:30,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834988662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:30,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:30,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:30,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627970195] [2025-03-16 14:09:30,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:30,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:09:30,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:30,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:09:30,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:09:30,556 INFO L87 Difference]: Start difference. First operand 68354 states and 77154 transitions. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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-16 14:09:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:31,935 INFO L93 Difference]: Finished difference Result 179236 states and 202636 transitions. [2025-03-16 14:09:31,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:09:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 299 [2025-03-16 14:09:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:32,060 INFO L225 Difference]: With dead ends: 179236 [2025-03-16 14:09:32,061 INFO L226 Difference]: Without dead ends: 110883 [2025-03-16 14:09:32,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:09:32,091 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 761 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:32,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 69 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:09:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110883 states. [2025-03-16 14:09:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110883 to 102396. [2025-03-16 14:09:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102396 states, 102395 states have (on average 1.117369012158797) internal successors, (114413), 102395 states have internal predecessors, (114413), 0 states have call successors, (0), 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-16 14:09:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102396 states to 102396 states and 114413 transitions. [2025-03-16 14:09:33,430 INFO L78 Accepts]: Start accepts. Automaton has 102396 states and 114413 transitions. Word has length 299 [2025-03-16 14:09:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 102396 states and 114413 transitions. [2025-03-16 14:09:33,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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-16 14:09:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 102396 states and 114413 transitions. [2025-03-16 14:09:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-16 14:09:33,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:33,468 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:09:33,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:09:33,468 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:33,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:33,469 INFO L85 PathProgramCache]: Analyzing trace with hash 986776334, now seen corresponding path program 1 times [2025-03-16 14:09:33,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:33,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793227788] [2025-03-16 14:09:33,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:33,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:33,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-16 14:09:33,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-16 14:09:33,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:33,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 108 proven. 6 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-16 14:09:34,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:34,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793227788] [2025-03-16 14:09:34,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793227788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:09:34,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013876028] [2025-03-16 14:09:34,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:34,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:34,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:09:34,557 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-16 14:09:34,558 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-16 14:09:34,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-16 14:09:34,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-16 14:09:34,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:34,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:34,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 14:09:34,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:09:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 108 proven. 99 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 14:09:34,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:09:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 108 proven. 99 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 14:09:35,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013876028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:09:35,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:09:35,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-16 14:09:35,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169888353] [2025-03-16 14:09:35,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:09:35,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:09:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:35,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:09:35,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:09:35,191 INFO L87 Difference]: Start difference. First operand 102396 states and 114413 transitions. Second operand has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 0 states have call successors, (0), 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-16 14:09:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:37,618 INFO L93 Difference]: Finished difference Result 262746 states and 293894 transitions. [2025-03-16 14:09:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 14:09:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 0 states have call successors, (0), 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 302 [2025-03-16 14:09:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:37,785 INFO L225 Difference]: With dead ends: 262746 [2025-03-16 14:09:37,785 INFO L226 Difference]: Without dead ends: 160351 [2025-03-16 14:09:37,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:09:37,856 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 1265 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 3078 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 3390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 3078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:37,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 372 Invalid, 3390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 3078 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:09:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160351 states. [2025-03-16 14:09:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160351 to 158910. [2025-03-16 14:09:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158910 states, 158909 states have (on average 1.1182186030998873) internal successors, (177695), 158909 states have internal predecessors, (177695), 0 states have call successors, (0), 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-16 14:09:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158910 states to 158910 states and 177695 transitions. [2025-03-16 14:09:40,206 INFO L78 Accepts]: Start accepts. Automaton has 158910 states and 177695 transitions. Word has length 302 [2025-03-16 14:09:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:40,206 INFO L471 AbstractCegarLoop]: Abstraction has 158910 states and 177695 transitions. [2025-03-16 14:09:40,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 0 states have call successors, (0), 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-16 14:09:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 158910 states and 177695 transitions. [2025-03-16 14:09:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-16 14:09:40,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:40,247 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 14:09:40,253 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-16 14:09:40,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:09:40,447 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:40,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash -728696194, now seen corresponding path program 1 times [2025-03-16 14:09:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:40,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876916832] [2025-03-16 14:09:40,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:40,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:40,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-16 14:09:40,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-16 14:09:40,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:40,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:09:41,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:41,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876916832] [2025-03-16 14:09:41,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876916832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:41,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:41,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:41,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840002079] [2025-03-16 14:09:41,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:41,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:41,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:41,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:41,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:41,230 INFO L87 Difference]: Start difference. First operand 158910 states and 177695 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 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-16 14:09:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:42,367 INFO L93 Difference]: Finished difference Result 315789 states and 353227 transitions. [2025-03-16 14:09:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:42,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 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 302 [2025-03-16 14:09:42,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:42,534 INFO L225 Difference]: With dead ends: 315789 [2025-03-16 14:09:42,534 INFO L226 Difference]: Without dead ends: 158910 [2025-03-16 14:09:42,612 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-16 14:09:42,613 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 67 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:42,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 162 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:09:42,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158910 states. [2025-03-16 14:09:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158910 to 158910. [2025-03-16 14:09:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158910 states, 158909 states have (on average 1.1182123101901087) internal successors, (177694), 158909 states have internal predecessors, (177694), 0 states have call successors, (0), 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-16 14:09:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158910 states to 158910 states and 177694 transitions. [2025-03-16 14:09:44,706 INFO L78 Accepts]: Start accepts. Automaton has 158910 states and 177694 transitions. Word has length 302 [2025-03-16 14:09:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:44,706 INFO L471 AbstractCegarLoop]: Abstraction has 158910 states and 177694 transitions. [2025-03-16 14:09:44,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 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-16 14:09:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 158910 states and 177694 transitions. [2025-03-16 14:09:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-16 14:09:44,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:44,761 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:09:44,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:09:44,761 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:44,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash 513656851, now seen corresponding path program 1 times [2025-03-16 14:09:44,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:44,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901484351] [2025-03-16 14:09:44,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:44,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:44,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-16 14:09:44,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-16 14:09:44,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:44,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-03-16 14:09:45,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901484351] [2025-03-16 14:09:45,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901484351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:45,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:45,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:09:45,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707958441] [2025-03-16 14:09:45,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:45,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:09:45,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:45,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:09:45,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:09:45,297 INFO L87 Difference]: Start difference. First operand 158910 states and 177694 transitions. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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-16 14:09:47,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:47,017 INFO L93 Difference]: Finished difference Result 466166 states and 520784 transitions. [2025-03-16 14:09:47,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:09:47,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 343 [2025-03-16 14:09:47,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:47,428 INFO L225 Difference]: With dead ends: 466166 [2025-03-16 14:09:47,428 INFO L226 Difference]: Without dead ends: 307257 [2025-03-16 14:09:47,848 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-16 14:09:47,849 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 721 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:47,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 358 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:09:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307257 states. [2025-03-16 14:09:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307257 to 272101. [2025-03-16 14:09:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272101 states, 272100 states have (on average 1.1146269753766997) internal successors, (303290), 272100 states have internal predecessors, (303290), 0 states have call successors, (0), 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-16 14:09:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272101 states to 272101 states and 303290 transitions. [2025-03-16 14:09:51,605 INFO L78 Accepts]: Start accepts. Automaton has 272101 states and 303290 transitions. Word has length 343 [2025-03-16 14:09:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:09:51,605 INFO L471 AbstractCegarLoop]: Abstraction has 272101 states and 303290 transitions. [2025-03-16 14:09:51,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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-16 14:09:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 272101 states and 303290 transitions. [2025-03-16 14:09:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-16 14:09:51,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:09:51,682 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:09:51,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:09:51,683 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:09:51,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:09:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1775083541, now seen corresponding path program 1 times [2025-03-16 14:09:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:09:51,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507015280] [2025-03-16 14:09:51,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:09:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:09:51,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-16 14:09:51,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-16 14:09:51,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:09:51,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:09:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 14:09:52,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:09:52,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507015280] [2025-03-16 14:09:52,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507015280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:09:52,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:09:52,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:09:52,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267060632] [2025-03-16 14:09:52,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:09:52,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:09:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:09:52,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:09:52,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:09:52,176 INFO L87 Difference]: Start difference. First operand 272101 states and 303290 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 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-16 14:09:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:09:54,389 INFO L93 Difference]: Finished difference Result 773446 states and 862596 transitions. [2025-03-16 14:09:54,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:09:54,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 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 357 [2025-03-16 14:09:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:09:55,144 INFO L225 Difference]: With dead ends: 773446 [2025-03-16 14:09:55,145 INFO L226 Difference]: Without dead ends: 502970 [2025-03-16 14:09:55,268 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-16 14:09:55,269 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 211 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:09:55,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 524 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:09:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502970 states.