./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-back-serstep.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-back-serstep.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash cf781dc2288a00f369934df75df908cdb6dbb08527402be5afe46a5cc4e19cf1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:50:32,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:50:32,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 20:50:32,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:50:32,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:50:32,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:50:32,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:50:32,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:50:32,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:50:32,846 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:50:32,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:50:32,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:50:32,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:50:32,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:50:32,847 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:50:32,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:50:32,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:50:32,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:50:32,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:50:32,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:50:32,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:50:32,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:50:32,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:50:32,847 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:50:32,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:50:32,848 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:50:32,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:50:32,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:50:32,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:50:32,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:50:32,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:50:32,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:50:32,848 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:50:32,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:50:32,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:50:32,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:50:32,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:50:32,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:50:32,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:50:32,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:50:32,849 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf781dc2288a00f369934df75df908cdb6dbb08527402be5afe46a5cc4e19cf1 [2025-03-16 20:50:33,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:50:33,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:50:33,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:50:33,042 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:50:33,042 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:50:33,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-back-serstep.c [2025-03-16 20:50:34,124 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df5c6ef9/7c931a6488764e7da003fb6fd7c5197f/FLAG7a9a4f65a [2025-03-16 20:50:34,397 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:50:34,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-back-serstep.c [2025-03-16 20:50:34,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df5c6ef9/7c931a6488764e7da003fb6fd7c5197f/FLAG7a9a4f65a [2025-03-16 20:50:34,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df5c6ef9/7c931a6488764e7da003fb6fd7c5197f [2025-03-16 20:50:34,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:50:34,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:50:34,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:50:34,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:50:34,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:50:34,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c199b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34, skipping insertion in model container [2025-03-16 20:50:34,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:50:34,830 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/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-back-serstep.c[1174,1187] [2025-03-16 20:50:34,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:50:34,938 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:50:34,944 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/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-back-serstep.c[1174,1187] [2025-03-16 20:50:35,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:50:35,043 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:50:35,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35 WrapperNode [2025-03-16 20:50:35,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:50:35,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:50:35,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:50:35,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:50:35,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (1/1) ... [2025-03-16 20:50:35,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (1/1) ... [2025-03-16 20:50:35,226 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1948 [2025-03-16 20:50:35,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:50:35,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:50:35,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:50:35,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:50:35,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (1/1) ... [2025-03-16 20:50:35,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (1/1) ... [2025-03-16 20:50:35,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (1/1) ... [2025-03-16 20:50:35,305 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 20:50:35,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (1/1) ... [2025-03-16 20:50:35,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (1/1) ... [2025-03-16 20:50:35,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (1/1) ... [2025-03-16 20:50:35,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (1/1) ... [2025-03-16 20:50:35,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (1/1) ... [2025-03-16 20:50:35,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (1/1) ... [2025-03-16 20:50:35,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:50:35,395 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:50:35,395 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:50:35,395 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:50:35,396 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (1/1) ... [2025-03-16 20:50:35,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:50:35,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:35,422 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 20:50:35,426 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 20:50:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:50:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:50:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:50:35,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:50:35,591 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:50:35,592 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:50:37,262 INFO L? ?]: Removed 991 outVars from TransFormulas that were not future-live. [2025-03-16 20:50:37,262 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:50:37,368 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:50:37,369 INFO L336 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-16 20:50:37,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:50:37 BoogieIcfgContainer [2025-03-16 20:50:37,369 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:50:37,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:50:37,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:50:37,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:50:37,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:50:34" (1/3) ... [2025-03-16 20:50:37,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf735c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:50:37, skipping insertion in model container [2025-03-16 20:50:37,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:35" (2/3) ... [2025-03-16 20:50:37,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf735c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:50:37, skipping insertion in model container [2025-03-16 20:50:37,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:50:37" (3/3) ... [2025-03-16 20:50:37,377 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-back-serstep.c [2025-03-16 20:50:37,391 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:50:37,392 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.2.prop1-back-serstep.c that has 1 procedures, 684 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 20:50:37,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:50:37,485 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;@5aceabc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:50:37,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 20:50:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 684 states, 682 states have (on average 1.502932551319648) internal successors, (1025), 683 states have internal predecessors, (1025), 0 states have call successors, (0), 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 20:50:37,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 20:50:37,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:37,503 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] [2025-03-16 20:50:37,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:37,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1139318208, now seen corresponding path program 1 times [2025-03-16 20:50:37,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:37,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855850147] [2025-03-16 20:50:37,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:37,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:37,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:50:37,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:50:37,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:37,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:38,144 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 20:50:38,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:38,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855850147] [2025-03-16 20:50:38,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855850147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:38,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:38,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:38,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342396595] [2025-03-16 20:50:38,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:38,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:38,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:38,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:38,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:38,166 INFO L87 Difference]: Start difference. First operand has 684 states, 682 states have (on average 1.502932551319648) internal successors, (1025), 683 states have internal predecessors, (1025), 0 states have call successors, (0), 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 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:38,531 INFO L93 Difference]: Finished difference Result 1323 states and 1985 transitions. [2025-03-16 20:50:38,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:38,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 20:50:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:38,544 INFO L225 Difference]: With dead ends: 1323 [2025-03-16 20:50:38,544 INFO L226 Difference]: Without dead ends: 684 [2025-03-16 20:50:38,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:38,550 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:38,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2545 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-16 20:50:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2025-03-16 20:50:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.499267935578331) internal successors, (1024), 683 states have internal predecessors, (1024), 0 states have call successors, (0), 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 20:50:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1024 transitions. [2025-03-16 20:50:38,608 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1024 transitions. Word has length 84 [2025-03-16 20:50:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:38,608 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1024 transitions. [2025-03-16 20:50:38,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1024 transitions. [2025-03-16 20:50:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 20:50:38,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:38,612 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] [2025-03-16 20:50:38,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:50:38,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:38,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:38,614 INFO L85 PathProgramCache]: Analyzing trace with hash 963806129, now seen corresponding path program 1 times [2025-03-16 20:50:38,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:38,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092731700] [2025-03-16 20:50:38,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:38,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:38,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:50:38,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:50:38,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:38,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:38,801 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 20:50:38,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:38,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092731700] [2025-03-16 20:50:38,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092731700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:38,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:38,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:38,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247991714] [2025-03-16 20:50:38,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:38,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:38,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:38,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:38,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:38,802 INFO L87 Difference]: Start difference. First operand 684 states and 1024 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:39,086 INFO L93 Difference]: Finished difference Result 1325 states and 1984 transitions. [2025-03-16 20:50:39,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:39,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 20:50:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:39,089 INFO L225 Difference]: With dead ends: 1325 [2025-03-16 20:50:39,089 INFO L226 Difference]: Without dead ends: 686 [2025-03-16 20:50:39,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:39,092 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:39,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-16 20:50:39,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-03-16 20:50:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 1.4978102189781022) internal successors, (1026), 685 states have internal predecessors, (1026), 0 states have call successors, (0), 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 20:50:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1026 transitions. [2025-03-16 20:50:39,108 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1026 transitions. Word has length 85 [2025-03-16 20:50:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:39,108 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1026 transitions. [2025-03-16 20:50:39,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1026 transitions. [2025-03-16 20:50:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:50:39,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:39,110 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] [2025-03-16 20:50:39,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:50:39,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:39,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1744729051, now seen corresponding path program 1 times [2025-03-16 20:50:39,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:39,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646500481] [2025-03-16 20:50:39,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:39,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:39,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:50:39,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:50:39,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:39,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:39,273 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 20:50:39,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:39,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646500481] [2025-03-16 20:50:39,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646500481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:39,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:39,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:39,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778085003] [2025-03-16 20:50:39,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:39,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:39,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:39,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:39,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:39,275 INFO L87 Difference]: Start difference. First operand 686 states and 1026 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:39,534 INFO L93 Difference]: Finished difference Result 1329 states and 1988 transitions. [2025-03-16 20:50:39,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:39,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:50:39,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:39,536 INFO L225 Difference]: With dead ends: 1329 [2025-03-16 20:50:39,536 INFO L226 Difference]: Without dead ends: 688 [2025-03-16 20:50:39,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:39,538 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:39,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-16 20:50:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-03-16 20:50:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.4963609898107715) internal successors, (1028), 687 states have internal predecessors, (1028), 0 states have call successors, (0), 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 20:50:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1028 transitions. [2025-03-16 20:50:39,549 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1028 transitions. Word has length 86 [2025-03-16 20:50:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:39,549 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1028 transitions. [2025-03-16 20:50:39,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1028 transitions. [2025-03-16 20:50:39,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:50:39,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:39,550 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] [2025-03-16 20:50:39,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:50:39,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:39,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:39,551 INFO L85 PathProgramCache]: Analyzing trace with hash 140389142, now seen corresponding path program 1 times [2025-03-16 20:50:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:39,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234010166] [2025-03-16 20:50:39,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:39,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:50:39,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:50:39,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:39,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:39,759 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 20:50:39,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:39,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234010166] [2025-03-16 20:50:39,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234010166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:39,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:39,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:39,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917530937] [2025-03-16 20:50:39,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:39,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:50:39,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:39,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:50:39,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:39,760 INFO L87 Difference]: Start difference. First operand 688 states and 1028 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 20:50:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:40,665 INFO L93 Difference]: Finished difference Result 3002 states and 4489 transitions. [2025-03-16 20:50:40,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:50:40,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 20:50:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:40,669 INFO L225 Difference]: With dead ends: 3002 [2025-03-16 20:50:40,669 INFO L226 Difference]: Without dead ends: 1307 [2025-03-16 20:50:40,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:50:40,671 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 3086 mSDsluCounter, 3085 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3086 SdHoareTripleChecker+Valid, 3930 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:40,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3086 Valid, 3930 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 20:50:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2025-03-16 20:50:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 750. [2025-03-16 20:50:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 1.4953271028037383) internal successors, (1120), 749 states have internal predecessors, (1120), 0 states have call successors, (0), 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 20:50:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1120 transitions. [2025-03-16 20:50:40,688 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1120 transitions. Word has length 87 [2025-03-16 20:50:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:40,688 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1120 transitions. [2025-03-16 20:50:40,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 20:50:40,689 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1120 transitions. [2025-03-16 20:50:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:50:40,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:40,690 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] [2025-03-16 20:50:40,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:50:40,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:40,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1601405188, now seen corresponding path program 1 times [2025-03-16 20:50:40,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:40,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13819225] [2025-03-16 20:50:40,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:40,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:40,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:50:40,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:50:40,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:40,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:40,843 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 20:50:40,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:40,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13819225] [2025-03-16 20:50:40,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13819225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:40,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:40,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507243497] [2025-03-16 20:50:40,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:40,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:40,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:40,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:40,846 INFO L87 Difference]: Start difference. First operand 750 states and 1120 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 20:50:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:41,116 INFO L93 Difference]: Finished difference Result 1395 states and 2084 transitions. [2025-03-16 20:50:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:41,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 20:50:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:41,119 INFO L225 Difference]: With dead ends: 1395 [2025-03-16 20:50:41,119 INFO L226 Difference]: Without dead ends: 752 [2025-03-16 20:50:41,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:41,120 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:41,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-03-16 20:50:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2025-03-16 20:50:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 1.4940079893475366) internal successors, (1122), 751 states have internal predecessors, (1122), 0 states have call successors, (0), 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 20:50:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1122 transitions. [2025-03-16 20:50:41,130 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1122 transitions. Word has length 88 [2025-03-16 20:50:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:41,131 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1122 transitions. [2025-03-16 20:50:41,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 20:50:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1122 transitions. [2025-03-16 20:50:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:50:41,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:41,131 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] [2025-03-16 20:50:41,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:50:41,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:41,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:41,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1196248376, now seen corresponding path program 1 times [2025-03-16 20:50:41,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:41,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010407527] [2025-03-16 20:50:41,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:41,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:41,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:50:41,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:50:41,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:41,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:41,282 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 20:50:41,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:41,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010407527] [2025-03-16 20:50:41,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010407527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:41,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:41,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:41,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980018565] [2025-03-16 20:50:41,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:41,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:41,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:41,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:41,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:41,286 INFO L87 Difference]: Start difference. First operand 752 states and 1122 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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 20:50:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:41,604 INFO L93 Difference]: Finished difference Result 1399 states and 2088 transitions. [2025-03-16 20:50:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:41,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 20:50:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:41,606 INFO L225 Difference]: With dead ends: 1399 [2025-03-16 20:50:41,606 INFO L226 Difference]: Without dead ends: 754 [2025-03-16 20:50:41,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:41,608 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 2537 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:41,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3387 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-16 20:50:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-16 20:50:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.4926958831341302) internal successors, (1124), 753 states have internal predecessors, (1124), 0 states have call successors, (0), 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 20:50:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1124 transitions. [2025-03-16 20:50:41,619 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1124 transitions. Word has length 89 [2025-03-16 20:50:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:41,619 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1124 transitions. [2025-03-16 20:50:41,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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 20:50:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1124 transitions. [2025-03-16 20:50:41,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 20:50:41,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:41,620 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] [2025-03-16 20:50:41,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:50:41,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:41,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1439460329, now seen corresponding path program 1 times [2025-03-16 20:50:41,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:41,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366268808] [2025-03-16 20:50:41,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:41,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 20:50:41,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 20:50:41,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:41,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:41,791 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 20:50:41,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:41,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366268808] [2025-03-16 20:50:41,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366268808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:41,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:41,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:41,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398148453] [2025-03-16 20:50:41,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:41,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:41,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:41,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:41,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:41,793 INFO L87 Difference]: Start difference. First operand 754 states and 1124 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:42,066 INFO L93 Difference]: Finished difference Result 1403 states and 2092 transitions. [2025-03-16 20:50:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 20:50:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:42,068 INFO L225 Difference]: With dead ends: 1403 [2025-03-16 20:50:42,069 INFO L226 Difference]: Without dead ends: 756 [2025-03-16 20:50:42,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:42,070 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:42,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2542 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-03-16 20:50:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2025-03-16 20:50:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.491390728476821) internal successors, (1126), 755 states have internal predecessors, (1126), 0 states have call successors, (0), 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 20:50:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1126 transitions. [2025-03-16 20:50:42,083 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1126 transitions. Word has length 90 [2025-03-16 20:50:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:42,083 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1126 transitions. [2025-03-16 20:50:42,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1126 transitions. [2025-03-16 20:50:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:50:42,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:42,084 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] [2025-03-16 20:50:42,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:50:42,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:42,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:42,085 INFO L85 PathProgramCache]: Analyzing trace with hash -246428061, now seen corresponding path program 1 times [2025-03-16 20:50:42,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:42,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052157313] [2025-03-16 20:50:42,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:42,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:42,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:50:42,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:50:42,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:42,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:42,214 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 20:50:42,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:42,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052157313] [2025-03-16 20:50:42,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052157313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:42,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:42,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:42,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093773403] [2025-03-16 20:50:42,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:42,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:42,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:42,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:42,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:42,215 INFO L87 Difference]: Start difference. First operand 756 states and 1126 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 20:50:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:42,468 INFO L93 Difference]: Finished difference Result 1407 states and 2096 transitions. [2025-03-16 20:50:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:42,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 20:50:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:42,470 INFO L225 Difference]: With dead ends: 1407 [2025-03-16 20:50:42,470 INFO L226 Difference]: Without dead ends: 758 [2025-03-16 20:50:42,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:42,471 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:42,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2537 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-16 20:50:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2025-03-16 20:50:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 1.4900924702774108) internal successors, (1128), 757 states have internal predecessors, (1128), 0 states have call successors, (0), 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 20:50:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1128 transitions. [2025-03-16 20:50:42,482 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1128 transitions. Word has length 91 [2025-03-16 20:50:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:42,482 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1128 transitions. [2025-03-16 20:50:42,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 20:50:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1128 transitions. [2025-03-16 20:50:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 20:50:42,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:42,483 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] [2025-03-16 20:50:42,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:50:42,483 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:42,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:42,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1798524366, now seen corresponding path program 1 times [2025-03-16 20:50:42,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:42,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457122132] [2025-03-16 20:50:42,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:42,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:42,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 20:50:42,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 20:50:42,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:42,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:42,590 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 20:50:42,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:42,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457122132] [2025-03-16 20:50:42,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457122132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:42,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:42,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:42,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779648267] [2025-03-16 20:50:42,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:42,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:42,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:42,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:42,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:42,591 INFO L87 Difference]: Start difference. First operand 758 states and 1128 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:42,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:42,871 INFO L93 Difference]: Finished difference Result 1417 states and 2108 transitions. [2025-03-16 20:50:42,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:42,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-16 20:50:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:42,874 INFO L225 Difference]: With dead ends: 1417 [2025-03-16 20:50:42,875 INFO L226 Difference]: Without dead ends: 766 [2025-03-16 20:50:42,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:42,876 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 3 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:42,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-03-16 20:50:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 762. [2025-03-16 20:50:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 761 states have (on average 1.4901445466491459) internal successors, (1134), 761 states have internal predecessors, (1134), 0 states have call successors, (0), 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 20:50:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1134 transitions. [2025-03-16 20:50:42,889 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1134 transitions. Word has length 92 [2025-03-16 20:50:42,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:42,889 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1134 transitions. [2025-03-16 20:50:42,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1134 transitions. [2025-03-16 20:50:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:50:42,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:42,890 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] [2025-03-16 20:50:42,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:50:42,891 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:42,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:42,893 INFO L85 PathProgramCache]: Analyzing trace with hash -248583426, now seen corresponding path program 1 times [2025-03-16 20:50:42,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:42,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150864074] [2025-03-16 20:50:42,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:42,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:42,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:50:42,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:50:42,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:42,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:42,994 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 20:50:42,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:42,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150864074] [2025-03-16 20:50:42,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150864074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:42,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:42,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:42,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638469453] [2025-03-16 20:50:42,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:42,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:42,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:42,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:42,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:42,996 INFO L87 Difference]: Start difference. First operand 762 states and 1134 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:43,243 INFO L93 Difference]: Finished difference Result 1423 states and 2118 transitions. [2025-03-16 20:50:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:43,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-16 20:50:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:43,245 INFO L225 Difference]: With dead ends: 1423 [2025-03-16 20:50:43,246 INFO L226 Difference]: Without dead ends: 768 [2025-03-16 20:50:43,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:43,247 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 4 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:43,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-03-16 20:50:43,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2025-03-16 20:50:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 1.4889178617992178) internal successors, (1142), 767 states have internal predecessors, (1142), 0 states have call successors, (0), 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 20:50:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1142 transitions. [2025-03-16 20:50:43,256 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1142 transitions. Word has length 93 [2025-03-16 20:50:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:43,257 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1142 transitions. [2025-03-16 20:50:43,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1142 transitions. [2025-03-16 20:50:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 20:50:43,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:43,257 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] [2025-03-16 20:50:43,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:50:43,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:43,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1263250344, now seen corresponding path program 1 times [2025-03-16 20:50:43,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:43,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538293757] [2025-03-16 20:50:43,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:43,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:43,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:50:43,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:50:43,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:43,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:43,364 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 20:50:43,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:43,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538293757] [2025-03-16 20:50:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538293757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:43,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:43,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:43,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111631749] [2025-03-16 20:50:43,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:43,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:43,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:43,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:43,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:43,365 INFO L87 Difference]: Start difference. First operand 768 states and 1142 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:43,619 INFO L93 Difference]: Finished difference Result 1431 states and 2128 transitions. [2025-03-16 20:50:43,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:43,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-16 20:50:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:43,622 INFO L225 Difference]: With dead ends: 1431 [2025-03-16 20:50:43,622 INFO L226 Difference]: Without dead ends: 770 [2025-03-16 20:50:43,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:43,623 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:43,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-16 20:50:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2025-03-16 20:50:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.4876462938881665) internal successors, (1144), 769 states have internal predecessors, (1144), 0 states have call successors, (0), 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 20:50:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1144 transitions. [2025-03-16 20:50:43,635 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1144 transitions. Word has length 94 [2025-03-16 20:50:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:43,635 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1144 transitions. [2025-03-16 20:50:43,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1144 transitions. [2025-03-16 20:50:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 20:50:43,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:43,636 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] [2025-03-16 20:50:43,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:50:43,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:43,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash 41015929, now seen corresponding path program 1 times [2025-03-16 20:50:43,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:43,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085187585] [2025-03-16 20:50:43,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:43,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:43,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 20:50:43,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 20:50:43,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:43,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:43,751 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 20:50:43,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:43,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085187585] [2025-03-16 20:50:43,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085187585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:43,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:43,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220110662] [2025-03-16 20:50:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:43,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:43,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:43,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:43,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:43,753 INFO L87 Difference]: Start difference. First operand 770 states and 1144 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 20:50:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:44,003 INFO L93 Difference]: Finished difference Result 1435 states and 2132 transitions. [2025-03-16 20:50:44,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:44,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-16 20:50:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:44,006 INFO L225 Difference]: With dead ends: 1435 [2025-03-16 20:50:44,006 INFO L226 Difference]: Without dead ends: 772 [2025-03-16 20:50:44,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:44,007 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:44,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2537 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-03-16 20:50:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2025-03-16 20:50:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 1.4863813229571985) internal successors, (1146), 771 states have internal predecessors, (1146), 0 states have call successors, (0), 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 20:50:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1146 transitions. [2025-03-16 20:50:44,018 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1146 transitions. Word has length 95 [2025-03-16 20:50:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:44,018 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1146 transitions. [2025-03-16 20:50:44,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 20:50:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1146 transitions. [2025-03-16 20:50:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 20:50:44,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:44,019 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] [2025-03-16 20:50:44,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:50:44,019 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:44,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash -521951651, now seen corresponding path program 1 times [2025-03-16 20:50:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:44,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64397200] [2025-03-16 20:50:44,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:44,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 20:50:44,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 20:50:44,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:44,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:44,120 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 20:50:44,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:44,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64397200] [2025-03-16 20:50:44,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64397200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:44,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:44,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:44,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912738843] [2025-03-16 20:50:44,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:44,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:44,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:44,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:44,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:44,122 INFO L87 Difference]: Start difference. First operand 772 states and 1146 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 20:50:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:44,366 INFO L93 Difference]: Finished difference Result 1445 states and 2144 transitions. [2025-03-16 20:50:44,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:44,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 20:50:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:44,368 INFO L225 Difference]: With dead ends: 1445 [2025-03-16 20:50:44,369 INFO L226 Difference]: Without dead ends: 780 [2025-03-16 20:50:44,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:44,370 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 3 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:44,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-16 20:50:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 776. [2025-03-16 20:50:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 1.486451612903226) internal successors, (1152), 775 states have internal predecessors, (1152), 0 states have call successors, (0), 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 20:50:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1152 transitions. [2025-03-16 20:50:44,379 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1152 transitions. Word has length 96 [2025-03-16 20:50:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:44,380 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1152 transitions. [2025-03-16 20:50:44,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 20:50:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1152 transitions. [2025-03-16 20:50:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:50:44,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:44,380 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] [2025-03-16 20:50:44,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:50:44,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:44,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1676526324, now seen corresponding path program 1 times [2025-03-16 20:50:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:44,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552438152] [2025-03-16 20:50:44,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:44,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:50:44,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:50:44,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:44,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:44,508 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 20:50:44,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552438152] [2025-03-16 20:50:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552438152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:44,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:44,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500173412] [2025-03-16 20:50:44,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:44,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:44,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:44,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:44,510 INFO L87 Difference]: Start difference. First operand 776 states and 1152 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 20:50:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:44,825 INFO L93 Difference]: Finished difference Result 1449 states and 2150 transitions. [2025-03-16 20:50:44,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:44,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-16 20:50:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:44,827 INFO L225 Difference]: With dead ends: 1449 [2025-03-16 20:50:44,827 INFO L226 Difference]: Without dead ends: 780 [2025-03-16 20:50:44,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:44,828 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 2527 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:44,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3377 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-16 20:50:44,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 776. [2025-03-16 20:50:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 1.486451612903226) internal successors, (1152), 775 states have internal predecessors, (1152), 0 states have call successors, (0), 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 20:50:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1152 transitions. [2025-03-16 20:50:44,838 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1152 transitions. Word has length 97 [2025-03-16 20:50:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:44,838 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1152 transitions. [2025-03-16 20:50:44,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 20:50:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1152 transitions. [2025-03-16 20:50:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 20:50:44,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:44,839 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] [2025-03-16 20:50:44,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:50:44,839 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:44,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash -143893123, now seen corresponding path program 1 times [2025-03-16 20:50:44,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:44,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650584330] [2025-03-16 20:50:44,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:44,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:44,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:50:44,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:50:44,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:44,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:45,062 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 20:50:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650584330] [2025-03-16 20:50:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650584330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:45,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:45,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564850230] [2025-03-16 20:50:45,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:45,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:50:45,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:45,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:50:45,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:45,064 INFO L87 Difference]: Start difference. First operand 776 states and 1152 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 20:50:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:45,580 INFO L93 Difference]: Finished difference Result 1994 states and 2960 transitions. [2025-03-16 20:50:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:50:45,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-16 20:50:45,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:45,584 INFO L225 Difference]: With dead ends: 1994 [2025-03-16 20:50:45,585 INFO L226 Difference]: Without dead ends: 1325 [2025-03-16 20:50:45,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:45,586 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 897 mSDsluCounter, 3326 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 4174 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:45,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 4174 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:50:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-03-16 20:50:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 790. [2025-03-16 20:50:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.4866920152091254) internal successors, (1173), 789 states have internal predecessors, (1173), 0 states have call successors, (0), 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 20:50:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1173 transitions. [2025-03-16 20:50:45,599 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1173 transitions. Word has length 98 [2025-03-16 20:50:45,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:45,599 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1173 transitions. [2025-03-16 20:50:45,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 20:50:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1173 transitions. [2025-03-16 20:50:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 20:50:45,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:45,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:45,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:50:45,603 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:45,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1569502519, now seen corresponding path program 1 times [2025-03-16 20:50:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:45,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741702954] [2025-03-16 20:50:45,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:45,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 20:50:45,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 20:50:45,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:45,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:50:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:46,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741702954] [2025-03-16 20:50:46,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741702954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:46,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:46,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:50:46,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168856021] [2025-03-16 20:50:46,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:46,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:50:46,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:46,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:50:46,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:50:46,375 INFO L87 Difference]: Start difference. First operand 790 states and 1173 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 20:50:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:46,562 INFO L93 Difference]: Finished difference Result 1460 states and 2168 transitions. [2025-03-16 20:50:46,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:50:46,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2025-03-16 20:50:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:46,565 INFO L225 Difference]: With dead ends: 1460 [2025-03-16 20:50:46,565 INFO L226 Difference]: Without dead ends: 791 [2025-03-16 20:50:46,566 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 20:50:46,566 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:46,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1697 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-03-16 20:50:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2025-03-16 20:50:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 1.4860759493670885) internal successors, (1174), 790 states have internal predecessors, (1174), 0 states have call successors, (0), 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 20:50:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1174 transitions. [2025-03-16 20:50:46,579 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1174 transitions. Word has length 403 [2025-03-16 20:50:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:46,579 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1174 transitions. [2025-03-16 20:50:46,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 20:50:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1174 transitions. [2025-03-16 20:50:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 20:50:46,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:46,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:46,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:50:46,584 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:46,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash -145472808, now seen corresponding path program 1 times [2025-03-16 20:50:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:46,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981834535] [2025-03-16 20:50:46,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:46,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:46,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 20:50:46,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 20:50:46,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:46,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:50:47,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:47,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981834535] [2025-03-16 20:50:47,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981834535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:47,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:47,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:50:47,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551421285] [2025-03-16 20:50:47,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:47,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:50:47,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:47,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:50:47,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:50:47,164 INFO L87 Difference]: Start difference. First operand 791 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 20:50:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:47,346 INFO L93 Difference]: Finished difference Result 1462 states and 2170 transitions. [2025-03-16 20:50:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:50:47,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2025-03-16 20:50:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:47,349 INFO L225 Difference]: With dead ends: 1462 [2025-03-16 20:50:47,349 INFO L226 Difference]: Without dead ends: 792 [2025-03-16 20:50:47,350 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 20:50:47,350 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:47,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1697 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-16 20:50:47,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2025-03-16 20:50:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 1.4854614412136535) internal successors, (1175), 791 states have internal predecessors, (1175), 0 states have call successors, (0), 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 20:50:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1175 transitions. [2025-03-16 20:50:47,359 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1175 transitions. Word has length 403 [2025-03-16 20:50:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:47,360 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1175 transitions. [2025-03-16 20:50:47,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 20:50:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1175 transitions. [2025-03-16 20:50:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 20:50:47,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:47,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:47,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:50:47,364 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:47,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:47,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1156882745, now seen corresponding path program 1 times [2025-03-16 20:50:47,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:47,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769801639] [2025-03-16 20:50:47,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:47,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:47,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 20:50:47,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 20:50:47,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:47,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:50:47,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:47,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769801639] [2025-03-16 20:50:47,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769801639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:47,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:47,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:50:47,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150342308] [2025-03-16 20:50:47,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:47,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:50:47,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:47,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:50:47,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:50:47,872 INFO L87 Difference]: Start difference. First operand 792 states and 1175 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 20:50:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:48,058 INFO L93 Difference]: Finished difference Result 1464 states and 2172 transitions. [2025-03-16 20:50:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:50:48,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2025-03-16 20:50:48,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:48,061 INFO L225 Difference]: With dead ends: 1464 [2025-03-16 20:50:48,062 INFO L226 Difference]: Without dead ends: 793 [2025-03-16 20:50:48,062 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 20:50:48,063 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:48,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1697 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-16 20:50:48,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2025-03-16 20:50:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 792 states have (on average 1.4848484848484849) internal successors, (1176), 792 states have internal predecessors, (1176), 0 states have call successors, (0), 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 20:50:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1176 transitions. [2025-03-16 20:50:48,073 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1176 transitions. Word has length 403 [2025-03-16 20:50:48,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:48,074 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1176 transitions. [2025-03-16 20:50:48,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 20:50:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1176 transitions. [2025-03-16 20:50:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 20:50:48,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:48,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:48,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:50:48,078 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:48,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:48,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1930867366, now seen corresponding path program 1 times [2025-03-16 20:50:48,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:48,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128233979] [2025-03-16 20:50:48,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:48,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:48,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 20:50:48,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 20:50:48,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:48,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:50:48,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:48,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128233979] [2025-03-16 20:50:48,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128233979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:48,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:48,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:50:48,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978581962] [2025-03-16 20:50:48,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:48,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:50:48,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:48,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:50:48,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:50:48,616 INFO L87 Difference]: Start difference. First operand 793 states and 1176 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 20:50:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:48,818 INFO L93 Difference]: Finished difference Result 1466 states and 2174 transitions. [2025-03-16 20:50:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:50:48,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2025-03-16 20:50:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:48,821 INFO L225 Difference]: With dead ends: 1466 [2025-03-16 20:50:48,821 INFO L226 Difference]: Without dead ends: 794 [2025-03-16 20:50:48,822 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 20:50:48,822 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:48,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1697 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-03-16 20:50:48,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2025-03-16 20:50:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.484237074401009) internal successors, (1177), 793 states have internal predecessors, (1177), 0 states have call successors, (0), 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 20:50:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1177 transitions. [2025-03-16 20:50:48,836 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1177 transitions. Word has length 403 [2025-03-16 20:50:48,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:48,836 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1177 transitions. [2025-03-16 20:50:48,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 20:50:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1177 transitions. [2025-03-16 20:50:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 20:50:48,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:48,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:48,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:50:48,842 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:48,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash -473770757, now seen corresponding path program 1 times [2025-03-16 20:50:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:48,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016387868] [2025-03-16 20:50:48,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:48,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:48,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 20:50:48,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 20:50:48,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:48,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-16 20:50:49,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:49,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016387868] [2025-03-16 20:50:49,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016387868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:49,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:49,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:49,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963465350] [2025-03-16 20:50:49,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:49,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:49,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:49,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:49,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:49,332 INFO L87 Difference]: Start difference. First operand 794 states and 1177 transitions. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 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 20:50:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:49,574 INFO L93 Difference]: Finished difference Result 1469 states and 2177 transitions. [2025-03-16 20:50:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:49,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 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 403 [2025-03-16 20:50:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:49,577 INFO L225 Difference]: With dead ends: 1469 [2025-03-16 20:50:49,578 INFO L226 Difference]: Without dead ends: 796 [2025-03-16 20:50:49,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:49,581 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 0 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:49,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2540 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-16 20:50:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2025-03-16 20:50:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 1.4830188679245282) internal successors, (1179), 795 states have internal predecessors, (1179), 0 states have call successors, (0), 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 20:50:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1179 transitions. [2025-03-16 20:50:49,594 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1179 transitions. Word has length 403 [2025-03-16 20:50:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:49,595 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1179 transitions. [2025-03-16 20:50:49,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 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 20:50:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1179 transitions. [2025-03-16 20:50:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-16 20:50:49,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:49,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:49,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:50:49,599 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:49,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1832902895, now seen corresponding path program 1 times [2025-03-16 20:50:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:49,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065424961] [2025-03-16 20:50:49,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:49,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:49,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-16 20:50:49,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-16 20:50:49,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:49,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:50:50,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:50,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065424961] [2025-03-16 20:50:50,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065424961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:50,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420909803] [2025-03-16 20:50:50,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:50,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:50,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:50,254 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 20:50:50,256 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 20:50:50,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-16 20:50:50,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-16 20:50:50,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:50,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:50,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 20:50:50,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 20:50:50,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:50:50,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420909803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:50,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:50:50,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-16 20:50:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229334795] [2025-03-16 20:50:50,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:50,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:50:50,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:50,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:50:50,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:50:50,907 INFO L87 Difference]: Start difference. First operand 796 states and 1179 transitions. Second operand has 6 states, 6 states have (on average 65.33333333333333) internal successors, (392), 5 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 20:50:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:51,783 INFO L93 Difference]: Finished difference Result 2028 states and 3002 transitions. [2025-03-16 20:50:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:51,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 65.33333333333333) internal successors, (392), 5 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) Word has length 404 [2025-03-16 20:50:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:51,788 INFO L225 Difference]: With dead ends: 2028 [2025-03-16 20:50:51,788 INFO L226 Difference]: Without dead ends: 1353 [2025-03-16 20:50:51,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:50:51,789 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 910 mSDsluCounter, 2828 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:51,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 3555 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 20:50:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-03-16 20:50:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 798. [2025-03-16 20:50:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 1.480552070263488) internal successors, (1180), 797 states have internal predecessors, (1180), 0 states have call successors, (0), 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 20:50:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1180 transitions. [2025-03-16 20:50:51,801 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1180 transitions. Word has length 404 [2025-03-16 20:50:51,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:51,801 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1180 transitions. [2025-03-16 20:50:51,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.33333333333333) internal successors, (392), 5 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 20:50:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1180 transitions. [2025-03-16 20:50:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-16 20:50:51,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:51,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:51,815 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 20:50:52,005 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,SelfDestructingSolverStorable20 [2025-03-16 20:50:52,005 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:52,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:52,006 INFO L85 PathProgramCache]: Analyzing trace with hash -465012307, now seen corresponding path program 1 times [2025-03-16 20:50:52,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:52,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840805909] [2025-03-16 20:50:52,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:52,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:52,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-16 20:50:52,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-16 20:50:52,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:52,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:50:52,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:52,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840805909] [2025-03-16 20:50:52,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840805909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:52,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629939708] [2025-03-16 20:50:52,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:52,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:52,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:52,661 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 20:50:52,662 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 20:50:52,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-16 20:50:53,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-16 20:50:53,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:53,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:53,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 20:50:53,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 20:50:53,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:50:53,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629939708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:53,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:50:53,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-16 20:50:53,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285668819] [2025-03-16 20:50:53,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:53,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:50:53,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:53,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:50:53,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:50:53,262 INFO L87 Difference]: Start difference. First operand 798 states and 1180 transitions. Second operand has 6 states, 6 states have (on average 66.0) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 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 20:50:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:53,891 INFO L93 Difference]: Finished difference Result 2036 states and 3012 transitions. [2025-03-16 20:50:53,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:53,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 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 405 [2025-03-16 20:50:53,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:53,896 INFO L225 Difference]: With dead ends: 2036 [2025-03-16 20:50:53,896 INFO L226 Difference]: Without dead ends: 1361 [2025-03-16 20:50:53,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:50:53,901 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 1759 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 2934 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:53,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 2934 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:50:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-03-16 20:50:53,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 806. [2025-03-16 20:50:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.4770186335403728) internal successors, (1189), 805 states have internal predecessors, (1189), 0 states have call successors, (0), 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 20:50:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1189 transitions. [2025-03-16 20:50:53,911 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1189 transitions. Word has length 405 [2025-03-16 20:50:53,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:53,912 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1189 transitions. [2025-03-16 20:50:53,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 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 20:50:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1189 transitions. [2025-03-16 20:50:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-16 20:50:53,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:53,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:53,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:50:54,116 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,SelfDestructingSolverStorable21 [2025-03-16 20:50:54,116 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:54,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:54,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1011262624, now seen corresponding path program 1 times [2025-03-16 20:50:54,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:54,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638405986] [2025-03-16 20:50:54,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:54,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:54,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-16 20:50:54,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-16 20:50:54,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:54,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:50:54,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:54,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638405986] [2025-03-16 20:50:54,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638405986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:54,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362580739] [2025-03-16 20:50:54,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:54,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:54,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:54,676 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 20:50:54,678 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 20:50:54,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-16 20:50:55,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-16 20:50:55,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:55,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:55,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-16 20:50:55,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:55,405 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 20:50:55,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:50:55,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362580739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:55,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:50:55,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2025-03-16 20:50:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020814602] [2025-03-16 20:50:55,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:55,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:50:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:55,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:50:55,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:50:55,407 INFO L87 Difference]: Start difference. First operand 806 states and 1189 transitions. Second operand has 10 states, 10 states have (on average 40.6) internal successors, (406), 9 states have internal predecessors, (406), 0 states have call successors, (0), 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 20:50:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:56,221 INFO L93 Difference]: Finished difference Result 1501 states and 2218 transitions. [2025-03-16 20:50:56,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:50:56,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 40.6) internal successors, (406), 9 states have internal predecessors, (406), 0 states have call successors, (0), 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 406 [2025-03-16 20:50:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:56,223 INFO L225 Difference]: With dead ends: 1501 [2025-03-16 20:50:56,223 INFO L226 Difference]: Without dead ends: 826 [2025-03-16 20:50:56,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:50:56,225 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 863 mSDsluCounter, 4521 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 5170 SdHoareTripleChecker+Invalid, 3007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:56,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 5170 Invalid, 3007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 20:50:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-03-16 20:50:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 822. [2025-03-16 20:50:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 1.4750304506699148) internal successors, (1211), 821 states have internal predecessors, (1211), 0 states have call successors, (0), 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 20:50:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1211 transitions. [2025-03-16 20:50:56,237 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1211 transitions. Word has length 406 [2025-03-16 20:50:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:56,238 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1211 transitions. [2025-03-16 20:50:56,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 40.6) internal successors, (406), 9 states have internal predecessors, (406), 0 states have call successors, (0), 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 20:50:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1211 transitions. [2025-03-16 20:50:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-16 20:50:56,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:56,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:56,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 20:50:56,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:56,456 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:56,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1732295007, now seen corresponding path program 1 times [2025-03-16 20:50:56,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:56,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849804573] [2025-03-16 20:50:56,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:56,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:56,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-16 20:50:56,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-16 20:50:56,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:56,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:56,815 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 20:50:56,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:56,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849804573] [2025-03-16 20:50:56,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849804573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:56,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:56,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:56,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017204830] [2025-03-16 20:50:56,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:56,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:56,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:56,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:56,817 INFO L87 Difference]: Start difference. First operand 822 states and 1211 transitions. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 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 20:50:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:57,063 INFO L93 Difference]: Finished difference Result 1516 states and 2237 transitions. [2025-03-16 20:50:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:50:57,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 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 407 [2025-03-16 20:50:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:57,065 INFO L225 Difference]: With dead ends: 1516 [2025-03-16 20:50:57,065 INFO L226 Difference]: Without dead ends: 825 [2025-03-16 20:50:57,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 20:50:57,066 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 8 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:57,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3387 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-03-16 20:50:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 825. [2025-03-16 20:50:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 824 states have (on average 1.4733009708737863) internal successors, (1214), 824 states have internal predecessors, (1214), 0 states have call successors, (0), 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 20:50:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1214 transitions. [2025-03-16 20:50:57,075 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1214 transitions. Word has length 407 [2025-03-16 20:50:57,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:57,075 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1214 transitions. [2025-03-16 20:50:57,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 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 20:50:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1214 transitions. [2025-03-16 20:50:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-16 20:50:57,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:57,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:57,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 20:50:57,077 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:57,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:57,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1338332966, now seen corresponding path program 1 times [2025-03-16 20:50:57,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:57,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591631359] [2025-03-16 20:50:57,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:57,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:57,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-16 20:50:57,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-16 20:50:57,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:57,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:57,447 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 20:50:57,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:57,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591631359] [2025-03-16 20:50:57,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591631359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:57,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:57,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:57,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364244562] [2025-03-16 20:50:57,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:57,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:57,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:57,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:57,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:57,449 INFO L87 Difference]: Start difference. First operand 825 states and 1214 transitions. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 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 20:50:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:57,748 INFO L93 Difference]: Finished difference Result 1967 states and 2889 transitions. [2025-03-16 20:50:57,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:50:57,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 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 407 [2025-03-16 20:50:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:57,751 INFO L225 Difference]: With dead ends: 1967 [2025-03-16 20:50:57,751 INFO L226 Difference]: Without dead ends: 1273 [2025-03-16 20:50:57,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:57,752 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 348 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 3371 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:57,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 3371 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2025-03-16 20:50:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1263. [2025-03-16 20:50:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1262 states have (on average 1.4675118858954042) internal successors, (1852), 1262 states have internal predecessors, (1852), 0 states have call successors, (0), 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 20:50:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1852 transitions. [2025-03-16 20:50:57,763 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1852 transitions. Word has length 407 [2025-03-16 20:50:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:57,764 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1852 transitions. [2025-03-16 20:50:57,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 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 20:50:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1852 transitions. [2025-03-16 20:50:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-16 20:50:57,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:57,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:57,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 20:50:57,766 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:57,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:57,767 INFO L85 PathProgramCache]: Analyzing trace with hash -173645936, now seen corresponding path program 1 times [2025-03-16 20:50:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:57,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436499277] [2025-03-16 20:50:57,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:57,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:57,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-16 20:50:57,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-16 20:50:57,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:57,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:58,148 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 20:50:58,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:58,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436499277] [2025-03-16 20:50:58,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436499277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:58,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:58,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:58,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506594684] [2025-03-16 20:50:58,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:58,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:58,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:58,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:58,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:58,150 INFO L87 Difference]: Start difference. First operand 1263 states and 1852 transitions. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 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 20:50:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:58,424 INFO L93 Difference]: Finished difference Result 3193 states and 4680 transitions. [2025-03-16 20:50:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:50:58,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 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 407 [2025-03-16 20:50:58,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:58,430 INFO L225 Difference]: With dead ends: 3193 [2025-03-16 20:50:58,431 INFO L226 Difference]: Without dead ends: 2123 [2025-03-16 20:50:58,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:58,432 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 338 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 3371 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:58,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 3371 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2025-03-16 20:50:58,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2119. [2025-03-16 20:50:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 2118 states have (on average 1.4636449480642115) internal successors, (3100), 2118 states have internal predecessors, (3100), 0 states have call successors, (0), 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 20:50:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3100 transitions. [2025-03-16 20:50:58,449 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 3100 transitions. Word has length 407 [2025-03-16 20:50:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:58,450 INFO L471 AbstractCegarLoop]: Abstraction has 2119 states and 3100 transitions. [2025-03-16 20:50:58,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 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 20:50:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3100 transitions. [2025-03-16 20:50:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-16 20:50:58,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:58,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:58,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 20:50:58,454 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:58,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:58,455 INFO L85 PathProgramCache]: Analyzing trace with hash -515276241, now seen corresponding path program 1 times [2025-03-16 20:50:58,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:58,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847488881] [2025-03-16 20:50:58,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:58,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:58,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-16 20:50:58,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-16 20:50:58,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:58,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:50:58,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:58,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847488881] [2025-03-16 20:50:58,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847488881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:50:58,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524444824] [2025-03-16 20:50:58,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:58,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:58,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:58,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:50:58,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:50:59,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-16 20:50:59,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-16 20:50:59,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:59,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:59,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 1719 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-16 20:50:59,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:59,525 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 20:50:59,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:50:59,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524444824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:59,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:50:59,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-16 20:50:59,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903359966] [2025-03-16 20:50:59,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:59,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:59,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:59,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:59,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:50:59,527 INFO L87 Difference]: Start difference. First operand 2119 states and 3100 transitions. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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 20:51:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:00,033 INFO L93 Difference]: Finished difference Result 3917 states and 5743 transitions. [2025-03-16 20:51:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:51:00,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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 408 [2025-03-16 20:51:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:00,038 INFO L225 Difference]: With dead ends: 3917 [2025-03-16 20:51:00,038 INFO L226 Difference]: Without dead ends: 2119 [2025-03-16 20:51:00,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:51:00,039 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 918 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:00,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1948 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:51:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2025-03-16 20:51:00,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2119. [2025-03-16 20:51:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 2118 states have (on average 1.4598677998111427) internal successors, (3092), 2118 states have internal predecessors, (3092), 0 states have call successors, (0), 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 20:51:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3092 transitions. [2025-03-16 20:51:00,055 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 3092 transitions. Word has length 408 [2025-03-16 20:51:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:00,055 INFO L471 AbstractCegarLoop]: Abstraction has 2119 states and 3092 transitions. [2025-03-16 20:51:00,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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 20:51:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3092 transitions. [2025-03-16 20:51:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-16 20:51:00,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:00,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:00,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 20:51:00,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-16 20:51:00,259 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:00,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:00,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1641438832, now seen corresponding path program 1 times [2025-03-16 20:51:00,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:00,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384662609] [2025-03-16 20:51:00,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:00,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:00,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-16 20:51:00,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-16 20:51:00,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:00,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:00,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384662609] [2025-03-16 20:51:00,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384662609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:00,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472147460] [2025-03-16 20:51:00,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:00,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:00,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:00,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:00,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:51:00,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-16 20:51:01,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-16 20:51:01,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:01,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:01,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 1723 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 20:51:01,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:01,409 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 20:51:01,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:01,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472147460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:01,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:01,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 20:51:01,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374910122] [2025-03-16 20:51:01,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:01,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:01,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:01,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:01,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:51:01,411 INFO L87 Difference]: Start difference. First operand 2119 states and 3092 transitions. Second operand has 6 states, 6 states have (on average 68.33333333333333) internal successors, (410), 6 states have internal predecessors, (410), 0 states have call successors, (0), 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 20:51:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:01,915 INFO L93 Difference]: Finished difference Result 5879 states and 8532 transitions. [2025-03-16 20:51:01,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:51:01,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.33333333333333) internal successors, (410), 6 states have internal predecessors, (410), 0 states have call successors, (0), 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 410 [2025-03-16 20:51:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:01,921 INFO L225 Difference]: With dead ends: 5879 [2025-03-16 20:51:01,922 INFO L226 Difference]: Without dead ends: 4081 [2025-03-16 20:51:01,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:01,924 INFO L435 NwaCegarLoop]: 1081 mSDtfsCounter, 1055 mSDsluCounter, 2897 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 3978 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:01,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 3978 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:51:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2025-03-16 20:51:01,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 2951. [2025-03-16 20:51:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 2950 states have (on average 1.4440677966101696) internal successors, (4260), 2950 states have internal predecessors, (4260), 0 states have call successors, (0), 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 20:51:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 4260 transitions. [2025-03-16 20:51:01,953 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 4260 transitions. Word has length 410 [2025-03-16 20:51:01,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:01,954 INFO L471 AbstractCegarLoop]: Abstraction has 2951 states and 4260 transitions. [2025-03-16 20:51:01,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.33333333333333) internal successors, (410), 6 states have internal predecessors, (410), 0 states have call successors, (0), 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 20:51:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4260 transitions. [2025-03-16 20:51:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-03-16 20:51:01,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:01,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:01,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:51:02,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-16 20:51:02,162 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:02,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:02,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1452819557, now seen corresponding path program 1 times [2025-03-16 20:51:02,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:02,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652449307] [2025-03-16 20:51:02,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:02,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:02,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-16 20:51:02,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-16 20:51:02,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:02,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:02,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:02,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652449307] [2025-03-16 20:51:02,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652449307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:02,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543374196] [2025-03-16 20:51:02,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:02,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:02,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:02,626 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:02,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:51:02,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-16 20:51:03,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-16 20:51:03,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:03,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:03,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 1726 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 20:51:03,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:51:03,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:03,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543374196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:03,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:03,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-16 20:51:03,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878158880] [2025-03-16 20:51:03,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:03,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:03,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:03,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:03,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:51:03,283 INFO L87 Difference]: Start difference. First operand 2951 states and 4260 transitions. Second operand has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 5 states have internal predecessors, (404), 0 states have call successors, (0), 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 20:51:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:03,934 INFO L93 Difference]: Finished difference Result 7093 states and 10262 transitions. [2025-03-16 20:51:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:51:03,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 5 states have internal predecessors, (404), 0 states have call successors, (0), 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 411 [2025-03-16 20:51:03,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:03,941 INFO L225 Difference]: With dead ends: 7093 [2025-03-16 20:51:03,941 INFO L226 Difference]: Without dead ends: 4631 [2025-03-16 20:51:03,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:03,943 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 1754 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 2934 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:03,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 2934 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:51:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2025-03-16 20:51:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 2999. [2025-03-16 20:51:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2998 states have (on average 1.4396264176117413) internal successors, (4316), 2998 states have internal predecessors, (4316), 0 states have call successors, (0), 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 20:51:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 4316 transitions. [2025-03-16 20:51:03,967 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 4316 transitions. Word has length 411 [2025-03-16 20:51:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:03,967 INFO L471 AbstractCegarLoop]: Abstraction has 2999 states and 4316 transitions. [2025-03-16 20:51:03,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 5 states have internal predecessors, (404), 0 states have call successors, (0), 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 20:51:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 4316 transitions. [2025-03-16 20:51:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-16 20:51:03,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:03,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:03,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 20:51:04,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 20:51:04,172 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:04,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:04,172 INFO L85 PathProgramCache]: Analyzing trace with hash -36034788, now seen corresponding path program 1 times [2025-03-16 20:51:04,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:04,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268165421] [2025-03-16 20:51:04,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:04,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:04,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-16 20:51:04,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-16 20:51:04,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:04,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:04,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268165421] [2025-03-16 20:51:04,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268165421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227576563] [2025-03-16 20:51:04,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:04,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:04,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:04,644 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:04,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 20:51:04,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-16 20:51:05,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-16 20:51:05,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:05,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:05,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-16 20:51:05,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:05,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:05,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227576563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:05,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:05,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2025-03-16 20:51:05,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115650725] [2025-03-16 20:51:05,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:05,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:51:05,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:05,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:51:05,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:51:05,431 INFO L87 Difference]: Start difference. First operand 2999 states and 4316 transitions. Second operand has 10 states, 10 states have (on average 41.2) internal successors, (412), 9 states have internal predecessors, (412), 0 states have call successors, (0), 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 20:51:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:06,299 INFO L93 Difference]: Finished difference Result 5493 states and 7939 transitions. [2025-03-16 20:51:06,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:51:06,300 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 41.2) internal successors, (412), 9 states have internal predecessors, (412), 0 states have call successors, (0), 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 412 [2025-03-16 20:51:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:06,304 INFO L225 Difference]: With dead ends: 5493 [2025-03-16 20:51:06,304 INFO L226 Difference]: Without dead ends: 3031 [2025-03-16 20:51:06,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:51:06,306 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 806 mSDsluCounter, 3890 mSDsCounter, 0 mSdLazyCounter, 2629 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:06,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 4539 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2629 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 20:51:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2025-03-16 20:51:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 3027. [2025-03-16 20:51:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3027 states, 3026 states have (on average 1.439524124256444) internal successors, (4356), 3026 states have internal predecessors, (4356), 0 states have call successors, (0), 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 20:51:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 4356 transitions. [2025-03-16 20:51:06,325 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 4356 transitions. Word has length 412 [2025-03-16 20:51:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:06,326 INFO L471 AbstractCegarLoop]: Abstraction has 3027 states and 4356 transitions. [2025-03-16 20:51:06,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 41.2) internal successors, (412), 9 states have internal predecessors, (412), 0 states have call successors, (0), 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 20:51:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 4356 transitions. [2025-03-16 20:51:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-16 20:51:06,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:06,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:06,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 20:51:06,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:06,530 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:06,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1431042656, now seen corresponding path program 1 times [2025-03-16 20:51:06,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:06,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648629509] [2025-03-16 20:51:06,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:06,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:06,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 20:51:06,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 20:51:06,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:06,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:06,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:06,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648629509] [2025-03-16 20:51:06,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648629509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:06,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:06,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:51:06,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136481685] [2025-03-16 20:51:06,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:06,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:06,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:06,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:06,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:51:06,937 INFO L87 Difference]: Start difference. First operand 3027 states and 4356 transitions. Second operand has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 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 20:51:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:07,284 INFO L93 Difference]: Finished difference Result 5692 states and 8231 transitions. [2025-03-16 20:51:07,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:51:07,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 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 413 [2025-03-16 20:51:07,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:07,290 INFO L225 Difference]: With dead ends: 5692 [2025-03-16 20:51:07,290 INFO L226 Difference]: Without dead ends: 3202 [2025-03-16 20:51:07,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:51:07,292 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 233 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4206 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:07,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 4206 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:51:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2025-03-16 20:51:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3039. [2025-03-16 20:51:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3039 states, 3038 states have (on average 1.4391046741277156) internal successors, (4372), 3038 states have internal predecessors, (4372), 0 states have call successors, (0), 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 20:51:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 4372 transitions. [2025-03-16 20:51:07,319 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 4372 transitions. Word has length 413 [2025-03-16 20:51:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:07,320 INFO L471 AbstractCegarLoop]: Abstraction has 3039 states and 4372 transitions. [2025-03-16 20:51:07,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 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 20:51:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 4372 transitions. [2025-03-16 20:51:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-16 20:51:07,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:07,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:07,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 20:51:07,324 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:07,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:07,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1010884955, now seen corresponding path program 1 times [2025-03-16 20:51:07,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:07,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210309286] [2025-03-16 20:51:07,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:07,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:07,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 20:51:07,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 20:51:07,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:07,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:07,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:07,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210309286] [2025-03-16 20:51:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210309286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:07,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:07,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:07,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979557697] [2025-03-16 20:51:07,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:07,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:51:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:07,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:51:07,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:07,807 INFO L87 Difference]: Start difference. First operand 3039 states and 4372 transitions. Second operand has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 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 20:51:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:08,046 INFO L93 Difference]: Finished difference Result 5544 states and 8008 transitions. [2025-03-16 20:51:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:51:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 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 413 [2025-03-16 20:51:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:08,052 INFO L225 Difference]: With dead ends: 5544 [2025-03-16 20:51:08,052 INFO L226 Difference]: Without dead ends: 3042 [2025-03-16 20:51:08,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 20:51:08,057 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 20 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3379 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:08,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3379 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2025-03-16 20:51:08,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 3042. [2025-03-16 20:51:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 3041 states have (on average 1.4386714896415653) internal successors, (4375), 3041 states have internal predecessors, (4375), 0 states have call successors, (0), 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 20:51:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4375 transitions. [2025-03-16 20:51:08,098 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4375 transitions. Word has length 413 [2025-03-16 20:51:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:08,099 INFO L471 AbstractCegarLoop]: Abstraction has 3042 states and 4375 transitions. [2025-03-16 20:51:08,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 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 20:51:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4375 transitions. [2025-03-16 20:51:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-16 20:51:08,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:08,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:08,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 20:51:08,103 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:08,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash 191557447, now seen corresponding path program 1 times [2025-03-16 20:51:08,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:08,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120212769] [2025-03-16 20:51:08,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:08,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:08,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 20:51:08,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 20:51:08,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:08,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:08,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:08,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120212769] [2025-03-16 20:51:08,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120212769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:08,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:08,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:08,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099240657] [2025-03-16 20:51:08,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:08,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:51:08,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:08,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:51:08,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:08,525 INFO L87 Difference]: Start difference. First operand 3042 states and 4375 transitions. Second operand has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 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 20:51:08,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:08,809 INFO L93 Difference]: Finished difference Result 5747 states and 8304 transitions. [2025-03-16 20:51:08,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:51:08,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 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 413 [2025-03-16 20:51:08,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:08,818 INFO L225 Difference]: With dead ends: 5747 [2025-03-16 20:51:08,818 INFO L226 Difference]: Without dead ends: 3242 [2025-03-16 20:51:08,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:51:08,820 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 265 mSDsluCounter, 2521 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:08,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 3366 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:51:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2025-03-16 20:51:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3060. [2025-03-16 20:51:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3059 states have (on average 1.438705459300425) internal successors, (4401), 3059 states have internal predecessors, (4401), 0 states have call successors, (0), 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 20:51:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 4401 transitions. [2025-03-16 20:51:08,844 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 4401 transitions. Word has length 413 [2025-03-16 20:51:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:08,844 INFO L471 AbstractCegarLoop]: Abstraction has 3060 states and 4401 transitions. [2025-03-16 20:51:08,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 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 20:51:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 4401 transitions. [2025-03-16 20:51:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-16 20:51:08,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:08,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:08,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 20:51:08,849 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:08,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1088640858, now seen corresponding path program 1 times [2025-03-16 20:51:08,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:08,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457606553] [2025-03-16 20:51:08,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:08,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:08,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 20:51:08,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 20:51:08,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:08,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:09,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:09,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457606553] [2025-03-16 20:51:09,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457606553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:09,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:09,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081088801] [2025-03-16 20:51:09,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:09,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:51:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:09,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:51:09,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:09,295 INFO L87 Difference]: Start difference. First operand 3060 states and 4401 transitions. Second operand has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 0 states have call successors, (0), 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 20:51:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:09,700 INFO L93 Difference]: Finished difference Result 5587 states and 8067 transitions. [2025-03-16 20:51:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:51:09,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 0 states have call successors, (0), 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 414 [2025-03-16 20:51:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:09,704 INFO L225 Difference]: With dead ends: 5587 [2025-03-16 20:51:09,704 INFO L226 Difference]: Without dead ends: 3064 [2025-03-16 20:51:09,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 20:51:09,706 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 816 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:09,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1956 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:51:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2025-03-16 20:51:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 3064. [2025-03-16 20:51:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3064 states, 3063 states have (on average 1.4381325497877897) internal successors, (4405), 3063 states have internal predecessors, (4405), 0 states have call successors, (0), 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 20:51:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 4405 transitions. [2025-03-16 20:51:09,724 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 4405 transitions. Word has length 414 [2025-03-16 20:51:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:09,724 INFO L471 AbstractCegarLoop]: Abstraction has 3064 states and 4405 transitions. [2025-03-16 20:51:09,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 0 states have call successors, (0), 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 20:51:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 4405 transitions. [2025-03-16 20:51:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-16 20:51:09,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:09,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:09,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 20:51:09,727 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:09,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1782770926, now seen corresponding path program 1 times [2025-03-16 20:51:09,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:09,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036605890] [2025-03-16 20:51:09,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:09,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:09,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 20:51:09,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 20:51:09,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:09,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:10,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:10,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036605890] [2025-03-16 20:51:10,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036605890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:10,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030425179] [2025-03-16 20:51:10,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:10,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:10,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:10,182 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:10,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 20:51:10,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 20:51:10,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 20:51:10,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:10,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:10,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1733 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-16 20:51:10,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:11,161 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:11,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030425179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:11,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:11,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2025-03-16 20:51:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076904252] [2025-03-16 20:51:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:11,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 20:51:11,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:11,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 20:51:11,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-16 20:51:11,163 INFO L87 Difference]: Start difference. First operand 3064 states and 4405 transitions. Second operand has 13 states, 13 states have (on average 31.846153846153847) internal successors, (414), 13 states have internal predecessors, (414), 0 states have call successors, (0), 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 20:51:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:12,151 INFO L93 Difference]: Finished difference Result 8093 states and 11718 transitions. [2025-03-16 20:51:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:51:12,151 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 31.846153846153847) internal successors, (414), 13 states have internal predecessors, (414), 0 states have call successors, (0), 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 414 [2025-03-16 20:51:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:12,156 INFO L225 Difference]: With dead ends: 8093 [2025-03-16 20:51:12,156 INFO L226 Difference]: Without dead ends: 5566 [2025-03-16 20:51:12,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-16 20:51:12,158 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 2217 mSDsluCounter, 4020 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2217 SdHoareTripleChecker+Valid, 5029 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:12,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2217 Valid, 5029 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 20:51:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5566 states. [2025-03-16 20:51:12,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5566 to 3988. [2025-03-16 20:51:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 3987 states have (on average 1.4288939051918736) internal successors, (5697), 3987 states have internal predecessors, (5697), 0 states have call successors, (0), 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 20:51:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 5697 transitions. [2025-03-16 20:51:12,193 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 5697 transitions. Word has length 414 [2025-03-16 20:51:12,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:12,193 INFO L471 AbstractCegarLoop]: Abstraction has 3988 states and 5697 transitions. [2025-03-16 20:51:12,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 31.846153846153847) internal successors, (414), 13 states have internal predecessors, (414), 0 states have call successors, (0), 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 20:51:12,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 5697 transitions. [2025-03-16 20:51:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-16 20:51:12,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:12,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:12,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 20:51:12,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-16 20:51:12,400 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:12,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash 822923623, now seen corresponding path program 1 times [2025-03-16 20:51:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:12,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486963958] [2025-03-16 20:51:12,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:12,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 20:51:12,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 20:51:12,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:12,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:12,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486963958] [2025-03-16 20:51:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486963958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305504008] [2025-03-16 20:51:12,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:12,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:12,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:12,838 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:12,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 20:51:13,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 20:51:13,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 20:51:13,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:13,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:13,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 1733 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 20:51:13,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:13,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:13,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305504008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:13,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:13,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 20:51:13,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504797521] [2025-03-16 20:51:13,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:13,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:13,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:13,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:13,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:51:13,739 INFO L87 Difference]: Start difference. First operand 3988 states and 5697 transitions. Second operand has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 0 states have call successors, (0), 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 20:51:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:14,364 INFO L93 Difference]: Finished difference Result 8042 states and 11582 transitions. [2025-03-16 20:51:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:51:14,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 0 states have call successors, (0), 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 414 [2025-03-16 20:51:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:14,369 INFO L225 Difference]: With dead ends: 8042 [2025-03-16 20:51:14,369 INFO L226 Difference]: Without dead ends: 4783 [2025-03-16 20:51:14,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:14,372 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 1428 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:14,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 2635 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:51:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2025-03-16 20:51:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4781. [2025-03-16 20:51:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4781 states, 4780 states have (on average 1.4389121338912134) internal successors, (6878), 4780 states have internal predecessors, (6878), 0 states have call successors, (0), 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 20:51:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4781 states to 4781 states and 6878 transitions. [2025-03-16 20:51:14,406 INFO L78 Accepts]: Start accepts. Automaton has 4781 states and 6878 transitions. Word has length 414 [2025-03-16 20:51:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:14,407 INFO L471 AbstractCegarLoop]: Abstraction has 4781 states and 6878 transitions. [2025-03-16 20:51:14,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 0 states have call successors, (0), 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 20:51:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4781 states and 6878 transitions. [2025-03-16 20:51:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-16 20:51:14,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:14,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:14,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 20:51:14,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-16 20:51:14,613 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:14,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1493910027, now seen corresponding path program 1 times [2025-03-16 20:51:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:14,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592577025] [2025-03-16 20:51:14,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:14,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-16 20:51:14,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-16 20:51:14,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:14,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:15,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:15,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592577025] [2025-03-16 20:51:15,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592577025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:15,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097945883] [2025-03-16 20:51:15,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:15,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:15,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:15,059 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:15,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 20:51:15,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-16 20:51:15,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-16 20:51:15,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:15,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:15,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1736 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 20:51:15,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:15,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:15,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097945883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:15,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:15,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 20:51:15,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888514975] [2025-03-16 20:51:15,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:15,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:15,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:15,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:15,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:51:15,772 INFO L87 Difference]: Start difference. First operand 4781 states and 6878 transitions. Second operand has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 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 20:51:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:16,409 INFO L93 Difference]: Finished difference Result 13437 states and 19328 transitions. [2025-03-16 20:51:16,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:51:16,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 415 [2025-03-16 20:51:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:16,418 INFO L225 Difference]: With dead ends: 13437 [2025-03-16 20:51:16,418 INFO L226 Difference]: Without dead ends: 9385 [2025-03-16 20:51:16,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:16,423 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 599 mSDsluCounter, 2980 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 3759 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:16,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 3759 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:51:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9385 states. [2025-03-16 20:51:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9385 to 7237. [2025-03-16 20:51:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7237 states, 7236 states have (on average 1.4231619679380874) internal successors, (10298), 7236 states have internal predecessors, (10298), 0 states have call successors, (0), 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 20:51:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7237 states to 7237 states and 10298 transitions. [2025-03-16 20:51:16,494 INFO L78 Accepts]: Start accepts. Automaton has 7237 states and 10298 transitions. Word has length 415 [2025-03-16 20:51:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:16,494 INFO L471 AbstractCegarLoop]: Abstraction has 7237 states and 10298 transitions. [2025-03-16 20:51:16,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 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 20:51:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 7237 states and 10298 transitions. [2025-03-16 20:51:16,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-16 20:51:16,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:16,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:16,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 20:51:16,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-16 20:51:16,703 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:16,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:16,704 INFO L85 PathProgramCache]: Analyzing trace with hash -36778406, now seen corresponding path program 1 times [2025-03-16 20:51:16,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:16,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807464151] [2025-03-16 20:51:16,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:16,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:16,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-16 20:51:16,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-16 20:51:16,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:16,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:17,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:17,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807464151] [2025-03-16 20:51:17,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807464151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:17,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388273532] [2025-03-16 20:51:17,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:17,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:17,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:17,155 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:17,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 20:51:17,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-16 20:51:17,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-16 20:51:17,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:17,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:17,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1739 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 20:51:17,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:18,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:18,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388273532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:18,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:18,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 20:51:18,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431027076] [2025-03-16 20:51:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:18,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:18,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:18,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:18,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:51:18,071 INFO L87 Difference]: Start difference. First operand 7237 states and 10298 transitions. Second operand has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 0 states have call successors, (0), 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 20:51:18,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:18,729 INFO L93 Difference]: Finished difference Result 14953 states and 21477 transitions. [2025-03-16 20:51:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:51:18,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 0 states have call successors, (0), 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 416 [2025-03-16 20:51:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:18,735 INFO L225 Difference]: With dead ends: 14953 [2025-03-16 20:51:18,736 INFO L226 Difference]: Without dead ends: 9037 [2025-03-16 20:51:18,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:18,741 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 1488 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:18,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 2588 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:51:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9037 states. [2025-03-16 20:51:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9037 to 9033. [2025-03-16 20:51:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9033 states, 9032 states have (on average 1.4348981399468557) internal successors, (12960), 9032 states have internal predecessors, (12960), 0 states have call successors, (0), 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 20:51:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9033 states to 9033 states and 12960 transitions. [2025-03-16 20:51:18,810 INFO L78 Accepts]: Start accepts. Automaton has 9033 states and 12960 transitions. Word has length 416 [2025-03-16 20:51:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:18,810 INFO L471 AbstractCegarLoop]: Abstraction has 9033 states and 12960 transitions. [2025-03-16 20:51:18,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 0 states have call successors, (0), 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 20:51:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9033 states and 12960 transitions. [2025-03-16 20:51:18,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-16 20:51:18,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:18,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:18,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-16 20:51:19,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-16 20:51:19,022 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:19,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1934731365, now seen corresponding path program 1 times [2025-03-16 20:51:19,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:19,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006858976] [2025-03-16 20:51:19,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:19,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:19,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-16 20:51:19,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-16 20:51:19,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:19,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:19,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:19,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006858976] [2025-03-16 20:51:19,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006858976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:19,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755739519] [2025-03-16 20:51:19,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:19,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:19,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:19,454 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:19,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 20:51:19,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-16 20:51:20,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-16 20:51:20,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:20,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:20,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 1739 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 20:51:20,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:20,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:20,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755739519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:20,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:20,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 20:51:20,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282788148] [2025-03-16 20:51:20,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:20,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:20,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:20,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:20,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:51:20,215 INFO L87 Difference]: Start difference. First operand 9033 states and 12960 transitions. Second operand has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 0 states have call successors, (0), 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 20:51:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:20,846 INFO L93 Difference]: Finished difference Result 25031 states and 35990 transitions. [2025-03-16 20:51:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:51:20,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 0 states have call successors, (0), 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 416 [2025-03-16 20:51:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:20,863 INFO L225 Difference]: With dead ends: 25031 [2025-03-16 20:51:20,863 INFO L226 Difference]: Without dead ends: 17319 [2025-03-16 20:51:20,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:20,873 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 1533 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:20,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 2590 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:51:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17319 states. [2025-03-16 20:51:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17319 to 14289. [2025-03-16 20:51:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14289 states, 14288 states have (on average 1.4204927211646137) internal successors, (20296), 14288 states have internal predecessors, (20296), 0 states have call successors, (0), 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 20:51:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14289 states to 14289 states and 20296 transitions. [2025-03-16 20:51:21,061 INFO L78 Accepts]: Start accepts. Automaton has 14289 states and 20296 transitions. Word has length 416 [2025-03-16 20:51:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:21,061 INFO L471 AbstractCegarLoop]: Abstraction has 14289 states and 20296 transitions. [2025-03-16 20:51:21,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 0 states have call successors, (0), 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 20:51:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 14289 states and 20296 transitions. [2025-03-16 20:51:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-16 20:51:21,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:21,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-16 20:51:21,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-16 20:51:21,280 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:21,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:21,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1656841962, now seen corresponding path program 1 times [2025-03-16 20:51:21,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:21,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269398538] [2025-03-16 20:51:21,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:21,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-16 20:51:21,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-16 20:51:21,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:21,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:21,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:21,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269398538] [2025-03-16 20:51:21,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269398538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:21,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874058948] [2025-03-16 20:51:21,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:21,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:21,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:21,776 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:21,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-16 20:51:22,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-16 20:51:22,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-16 20:51:22,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:22,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:22,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 1739 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 20:51:22,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:22,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:22,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874058948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:22,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:22,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 20:51:22,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071763099] [2025-03-16 20:51:22,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:22,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:22,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:22,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:22,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:51:22,764 INFO L87 Difference]: Start difference. First operand 14289 states and 20296 transitions. Second operand has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 0 states have call successors, (0), 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 20:51:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:23,423 INFO L93 Difference]: Finished difference Result 29187 states and 41855 transitions. [2025-03-16 20:51:23,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:51:23,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 0 states have call successors, (0), 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 416 [2025-03-16 20:51:23,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:23,440 INFO L225 Difference]: With dead ends: 29187 [2025-03-16 20:51:23,440 INFO L226 Difference]: Without dead ends: 17275 [2025-03-16 20:51:23,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:23,452 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 1199 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 2587 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:23,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 2587 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:51:23,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17275 states. [2025-03-16 20:51:23,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17275 to 17271. [2025-03-16 20:51:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17271 states, 17270 states have (on average 1.4320787492762015) internal successors, (24732), 17270 states have internal predecessors, (24732), 0 states have call successors, (0), 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 20:51:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17271 states to 17271 states and 24732 transitions. [2025-03-16 20:51:23,586 INFO L78 Accepts]: Start accepts. Automaton has 17271 states and 24732 transitions. Word has length 416 [2025-03-16 20:51:23,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:23,586 INFO L471 AbstractCegarLoop]: Abstraction has 17271 states and 24732 transitions. [2025-03-16 20:51:23,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.33333333333333) internal successors, (416), 6 states have internal predecessors, (416), 0 states have call successors, (0), 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 20:51:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 17271 states and 24732 transitions. [2025-03-16 20:51:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-16 20:51:23,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:23,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:23,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-16 20:51:23,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-16 20:51:23,803 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:23,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1079480194, now seen corresponding path program 1 times [2025-03-16 20:51:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:23,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550430594] [2025-03-16 20:51:23,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:23,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:23,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-16 20:51:23,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-16 20:51:23,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:23,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:24,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:24,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550430594] [2025-03-16 20:51:24,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550430594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:24,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423672760] [2025-03-16 20:51:24,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:24,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:24,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:24,232 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:24,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-16 20:51:24,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-16 20:51:24,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-16 20:51:24,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:24,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:24,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 1742 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-16 20:51:24,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:25,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:51:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 55 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423672760] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:51:26,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:51:26,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 23, 19] total 44 [2025-03-16 20:51:26,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769489512] [2025-03-16 20:51:26,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:51:26,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-16 20:51:26,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:26,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-16 20:51:26,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1723, Unknown=0, NotChecked=0, Total=1892 [2025-03-16 20:51:26,913 INFO L87 Difference]: Start difference. First operand 17271 states and 24732 transitions. Second operand has 44 states, 44 states have (on average 22.386363636363637) internal successors, (985), 44 states have internal predecessors, (985), 0 states have call successors, (0), 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 20:51:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:49,328 INFO L93 Difference]: Finished difference Result 294735 states and 432034 transitions. [2025-03-16 20:51:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 282 states. [2025-03-16 20:51:49,329 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 22.386363636363637) internal successors, (985), 44 states have internal predecessors, (985), 0 states have call successors, (0), 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 417 [2025-03-16 20:51:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:49,563 INFO L225 Difference]: With dead ends: 294735 [2025-03-16 20:51:49,563 INFO L226 Difference]: Without dead ends: 249109 [2025-03-16 20:51:49,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1101 GetRequests, 810 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32594 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5647, Invalid=79909, Unknown=0, NotChecked=0, Total=85556 [2025-03-16 20:51:49,618 INFO L435 NwaCegarLoop]: 3148 mSDtfsCounter, 21060 mSDsluCounter, 88831 mSDsCounter, 0 mSdLazyCounter, 44919 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21060 SdHoareTripleChecker+Valid, 91979 SdHoareTripleChecker+Invalid, 45087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 44919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:49,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21060 Valid, 91979 Invalid, 45087 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [168 Valid, 44919 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2025-03-16 20:51:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249109 states. [2025-03-16 20:51:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249109 to 65515. [2025-03-16 20:51:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65515 states, 65514 states have (on average 1.4512317977836797) internal successors, (95076), 65514 states have internal predecessors, (95076), 0 states have call successors, (0), 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 20:51:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65515 states to 65515 states and 95076 transitions. [2025-03-16 20:51:50,956 INFO L78 Accepts]: Start accepts. Automaton has 65515 states and 95076 transitions. Word has length 417 [2025-03-16 20:51:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:50,957 INFO L471 AbstractCegarLoop]: Abstraction has 65515 states and 95076 transitions. [2025-03-16 20:51:50,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 22.386363636363637) internal successors, (985), 44 states have internal predecessors, (985), 0 states have call successors, (0), 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 20:51:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 65515 states and 95076 transitions. [2025-03-16 20:51:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-03-16 20:51:51,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:51,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:51,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-16 20:51:51,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:51,218 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:51,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1800081955, now seen corresponding path program 1 times [2025-03-16 20:51:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269300423] [2025-03-16 20:51:51,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:51,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-16 20:51:51,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-16 20:51:51,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:51,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269300423] [2025-03-16 20:51:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269300423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436810304] [2025-03-16 20:51:51,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:51,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:51,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:51,655 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:51,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-16 20:51:52,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-16 20:51:52,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-16 20:51:52,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:52,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:52,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 1745 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-16 20:51:52,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:53,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:53,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436810304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:53,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:53,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2025-03-16 20:51:53,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119951818] [2025-03-16 20:51:53,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:53,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 20:51:53,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:53,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 20:51:53,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:51:53,702 INFO L87 Difference]: Start difference. First operand 65515 states and 95076 transitions. Second operand has 15 states, 15 states have (on average 27.866666666666667) internal successors, (418), 15 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)