./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.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.sw_ball2004_1.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 4c7460e797ab98c965c0146dc16cfd1742d13d580f8dc4b4e90e3d1aa36d777a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:36:34,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:36:34,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:36:34,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:36:34,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:36:34,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:36:34,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:36:34,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:36:34,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:36:34,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:36:34,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:36:34,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:36:34,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:36:34,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:36:34,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:36:34,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:36:34,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:36:34,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:36:34,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:36:34,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:36:34,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:36:34,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:36:34,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:36:34,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:36:34,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:36:34,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:36:34,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:36:34,781 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 -> 4c7460e797ab98c965c0146dc16cfd1742d13d580f8dc4b4e90e3d1aa36d777a [2025-03-16 22:36:34,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:36:35,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:36:35,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:36:35,009 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:36:35,010 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:36:35,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c [2025-03-16 22:36:36,132 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df942095c/c68d5b05f7df404ebfd8f054f6153ca6/FLAG659bee046 [2025-03-16 22:36:36,369 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:36:36,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c [2025-03-16 22:36:36,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df942095c/c68d5b05f7df404ebfd8f054f6153ca6/FLAG659bee046 [2025-03-16 22:36:36,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df942095c/c68d5b05f7df404ebfd8f054f6153ca6 [2025-03-16 22:36:36,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:36:36,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:36:36,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:36:36,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:36:36,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:36:36,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:36,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fa84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36, skipping insertion in model container [2025-03-16 22:36:36,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:36,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:36:36,817 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.sw_ball2004_1.c[1253,1266] [2025-03-16 22:36:36,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:36:36,897 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:36:36,903 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.sw_ball2004_1.c[1253,1266] [2025-03-16 22:36:36,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:36:36,956 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:36:36,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36 WrapperNode [2025-03-16 22:36:36,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:36:36,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:36:36,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:36:36,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:36:36,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:36,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:37,039 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 650 [2025-03-16 22:36:37,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:36:37,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:36:37,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:36:37,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:36:37,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:37,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:37,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:37,099 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 22:36:37,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:37,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:37,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:37,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:37,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:37,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:37,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:36:37,163 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:36:37,163 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:36:37,164 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:36:37,164 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (1/1) ... [2025-03-16 22:36:37,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:36:37,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:36:37,191 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 22:36:37,194 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 22:36:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:36:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:36:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:36:37,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:36:37,304 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:36:37,306 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:36:38,015 INFO L? ?]: Removed 392 outVars from TransFormulas that were not future-live. [2025-03-16 22:36:38,016 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:36:38,067 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:36:38,068 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:36:38,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:36:38 BoogieIcfgContainer [2025-03-16 22:36:38,068 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:36:38,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:36:38,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:36:38,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:36:38,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:36:36" (1/3) ... [2025-03-16 22:36:38,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25403c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:36:38, skipping insertion in model container [2025-03-16 22:36:38,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:36:36" (2/3) ... [2025-03-16 22:36:38,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25403c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:36:38, skipping insertion in model container [2025-03-16 22:36:38,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:36:38" (3/3) ... [2025-03-16 22:36:38,078 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_ball2004_1.c [2025-03-16 22:36:38,089 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:36:38,090 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_ball2004_1.c that has 1 procedures, 192 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:36:38,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:36:38,144 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;@7ae0d24e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:36:38,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:36:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 190 states have (on average 1.5) internal successors, (285), 191 states have internal predecessors, (285), 0 states have call successors, (0), 0 states 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 22:36:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 22:36:38,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:38,154 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] [2025-03-16 22:36:38,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:38,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1620371225, now seen corresponding path program 1 times [2025-03-16 22:36:38,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:38,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950326998] [2025-03-16 22:36:38,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:38,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 22:36:38,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 22:36:38,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:38,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:38,558 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 22:36:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950326998] [2025-03-16 22:36:38,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950326998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:38,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:38,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:38,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239688678] [2025-03-16 22:36:38,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:38,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:36:38,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:38,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:36:38,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:36:38,576 INFO L87 Difference]: Start difference. First operand has 192 states, 190 states have (on average 1.5) internal successors, (285), 191 states have internal predecessors, (285), 0 states have call successors, (0), 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 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 22:36:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:38,728 INFO L93 Difference]: Finished difference Result 347 states and 517 transitions. [2025-03-16 22:36:38,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:36:38,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-16 22:36:38,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:38,740 INFO L225 Difference]: With dead ends: 347 [2025-03-16 22:36:38,740 INFO L226 Difference]: Without dead ends: 192 [2025-03-16 22:36:38,744 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 22:36:38,754 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:38,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 697 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:36:38,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-16 22:36:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-03-16 22:36:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.486910994764398) internal successors, (284), 191 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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 22:36:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 284 transitions. [2025-03-16 22:36:38,787 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 284 transitions. Word has length 26 [2025-03-16 22:36:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:38,788 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 284 transitions. [2025-03-16 22:36:38,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 22:36:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 284 transitions. [2025-03-16 22:36:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 22:36:38,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:38,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:38,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:36:38,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:38,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1312778965, now seen corresponding path program 1 times [2025-03-16 22:36:38,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:38,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730339058] [2025-03-16 22:36:38,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:38,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:38,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 22:36:38,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 22:36:38,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:38,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:38,913 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 22:36:38,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:38,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730339058] [2025-03-16 22:36:38,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730339058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:38,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:38,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:38,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304702568] [2025-03-16 22:36:38,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:38,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:36:38,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:38,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:36:38,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:36:38,916 INFO L87 Difference]: Start difference. First operand 192 states and 284 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 22:36:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:39,014 INFO L93 Difference]: Finished difference Result 349 states and 516 transitions. [2025-03-16 22:36:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:36:39,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-16 22:36:39,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:39,016 INFO L225 Difference]: With dead ends: 349 [2025-03-16 22:36:39,016 INFO L226 Difference]: Without dead ends: 194 [2025-03-16 22:36:39,016 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 22:36:39,017 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:39,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 694 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:36:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-16 22:36:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-16 22:36:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4818652849740932) internal successors, (286), 193 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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 22:36:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2025-03-16 22:36:39,025 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 27 [2025-03-16 22:36:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:39,026 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2025-03-16 22:36:39,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 22:36:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2025-03-16 22:36:39,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 22:36:39,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:39,029 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] [2025-03-16 22:36:39,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:36:39,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:39,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:39,029 INFO L85 PathProgramCache]: Analyzing trace with hash -322015582, now seen corresponding path program 1 times [2025-03-16 22:36:39,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:39,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603883277] [2025-03-16 22:36:39,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:39,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:39,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 22:36:39,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 22:36:39,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:39,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:39,195 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 22:36:39,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603883277] [2025-03-16 22:36:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603883277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:39,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825527314] [2025-03-16 22:36:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:39,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:39,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:39,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:39,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:39,196 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:39,366 INFO L93 Difference]: Finished difference Result 482 states and 711 transitions. [2025-03-16 22:36:39,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:39,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-16 22:36:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:39,370 INFO L225 Difference]: With dead ends: 482 [2025-03-16 22:36:39,370 INFO L226 Difference]: Without dead ends: 325 [2025-03-16 22:36:39,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:39,373 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 649 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:39,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 672 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:36:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-16 22:36:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 196. [2025-03-16 22:36:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.476923076923077) internal successors, (288), 195 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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 22:36:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 288 transitions. [2025-03-16 22:36:39,389 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 288 transitions. Word has length 28 [2025-03-16 22:36:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:39,389 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 288 transitions. [2025-03-16 22:36:39,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 288 transitions. [2025-03-16 22:36:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 22:36:39,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:39,391 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:39,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:36:39,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:39,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:39,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2049137952, now seen corresponding path program 1 times [2025-03-16 22:36:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:39,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876178458] [2025-03-16 22:36:39,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:39,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:39,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 22:36:39,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 22:36:39,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:39,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:40,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876178458] [2025-03-16 22:36:40,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876178458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:40,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:40,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:40,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850425230] [2025-03-16 22:36:40,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:40,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:40,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:40,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:40,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:40,163 INFO L87 Difference]: Start difference. First operand 196 states and 288 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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 22:36:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:40,368 INFO L93 Difference]: Finished difference Result 474 states and 698 transitions. [2025-03-16 22:36:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:40,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-16 22:36:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:40,370 INFO L225 Difference]: With dead ends: 474 [2025-03-16 22:36:40,371 INFO L226 Difference]: Without dead ends: 317 [2025-03-16 22:36:40,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:40,373 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 597 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:40,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 665 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:36:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-16 22:36:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 243. [2025-03-16 22:36:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 1.4669421487603307) internal successors, (355), 242 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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 22:36:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 355 transitions. [2025-03-16 22:36:40,386 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 355 transitions. Word has length 105 [2025-03-16 22:36:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:40,386 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 355 transitions. [2025-03-16 22:36:40,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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 22:36:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 355 transitions. [2025-03-16 22:36:40,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 22:36:40,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:40,388 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:40,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:36:40,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:40,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash 377778902, now seen corresponding path program 1 times [2025-03-16 22:36:40,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:40,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738799092] [2025-03-16 22:36:40,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:40,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 22:36:40,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 22:36:40,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:40,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:41,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738799092] [2025-03-16 22:36:41,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738799092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:41,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:41,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:41,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842569484] [2025-03-16 22:36:41,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:41,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:41,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:41,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:41,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:41,061 INFO L87 Difference]: Start difference. First operand 243 states and 355 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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 22:36:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:41,227 INFO L93 Difference]: Finished difference Result 474 states and 696 transitions. [2025-03-16 22:36:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:41,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-16 22:36:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:41,229 INFO L225 Difference]: With dead ends: 474 [2025-03-16 22:36:41,230 INFO L226 Difference]: Without dead ends: 317 [2025-03-16 22:36:41,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:41,230 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 575 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:41,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 664 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:36:41,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-16 22:36:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 278. [2025-03-16 22:36:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.4657039711191335) internal successors, (406), 277 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 22:36:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 406 transitions. [2025-03-16 22:36:41,236 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 406 transitions. Word has length 107 [2025-03-16 22:36:41,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:41,237 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 406 transitions. [2025-03-16 22:36:41,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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 22:36:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 406 transitions. [2025-03-16 22:36:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 22:36:41,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:41,238 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:41,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:36:41,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:41,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:41,239 INFO L85 PathProgramCache]: Analyzing trace with hash -156017539, now seen corresponding path program 1 times [2025-03-16 22:36:41,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:41,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443372708] [2025-03-16 22:36:41,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:41,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:41,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 22:36:41,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 22:36:41,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:41,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:41,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443372708] [2025-03-16 22:36:41,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443372708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:41,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:41,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:41,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69640277] [2025-03-16 22:36:41,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:41,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:41,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:41,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:41,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:41,747 INFO L87 Difference]: Start difference. First operand 278 states and 406 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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 22:36:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:41,906 INFO L93 Difference]: Finished difference Result 532 states and 779 transitions. [2025-03-16 22:36:41,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:41,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 22:36:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:41,908 INFO L225 Difference]: With dead ends: 532 [2025-03-16 22:36:41,908 INFO L226 Difference]: Without dead ends: 317 [2025-03-16 22:36:41,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:41,909 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 603 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:41,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 671 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:36:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-16 22:36:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 278. [2025-03-16 22:36:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.4584837545126355) internal successors, (404), 277 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 22:36:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 404 transitions. [2025-03-16 22:36:41,920 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 404 transitions. Word has length 108 [2025-03-16 22:36:41,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:41,920 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 404 transitions. [2025-03-16 22:36:41,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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 22:36:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 404 transitions. [2025-03-16 22:36:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 22:36:41,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:41,921 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:41,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:36:41,922 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:41,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1003082192, now seen corresponding path program 1 times [2025-03-16 22:36:41,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:41,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357938434] [2025-03-16 22:36:41,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:41,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:41,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 22:36:42,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 22:36:42,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:42,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:42,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:42,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357938434] [2025-03-16 22:36:42,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357938434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:42,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:42,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:42,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696608926] [2025-03-16 22:36:42,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:42,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:42,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:42,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:42,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:42,465 INFO L87 Difference]: Start difference. First operand 278 states and 404 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 22:36:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:42,645 INFO L93 Difference]: Finished difference Result 474 states and 693 transitions. [2025-03-16 22:36:42,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:42,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-16 22:36:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:42,646 INFO L225 Difference]: With dead ends: 474 [2025-03-16 22:36:42,646 INFO L226 Difference]: Without dead ends: 317 [2025-03-16 22:36:42,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:42,647 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 556 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:42,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 664 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:36:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-16 22:36:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 298. [2025-03-16 22:36:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4579124579124578) internal successors, (433), 297 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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 22:36:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 433 transitions. [2025-03-16 22:36:42,653 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 433 transitions. Word has length 110 [2025-03-16 22:36:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:42,653 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 433 transitions. [2025-03-16 22:36:42,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 22:36:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 433 transitions. [2025-03-16 22:36:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 22:36:42,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:42,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:42,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:36:42,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:42,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:42,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1939766500, now seen corresponding path program 1 times [2025-03-16 22:36:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:42,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877931085] [2025-03-16 22:36:42,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:42,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 22:36:42,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 22:36:42,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:42,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:43,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:43,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877931085] [2025-03-16 22:36:43,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877931085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:43,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:43,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:36:43,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881214435] [2025-03-16 22:36:43,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:43,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:36:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:43,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:36:43,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:43,142 INFO L87 Difference]: Start difference. First operand 298 states and 433 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 22:36:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:43,351 INFO L93 Difference]: Finished difference Result 482 states and 704 transitions. [2025-03-16 22:36:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:36:43,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-16 22:36:43,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:43,354 INFO L225 Difference]: With dead ends: 482 [2025-03-16 22:36:43,354 INFO L226 Difference]: Without dead ends: 325 [2025-03-16 22:36:43,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:36:43,355 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 576 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:43,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 935 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:36:43,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-16 22:36:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 301. [2025-03-16 22:36:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.4566666666666668) internal successors, (437), 300 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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 22:36:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 437 transitions. [2025-03-16 22:36:43,361 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 437 transitions. Word has length 111 [2025-03-16 22:36:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:43,361 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 437 transitions. [2025-03-16 22:36:43,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 22:36:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 437 transitions. [2025-03-16 22:36:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 22:36:43,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:43,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:43,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:36:43,363 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:43,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:43,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1532992427, now seen corresponding path program 1 times [2025-03-16 22:36:43,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:43,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422511390] [2025-03-16 22:36:43,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:43,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 22:36:43,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 22:36:43,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:43,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:43,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:43,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422511390] [2025-03-16 22:36:43,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422511390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:43,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:43,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:43,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783958999] [2025-03-16 22:36:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:43,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:43,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:43,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:43,785 INFO L87 Difference]: Start difference. First operand 301 states and 437 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 22:36:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:43,965 INFO L93 Difference]: Finished difference Result 479 states and 699 transitions. [2025-03-16 22:36:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:43,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-03-16 22:36:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:43,967 INFO L225 Difference]: With dead ends: 479 [2025-03-16 22:36:43,967 INFO L226 Difference]: Without dead ends: 322 [2025-03-16 22:36:43,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:43,967 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 548 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:43,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 661 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:36:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-16 22:36:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2025-03-16 22:36:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.4545454545454546) internal successors, (464), 319 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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 22:36:43,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 464 transitions. [2025-03-16 22:36:43,974 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 464 transitions. Word has length 112 [2025-03-16 22:36:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:43,974 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 464 transitions. [2025-03-16 22:36:43,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 22:36:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 464 transitions. [2025-03-16 22:36:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 22:36:43,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:43,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:43,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:36:43,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:43,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:43,976 INFO L85 PathProgramCache]: Analyzing trace with hash 613896912, now seen corresponding path program 1 times [2025-03-16 22:36:43,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:43,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409239513] [2025-03-16 22:36:43,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:43,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:44,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 22:36:44,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 22:36:44,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:44,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:44,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409239513] [2025-03-16 22:36:44,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409239513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:44,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:44,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:36:44,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763023639] [2025-03-16 22:36:44,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:44,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:36:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:44,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:36:44,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:44,391 INFO L87 Difference]: Start difference. First operand 320 states and 464 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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 22:36:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:44,607 INFO L93 Difference]: Finished difference Result 484 states and 705 transitions. [2025-03-16 22:36:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:36:44,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-16 22:36:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:44,609 INFO L225 Difference]: With dead ends: 484 [2025-03-16 22:36:44,609 INFO L226 Difference]: Without dead ends: 327 [2025-03-16 22:36:44,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:36:44,610 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 556 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:44,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1094 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:36:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-16 22:36:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2025-03-16 22:36:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.453416149068323) internal successors, (468), 322 states have internal predecessors, (468), 0 states have call successors, (0), 0 states 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 22:36:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 468 transitions. [2025-03-16 22:36:44,616 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 468 transitions. Word has length 113 [2025-03-16 22:36:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:44,616 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 468 transitions. [2025-03-16 22:36:44,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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 22:36:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 468 transitions. [2025-03-16 22:36:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 22:36:44,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:44,617 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:44,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:36:44,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:44,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash -810012934, now seen corresponding path program 1 times [2025-03-16 22:36:44,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:44,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862629659] [2025-03-16 22:36:44,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:44,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 22:36:44,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 22:36:44,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:44,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:44,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:44,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862629659] [2025-03-16 22:36:44,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862629659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:44,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:44,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:36:44,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269498015] [2025-03-16 22:36:44,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:44,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:36:44,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:44,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:36:44,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:44,987 INFO L87 Difference]: Start difference. First operand 323 states and 468 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:45,203 INFO L93 Difference]: Finished difference Result 490 states and 713 transitions. [2025-03-16 22:36:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:36:45,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-16 22:36:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:45,204 INFO L225 Difference]: With dead ends: 490 [2025-03-16 22:36:45,204 INFO L226 Difference]: Without dead ends: 333 [2025-03-16 22:36:45,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:36:45,205 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 565 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:45,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1099 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:36:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-16 22:36:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2025-03-16 22:36:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.451219512195122) internal successors, (476), 328 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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 22:36:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 476 transitions. [2025-03-16 22:36:45,211 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 476 transitions. Word has length 114 [2025-03-16 22:36:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:45,212 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 476 transitions. [2025-03-16 22:36:45,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 476 transitions. [2025-03-16 22:36:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 22:36:45,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:45,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:45,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:36:45,213 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:45,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash 100863173, now seen corresponding path program 1 times [2025-03-16 22:36:45,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976560300] [2025-03-16 22:36:45,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:45,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:45,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 22:36:45,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 22:36:45,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:45,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:45,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:45,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976560300] [2025-03-16 22:36:45,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976560300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:45,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:45,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:45,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276061164] [2025-03-16 22:36:45,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:45,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:45,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:45,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:45,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:45,527 INFO L87 Difference]: Start difference. First operand 329 states and 476 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:45,694 INFO L93 Difference]: Finished difference Result 511 states and 742 transitions. [2025-03-16 22:36:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:45,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-16 22:36:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:45,696 INFO L225 Difference]: With dead ends: 511 [2025-03-16 22:36:45,696 INFO L226 Difference]: Without dead ends: 327 [2025-03-16 22:36:45,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:45,697 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 553 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:45,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 665 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:36:45,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-16 22:36:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-03-16 22:36:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.450920245398773) internal successors, (473), 326 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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 22:36:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 473 transitions. [2025-03-16 22:36:45,703 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 473 transitions. Word has length 114 [2025-03-16 22:36:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:45,704 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 473 transitions. [2025-03-16 22:36:45,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 473 transitions. [2025-03-16 22:36:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 22:36:45,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:45,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:45,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:36:45,706 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:45,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash -944907810, now seen corresponding path program 1 times [2025-03-16 22:36:45,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:45,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994074294] [2025-03-16 22:36:45,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:45,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:45,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 22:36:45,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 22:36:45,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:45,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:46,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:46,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994074294] [2025-03-16 22:36:46,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994074294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:46,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:46,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:36:46,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172869418] [2025-03-16 22:36:46,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:46,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:36:46,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:46,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:36:46,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:36:46,129 INFO L87 Difference]: Start difference. First operand 327 states and 473 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:46,288 INFO L93 Difference]: Finished difference Result 531 states and 770 transitions. [2025-03-16 22:36:46,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:46,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-16 22:36:46,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:46,290 INFO L225 Difference]: With dead ends: 531 [2025-03-16 22:36:46,290 INFO L226 Difference]: Without dead ends: 327 [2025-03-16 22:36:46,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:36:46,291 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 564 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:46,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 665 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:36:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-16 22:36:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-03-16 22:36:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.4478527607361964) internal successors, (472), 326 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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 22:36:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 472 transitions. [2025-03-16 22:36:46,299 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 472 transitions. Word has length 114 [2025-03-16 22:36:46,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:46,299 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 472 transitions. [2025-03-16 22:36:46,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 472 transitions. [2025-03-16 22:36:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 22:36:46,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:46,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:46,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:36:46,300 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:46,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1908987897, now seen corresponding path program 1 times [2025-03-16 22:36:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:46,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385868088] [2025-03-16 22:36:46,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:46,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:46,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 22:36:46,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 22:36:46,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:46,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:46,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385868088] [2025-03-16 22:36:46,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385868088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:36:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024395881] [2025-03-16 22:36:46,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:46,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:36:46,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:36:46,933 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 22:36:46,935 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 22:36:47,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 22:36:47,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 22:36:47,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:47,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:47,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-16 22:36:47,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:36:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:47,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:36:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:48,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024395881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:36:48,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:36:48,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 26 [2025-03-16 22:36:48,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830209901] [2025-03-16 22:36:48,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:36:48,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 22:36:48,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:48,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 22:36:48,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-03-16 22:36:48,524 INFO L87 Difference]: Start difference. First operand 327 states and 472 transitions. Second operand has 27 states, 27 states have (on average 12.407407407407407) internal successors, (335), 26 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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 22:36:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:49,630 INFO L93 Difference]: Finished difference Result 875 states and 1265 transitions. [2025-03-16 22:36:49,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 22:36:49,631 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 12.407407407407407) internal successors, (335), 26 states have internal predecessors, (335), 0 states have call successors, (0), 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 115 [2025-03-16 22:36:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:49,633 INFO L225 Difference]: With dead ends: 875 [2025-03-16 22:36:49,633 INFO L226 Difference]: Without dead ends: 598 [2025-03-16 22:36:49,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-03-16 22:36:49,634 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 1320 mSDsluCounter, 5227 mSDsCounter, 0 mSdLazyCounter, 2323 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 5563 SdHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:49,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 5563 Invalid, 2325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2323 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 22:36:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-16 22:36:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 469. [2025-03-16 22:36:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.435897435897436) internal successors, (672), 468 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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 22:36:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 672 transitions. [2025-03-16 22:36:49,644 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 672 transitions. Word has length 115 [2025-03-16 22:36:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:49,644 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 672 transitions. [2025-03-16 22:36:49,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.407407407407407) internal successors, (335), 26 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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 22:36:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 672 transitions. [2025-03-16 22:36:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 22:36:49,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:49,646 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:49,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 22:36:49,849 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,SelfDestructingSolverStorable13 [2025-03-16 22:36:49,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:49,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash 306971378, now seen corresponding path program 1 times [2025-03-16 22:36:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:49,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096418508] [2025-03-16 22:36:49,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:49,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 22:36:49,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 22:36:49,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:49,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096418508] [2025-03-16 22:36:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096418508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:50,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:50,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:36:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298931368] [2025-03-16 22:36:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:50,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:36:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:50,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:36:50,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:36:50,023 INFO L87 Difference]: Start difference. First operand 469 states and 672 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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 22:36:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:50,149 INFO L93 Difference]: Finished difference Result 747 states and 1073 transitions. [2025-03-16 22:36:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:50,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-16 22:36:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:50,151 INFO L225 Difference]: With dead ends: 747 [2025-03-16 22:36:50,151 INFO L226 Difference]: Without dead ends: 468 [2025-03-16 22:36:50,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:36:50,152 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 615 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:50,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 673 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:36:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-16 22:36:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 466. [2025-03-16 22:36:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 1.4322580645161291) internal successors, (666), 465 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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 22:36:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 666 transitions. [2025-03-16 22:36:50,161 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 666 transitions. Word has length 116 [2025-03-16 22:36:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:50,161 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 666 transitions. [2025-03-16 22:36:50,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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 22:36:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 666 transitions. [2025-03-16 22:36:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 22:36:50,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:50,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:50,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 22:36:50,163 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:50,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:50,163 INFO L85 PathProgramCache]: Analyzing trace with hash -270280147, now seen corresponding path program 1 times [2025-03-16 22:36:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:50,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785115485] [2025-03-16 22:36:50,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:50,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:50,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 22:36:50,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 22:36:50,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:50,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785115485] [2025-03-16 22:36:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785115485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:36:50,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:36:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:36:50,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781492459] [2025-03-16 22:36:50,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:36:50,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:36:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:50,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:36:50,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:36:50,372 INFO L87 Difference]: Start difference. First operand 466 states and 666 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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 22:36:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:36:50,505 INFO L93 Difference]: Finished difference Result 623 states and 897 transitions. [2025-03-16 22:36:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:36:50,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-16 22:36:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:36:50,507 INFO L225 Difference]: With dead ends: 623 [2025-03-16 22:36:50,507 INFO L226 Difference]: Without dead ends: 343 [2025-03-16 22:36:50,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:36:50,508 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 597 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:36:50,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 669 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:36:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-16 22:36:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-03-16 22:36:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.4385964912280702) internal successors, (492), 342 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:36:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 492 transitions. [2025-03-16 22:36:50,514 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 492 transitions. Word has length 116 [2025-03-16 22:36:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:36:50,515 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 492 transitions. [2025-03-16 22:36:50,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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 22:36:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 492 transitions. [2025-03-16 22:36:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-16 22:36:50,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:36:50,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:36:50,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 22:36:50,517 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:36:50,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:36:50,518 INFO L85 PathProgramCache]: Analyzing trace with hash 894849321, now seen corresponding path program 1 times [2025-03-16 22:36:50,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:36:50,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908078945] [2025-03-16 22:36:50,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:50,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:36:50,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-16 22:36:51,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-16 22:36:51,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:51,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 45 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 22:36:52,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:36:52,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908078945] [2025-03-16 22:36:52,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908078945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:36:52,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366458663] [2025-03-16 22:36:52,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:36:52,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:36:52,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:36:52,741 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 22:36:52,743 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 22:36:52,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-16 22:36:53,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-16 22:36:53,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:36:53,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:36:53,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-03-16 22:36:53,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:36:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 23 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:54,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:36:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 23 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:36:55,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366458663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:36:55,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:36:55,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 19] total 48 [2025-03-16 22:36:55,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080512211] [2025-03-16 22:36:55,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:36:55,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-16 22:36:55,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:36:55,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-16 22:36:55,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1983, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 22:36:55,775 INFO L87 Difference]: Start difference. First operand 343 states and 492 transitions. Second operand has 48 states, 48 states have (on average 11.291666666666666) internal successors, (542), 48 states have internal predecessors, (542), 0 states have call successors, (0), 0 states 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 22:37:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:05,805 INFO L93 Difference]: Finished difference Result 4615 states and 6775 transitions. [2025-03-16 22:37:05,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2025-03-16 22:37:05,806 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 11.291666666666666) internal successors, (542), 48 states have internal predecessors, (542), 0 states have call successors, (0), 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 192 [2025-03-16 22:37:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:05,818 INFO L225 Difference]: With dead ends: 4615 [2025-03-16 22:37:05,818 INFO L226 Difference]: Without dead ends: 4381 [2025-03-16 22:37:05,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24804 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=8372, Invalid=53878, Unknown=0, NotChecked=0, Total=62250 [2025-03-16 22:37:05,830 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 20792 mSDsluCounter, 9910 mSDsCounter, 0 mSdLazyCounter, 5942 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20792 SdHoareTripleChecker+Valid, 10299 SdHoareTripleChecker+Invalid, 6034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 5942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:05,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20792 Valid, 10299 Invalid, 6034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 5942 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 22:37:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2025-03-16 22:37:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 1755. [2025-03-16 22:37:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 1.4498289623717218) internal successors, (2543), 1754 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states 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 22:37:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2543 transitions. [2025-03-16 22:37:05,874 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2543 transitions. Word has length 192 [2025-03-16 22:37:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:05,874 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2543 transitions. [2025-03-16 22:37:05,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 11.291666666666666) internal successors, (542), 48 states have internal predecessors, (542), 0 states have call successors, (0), 0 states 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 22:37:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2543 transitions. [2025-03-16 22:37:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 22:37:05,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:05,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:05,887 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 22:37:06,078 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,SelfDestructingSolverStorable16 [2025-03-16 22:37:06,078 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:06,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:06,079 INFO L85 PathProgramCache]: Analyzing trace with hash -961088197, now seen corresponding path program 1 times [2025-03-16 22:37:06,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:06,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197216815] [2025-03-16 22:37:06,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:06,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:06,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 22:37:06,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 22:37:06,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:06,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:08,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:08,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197216815] [2025-03-16 22:37:08,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197216815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:08,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017947107] [2025-03-16 22:37:08,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:08,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:08,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:08,057 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 22:37:08,058 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 22:37:08,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 22:37:08,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 22:37:08,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:08,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:08,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-16 22:37:08,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 22:37:08,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:37:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017947107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:08,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:37:08,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 26 [2025-03-16 22:37:08,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018406643] [2025-03-16 22:37:08,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:08,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 22:37:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:08,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 22:37:08,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2025-03-16 22:37:08,829 INFO L87 Difference]: Start difference. First operand 1755 states and 2543 transitions. Second operand has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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 22:37:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:09,372 INFO L93 Difference]: Finished difference Result 3147 states and 4608 transitions. [2025-03-16 22:37:09,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 22:37:09,372 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 states have internal predecessors, (169), 0 states have call successors, (0), 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 194 [2025-03-16 22:37:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:09,379 INFO L225 Difference]: With dead ends: 3147 [2025-03-16 22:37:09,379 INFO L226 Difference]: Without dead ends: 2649 [2025-03-16 22:37:09,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2025-03-16 22:37:09,381 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 359 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:09,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 2960 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:37:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2025-03-16 22:37:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2163. [2025-03-16 22:37:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2162 states have (on average 1.4574468085106382) internal successors, (3151), 2162 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states 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 22:37:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3151 transitions. [2025-03-16 22:37:09,412 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3151 transitions. Word has length 194 [2025-03-16 22:37:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:09,413 INFO L471 AbstractCegarLoop]: Abstraction has 2163 states and 3151 transitions. [2025-03-16 22:37:09,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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 22:37:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3151 transitions. [2025-03-16 22:37:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 22:37:09,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:09,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:09,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 22:37:09,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 22:37:09,618 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:09,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1263492409, now seen corresponding path program 1 times [2025-03-16 22:37:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:09,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137435931] [2025-03-16 22:37:09,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:09,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:09,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 22:37:09,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 22:37:09,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:09,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:10,719 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 60 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 22:37:10,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:10,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137435931] [2025-03-16 22:37:10,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137435931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:10,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697192969] [2025-03-16 22:37:10,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:10,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:10,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:10,721 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 22:37:10,723 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 22:37:10,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 22:37:11,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 22:37:11,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:11,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:11,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-16 22:37:11,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 68 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:11,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 22:37:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697192969] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:12,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:37:12,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9, 15] total 34 [2025-03-16 22:37:12,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780121159] [2025-03-16 22:37:12,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:12,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 22:37:12,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:12,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 22:37:12,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 22:37:12,182 INFO L87 Difference]: Start difference. First operand 2163 states and 3151 transitions. Second operand has 12 states, 12 states have (on average 15.0) internal successors, (180), 12 states have internal predecessors, (180), 0 states have call successors, (0), 0 states 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 22:37:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:13,233 INFO L93 Difference]: Finished difference Result 6425 states and 9494 transitions. [2025-03-16 22:37:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 22:37:13,234 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.0) internal successors, (180), 12 states have internal predecessors, (180), 0 states have call successors, (0), 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 194 [2025-03-16 22:37:13,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:13,243 INFO L225 Difference]: With dead ends: 6425 [2025-03-16 22:37:13,243 INFO L226 Difference]: Without dead ends: 4095 [2025-03-16 22:37:13,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 22:37:13,248 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 1317 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 2560 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:13,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 2560 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:37:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2025-03-16 22:37:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 2269. [2025-03-16 22:37:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2269 states, 2268 states have (on average 1.4598765432098766) internal successors, (3311), 2268 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states 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 22:37:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 2269 states and 3311 transitions. [2025-03-16 22:37:13,289 INFO L78 Accepts]: Start accepts. Automaton has 2269 states and 3311 transitions. Word has length 194 [2025-03-16 22:37:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:13,290 INFO L471 AbstractCegarLoop]: Abstraction has 2269 states and 3311 transitions. [2025-03-16 22:37:13,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.0) internal successors, (180), 12 states have internal predecessors, (180), 0 states have call successors, (0), 0 states 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 22:37:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 3311 transitions. [2025-03-16 22:37:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 22:37:13,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:13,295 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:13,305 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 22:37:13,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:13,496 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:13,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:13,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1685398065, now seen corresponding path program 1 times [2025-03-16 22:37:13,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:13,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469980516] [2025-03-16 22:37:13,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:13,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:13,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 22:37:13,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 22:37:13,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:13,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 22:37:14,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:14,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469980516] [2025-03-16 22:37:14,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469980516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:14,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372414561] [2025-03-16 22:37:14,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:14,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:14,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:14,747 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 22:37:14,749 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 22:37:14,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 22:37:15,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 22:37:15,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:15,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:15,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-16 22:37:15,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 62 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:15,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 22:37:15,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372414561] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:15,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:37:15,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 9] total 22 [2025-03-16 22:37:15,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576770174] [2025-03-16 22:37:15,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:15,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:15,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:15,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:15,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-16 22:37:15,584 INFO L87 Difference]: Start difference. First operand 2269 states and 3311 transitions. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states 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 22:37:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:15,792 INFO L93 Difference]: Finished difference Result 5160 states and 7605 transitions. [2025-03-16 22:37:15,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:37:15,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 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 194 [2025-03-16 22:37:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:15,799 INFO L225 Difference]: With dead ends: 5160 [2025-03-16 22:37:15,800 INFO L226 Difference]: Without dead ends: 3001 [2025-03-16 22:37:15,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-03-16 22:37:15,802 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 512 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:15,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1197 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2025-03-16 22:37:15,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2301. [2025-03-16 22:37:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2300 states have (on average 1.4573913043478262) internal successors, (3352), 2300 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states 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 22:37:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 3352 transitions. [2025-03-16 22:37:15,843 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 3352 transitions. Word has length 194 [2025-03-16 22:37:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:15,843 INFO L471 AbstractCegarLoop]: Abstraction has 2301 states and 3352 transitions. [2025-03-16 22:37:15,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states 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 22:37:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 3352 transitions. [2025-03-16 22:37:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 22:37:15,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:15,848 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:37:15,857 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 22:37:16,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:16,049 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:16,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:16,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1522933567, now seen corresponding path program 1 times [2025-03-16 22:37:16,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:16,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787105050] [2025-03-16 22:37:16,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:16,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:16,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 22:37:16,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 22:37:16,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:16,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 69 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:17,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787105050] [2025-03-16 22:37:17,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787105050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:17,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938438994] [2025-03-16 22:37:17,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:17,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:17,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:17,296 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 22:37:17,297 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 22:37:17,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 22:37:17,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 22:37:17,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:17,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:17,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-16 22:37:17,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 53 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:18,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 47 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:19,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938438994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:19,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:37:19,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 13] total 29 [2025-03-16 22:37:19,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519792644] [2025-03-16 22:37:19,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:19,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 22:37:19,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:19,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 22:37:19,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2025-03-16 22:37:19,690 INFO L87 Difference]: Start difference. First operand 2301 states and 3352 transitions. Second operand has 30 states, 30 states have (on average 17.633333333333333) internal successors, (529), 29 states have internal predecessors, (529), 0 states have call successors, (0), 0 states 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 22:37:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:21,180 INFO L93 Difference]: Finished difference Result 3902 states and 5705 transitions. [2025-03-16 22:37:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 22:37:21,181 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 17.633333333333333) internal successors, (529), 29 states have internal predecessors, (529), 0 states have call successors, (0), 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 194 [2025-03-16 22:37:21,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:21,188 INFO L225 Difference]: With dead ends: 3902 [2025-03-16 22:37:21,188 INFO L226 Difference]: Without dead ends: 3049 [2025-03-16 22:37:21,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1814, Unknown=0, NotChecked=0, Total=2070 [2025-03-16 22:37:21,190 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 663 mSDsluCounter, 8205 mSDsCounter, 0 mSdLazyCounter, 3680 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 8666 SdHoareTripleChecker+Invalid, 3688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:21,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 8666 Invalid, 3688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3680 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 22:37:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2025-03-16 22:37:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2816. [2025-03-16 22:37:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2815 states have (on average 1.450088809946714) internal successors, (4082), 2815 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states 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 22:37:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 4082 transitions. [2025-03-16 22:37:21,235 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 4082 transitions. Word has length 194 [2025-03-16 22:37:21,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:21,235 INFO L471 AbstractCegarLoop]: Abstraction has 2816 states and 4082 transitions. [2025-03-16 22:37:21,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 17.633333333333333) internal successors, (529), 29 states have internal predecessors, (529), 0 states have call successors, (0), 0 states 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 22:37:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 4082 transitions. [2025-03-16 22:37:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-16 22:37:21,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:21,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:21,251 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 22:37:21,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:21,442 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:21,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:21,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1905056239, now seen corresponding path program 1 times [2025-03-16 22:37:21,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:21,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100572611] [2025-03-16 22:37:21,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:21,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:21,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 22:37:21,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 22:37:21,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:21,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 22:37:23,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:23,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100572611] [2025-03-16 22:37:23,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100572611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:23,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221875437] [2025-03-16 22:37:23,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:23,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:23,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:23,298 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 22:37:23,298 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 22:37:23,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 22:37:23,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 22:37:23,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:23,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:23,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-03-16 22:37:23,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 22:37:24,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:37:24,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221875437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:24,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:37:24,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 26 [2025-03-16 22:37:24,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521316575] [2025-03-16 22:37:24,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:24,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 22:37:24,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:24,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 22:37:24,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-03-16 22:37:24,093 INFO L87 Difference]: Start difference. First operand 2816 states and 4082 transitions. Second operand has 15 states, 15 states have (on average 12.533333333333333) internal successors, (188), 15 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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 22:37:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:24,556 INFO L93 Difference]: Finished difference Result 6581 states and 9652 transitions. [2025-03-16 22:37:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 22:37:24,558 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.533333333333333) internal successors, (188), 15 states have internal predecessors, (188), 0 states have call successors, (0), 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 195 [2025-03-16 22:37:24,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:24,569 INFO L225 Difference]: With dead ends: 6581 [2025-03-16 22:37:24,569 INFO L226 Difference]: Without dead ends: 4777 [2025-03-16 22:37:24,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2025-03-16 22:37:24,573 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 180 mSDsluCounter, 2649 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:24,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 2906 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:37:24,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2025-03-16 22:37:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4577. [2025-03-16 22:37:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4576 states have (on average 1.46131993006993) internal successors, (6687), 4576 states have internal predecessors, (6687), 0 states have call successors, (0), 0 states 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 22:37:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 6687 transitions. [2025-03-16 22:37:24,622 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 6687 transitions. Word has length 195 [2025-03-16 22:37:24,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:24,622 INFO L471 AbstractCegarLoop]: Abstraction has 4577 states and 6687 transitions. [2025-03-16 22:37:24,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.533333333333333) internal successors, (188), 15 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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 22:37:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 6687 transitions. [2025-03-16 22:37:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-16 22:37:24,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:24,628 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:24,637 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 22:37:24,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:24,829 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:24,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1862912567, now seen corresponding path program 1 times [2025-03-16 22:37:24,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:24,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426478769] [2025-03-16 22:37:24,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:24,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 22:37:25,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 22:37:25,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:25,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 43 proven. 35 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 22:37:25,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:25,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426478769] [2025-03-16 22:37:25,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426478769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:25,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687326598] [2025-03-16 22:37:25,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:25,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:25,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:25,705 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 22:37:25,706 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 22:37:25,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 22:37:26,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 22:37:26,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:26,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:26,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-16 22:37:26,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 42 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:26,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 22:37:26,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687326598] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:26,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:37:26,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 11] total 22 [2025-03-16 22:37:26,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110474848] [2025-03-16 22:37:26,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:26,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:26,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:26,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:26,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2025-03-16 22:37:26,784 INFO L87 Difference]: Start difference. First operand 4577 states and 6687 transitions. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 22:37:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:27,014 INFO L93 Difference]: Finished difference Result 13340 states and 19589 transitions. [2025-03-16 22:37:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:37:27,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 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 195 [2025-03-16 22:37:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:27,024 INFO L225 Difference]: With dead ends: 13340 [2025-03-16 22:37:27,024 INFO L226 Difference]: Without dead ends: 5576 [2025-03-16 22:37:27,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-16 22:37:27,030 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 523 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:27,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 965 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5576 states. [2025-03-16 22:37:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5576 to 5224. [2025-03-16 22:37:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5224 states, 5223 states have (on average 1.4577828834003446) internal successors, (7614), 5223 states have internal predecessors, (7614), 0 states have call successors, (0), 0 states 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 22:37:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 7614 transitions. [2025-03-16 22:37:27,078 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 7614 transitions. Word has length 195 [2025-03-16 22:37:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:27,078 INFO L471 AbstractCegarLoop]: Abstraction has 5224 states and 7614 transitions. [2025-03-16 22:37:27,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 22:37:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 7614 transitions. [2025-03-16 22:37:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-16 22:37:27,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:27,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:27,095 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 22:37:27,285 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,SelfDestructingSolverStorable22 [2025-03-16 22:37:27,285 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:27,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1318395694, now seen corresponding path program 1 times [2025-03-16 22:37:27,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:27,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353624803] [2025-03-16 22:37:27,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:27,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:27,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 22:37:27,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 22:37:27,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:27,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 59 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 22:37:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353624803] [2025-03-16 22:37:28,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353624803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081442421] [2025-03-16 22:37:28,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:28,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:28,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:28,380 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 22:37:28,381 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 22:37:28,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 22:37:28,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 22:37:28,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:28,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:28,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-03-16 22:37:28,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 59 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:29,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 22:37:30,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081442421] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:30,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:37:30,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [11, 19] total 46 [2025-03-16 22:37:30,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624566165] [2025-03-16 22:37:30,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:30,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 22:37:30,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:30,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 22:37:30,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1825, Unknown=0, NotChecked=0, Total=2070 [2025-03-16 22:37:30,248 INFO L87 Difference]: Start difference. First operand 5224 states and 7614 transitions. Second operand has 19 states, 19 states have (on average 9.947368421052632) internal successors, (189), 19 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 22:37:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:31,323 INFO L93 Difference]: Finished difference Result 16277 states and 23892 transitions. [2025-03-16 22:37:31,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 22:37:31,324 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.947368421052632) internal successors, (189), 19 states have internal predecessors, (189), 0 states have call successors, (0), 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 195 [2025-03-16 22:37:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:31,339 INFO L225 Difference]: With dead ends: 16277 [2025-03-16 22:37:31,339 INFO L226 Difference]: Without dead ends: 7991 [2025-03-16 22:37:31,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=412, Invalid=2780, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 22:37:31,349 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 2273 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2273 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:31,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2273 Valid, 3300 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:37:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states. [2025-03-16 22:37:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 5240. [2025-03-16 22:37:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5240 states, 5239 states have (on average 1.455621301775148) internal successors, (7626), 5239 states have internal predecessors, (7626), 0 states have call successors, (0), 0 states 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 22:37:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 7626 transitions. [2025-03-16 22:37:31,433 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 7626 transitions. Word has length 195 [2025-03-16 22:37:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:31,433 INFO L471 AbstractCegarLoop]: Abstraction has 5240 states and 7626 transitions. [2025-03-16 22:37:31,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.947368421052632) internal successors, (189), 19 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 22:37:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 7626 transitions. [2025-03-16 22:37:31,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-16 22:37:31,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:31,440 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:31,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 22:37:31,640 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,SelfDestructingSolverStorable23 [2025-03-16 22:37:31,640 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:31,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1039996712, now seen corresponding path program 1 times [2025-03-16 22:37:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295860808] [2025-03-16 22:37:31,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:31,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 22:37:31,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 22:37:31,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:31,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 22:37:32,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:32,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295860808] [2025-03-16 22:37:32,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295860808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:32,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816247108] [2025-03-16 22:37:32,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:32,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:32,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:32,857 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 22:37:32,858 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 22:37:33,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 22:37:33,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 22:37:33,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:33,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:33,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-16 22:37:33,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 24 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:33,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 24 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:34,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816247108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:34,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:37:34,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2025-03-16 22:37:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072000273] [2025-03-16 22:37:34,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:34,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 22:37:34,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:34,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 22:37:34,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2025-03-16 22:37:34,597 INFO L87 Difference]: Start difference. First operand 5240 states and 7626 transitions. Second operand has 28 states, 28 states have (on average 19.785714285714285) internal successors, (554), 27 states have internal predecessors, (554), 0 states have call successors, (0), 0 states 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 22:37:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:36,447 INFO L93 Difference]: Finished difference Result 20646 states and 30090 transitions. [2025-03-16 22:37:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-16 22:37:36,447 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 19.785714285714285) internal successors, (554), 27 states have internal predecessors, (554), 0 states have call successors, (0), 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 195 [2025-03-16 22:37:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:36,470 INFO L225 Difference]: With dead ends: 20646 [2025-03-16 22:37:36,470 INFO L226 Difference]: Without dead ends: 17957 [2025-03-16 22:37:36,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1103, Invalid=6207, Unknown=0, NotChecked=0, Total=7310 [2025-03-16 22:37:36,476 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 9471 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9471 SdHoareTripleChecker+Valid, 4595 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:36,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9471 Valid, 4595 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 22:37:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17957 states. [2025-03-16 22:37:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17957 to 10108. [2025-03-16 22:37:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10108 states, 10107 states have (on average 1.4511724547343425) internal successors, (14667), 10107 states have internal predecessors, (14667), 0 states have call successors, (0), 0 states 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 22:37:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10108 states to 10108 states and 14667 transitions. [2025-03-16 22:37:36,580 INFO L78 Accepts]: Start accepts. Automaton has 10108 states and 14667 transitions. Word has length 195 [2025-03-16 22:37:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:36,581 INFO L471 AbstractCegarLoop]: Abstraction has 10108 states and 14667 transitions. [2025-03-16 22:37:36,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 19.785714285714285) internal successors, (554), 27 states have internal predecessors, (554), 0 states have call successors, (0), 0 states 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 22:37:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 10108 states and 14667 transitions. [2025-03-16 22:37:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-16 22:37:36,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:36,590 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:37:36,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-16 22:37:36,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-16 22:37:36,791 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:36,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:36,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1173841890, now seen corresponding path program 1 times [2025-03-16 22:37:36,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:36,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169492084] [2025-03-16 22:37:36,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:36,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:36,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 22:37:37,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 22:37:37,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:37,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 43 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 22:37:38,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:38,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169492084] [2025-03-16 22:37:38,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169492084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:38,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290883282] [2025-03-16 22:37:38,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:38,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:38,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:38,499 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 22:37:38,500 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 22:37:38,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-16 22:37:38,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-16 22:37:38,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:38,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:38,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-16 22:37:38,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-16 22:37:39,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:37:39,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290883282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:39,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:37:39,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-03-16 22:37:39,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230612075] [2025-03-16 22:37:39,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:39,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:39,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:39,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:39,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-03-16 22:37:39,061 INFO L87 Difference]: Start difference. First operand 10108 states and 14667 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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 22:37:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:39,255 INFO L93 Difference]: Finished difference Result 14104 states and 20544 transitions. [2025-03-16 22:37:39,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:37:39,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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 195 [2025-03-16 22:37:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:39,270 INFO L225 Difference]: With dead ends: 14104 [2025-03-16 22:37:39,270 INFO L226 Difference]: Without dead ends: 9576 [2025-03-16 22:37:39,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-03-16 22:37:39,277 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 570 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:39,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 568 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:37:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9576 states. [2025-03-16 22:37:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9576 to 9576. [2025-03-16 22:37:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9576 states, 9575 states have (on average 1.4538903394255875) internal successors, (13921), 9575 states have internal predecessors, (13921), 0 states have call successors, (0), 0 states 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 22:37:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9576 states to 9576 states and 13921 transitions. [2025-03-16 22:37:39,361 INFO L78 Accepts]: Start accepts. Automaton has 9576 states and 13921 transitions. Word has length 195 [2025-03-16 22:37:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:39,362 INFO L471 AbstractCegarLoop]: Abstraction has 9576 states and 13921 transitions. [2025-03-16 22:37:39,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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 22:37:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 9576 states and 13921 transitions. [2025-03-16 22:37:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-16 22:37:39,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:39,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:37:39,380 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 22:37:39,571 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,SelfDestructingSolverStorable25 [2025-03-16 22:37:39,571 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:39,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:39,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1945267136, now seen corresponding path program 1 times [2025-03-16 22:37:39,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:39,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434297412] [2025-03-16 22:37:39,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:39,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:39,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 22:37:39,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 22:37:39,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:39,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:41,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:41,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434297412] [2025-03-16 22:37:41,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434297412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:41,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292903244] [2025-03-16 22:37:41,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:41,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:41,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:41,556 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 22:37:41,556 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 22:37:41,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 22:37:42,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 22:37:42,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:42,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:42,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 1239 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-16 22:37:42,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:42,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:43,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292903244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:43,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:37:43,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 11] total 31 [2025-03-16 22:37:43,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711985841] [2025-03-16 22:37:43,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:43,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 22:37:43,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:43,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 22:37:43,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2025-03-16 22:37:43,431 INFO L87 Difference]: Start difference. First operand 9576 states and 13921 transitions. Second operand has 32 states, 32 states have (on average 17.21875) internal successors, (551), 31 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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 22:37:46,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:46,264 INFO L93 Difference]: Finished difference Result 28916 states and 42279 transitions. [2025-03-16 22:37:46,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-16 22:37:46,264 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 17.21875) internal successors, (551), 31 states have internal predecessors, (551), 0 states have call successors, (0), 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 196 [2025-03-16 22:37:46,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:46,285 INFO L225 Difference]: With dead ends: 28916 [2025-03-16 22:37:46,285 INFO L226 Difference]: Without dead ends: 21296 [2025-03-16 22:37:46,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 373 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2208 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1296, Invalid=7076, Unknown=0, NotChecked=0, Total=8372 [2025-03-16 22:37:46,298 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 11527 mSDsluCounter, 4677 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11527 SdHoareTripleChecker+Valid, 4983 SdHoareTripleChecker+Invalid, 2516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:46,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11527 Valid, 4983 Invalid, 2516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 22:37:46,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21296 states. [2025-03-16 22:37:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21296 to 16710. [2025-03-16 22:37:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16710 states, 16709 states have (on average 1.4496379196840026) internal successors, (24222), 16709 states have internal predecessors, (24222), 0 states have call successors, (0), 0 states 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 22:37:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 24222 transitions. [2025-03-16 22:37:46,523 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 24222 transitions. Word has length 196 [2025-03-16 22:37:46,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:46,523 INFO L471 AbstractCegarLoop]: Abstraction has 16710 states and 24222 transitions. [2025-03-16 22:37:46,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 17.21875) internal successors, (551), 31 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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 22:37:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 24222 transitions. [2025-03-16 22:37:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-16 22:37:46,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:46,534 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:37:46,543 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 22:37:46,734 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,SelfDestructingSolverStorable26 [2025-03-16 22:37:46,735 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:46,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1360303726, now seen corresponding path program 1 times [2025-03-16 22:37:46,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:46,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796700095] [2025-03-16 22:37:46,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:46,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:46,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-16 22:37:47,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-16 22:37:47,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:47,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 22:37:47,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:47,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796700095] [2025-03-16 22:37:47,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796700095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:47,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034760550] [2025-03-16 22:37:47,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:47,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:47,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:47,824 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 22:37:47,825 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 22:37:48,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-16 22:37:48,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-16 22:37:48,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:48,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:48,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-16 22:37:48,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 22:37:48,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:37:48,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034760550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:48,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:37:48,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [16] total 32 [2025-03-16 22:37:48,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600980441] [2025-03-16 22:37:48,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:48,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 22:37:48,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:48,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 22:37:48,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2025-03-16 22:37:48,705 INFO L87 Difference]: Start difference. First operand 16710 states and 24222 transitions. Second operand has 18 states, 18 states have (on average 10.555555555555555) internal successors, (190), 18 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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 22:37:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:49,271 INFO L93 Difference]: Finished difference Result 31238 states and 45431 transitions. [2025-03-16 22:37:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 22:37:49,272 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.555555555555555) internal successors, (190), 18 states have internal predecessors, (190), 0 states have call successors, (0), 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 197 [2025-03-16 22:37:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:49,293 INFO L225 Difference]: With dead ends: 31238 [2025-03-16 22:37:49,294 INFO L226 Difference]: Without dead ends: 20030 [2025-03-16 22:37:49,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 22:37:49,307 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 308 mSDsluCounter, 2652 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:49,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 2876 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:37:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20030 states. [2025-03-16 22:37:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20030 to 16785. [2025-03-16 22:37:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16785 states, 16784 states have (on average 1.4478074356530028) internal successors, (24300), 16784 states have internal predecessors, (24300), 0 states have call successors, (0), 0 states 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 22:37:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16785 states to 16785 states and 24300 transitions. [2025-03-16 22:37:49,464 INFO L78 Accepts]: Start accepts. Automaton has 16785 states and 24300 transitions. Word has length 197 [2025-03-16 22:37:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:49,464 INFO L471 AbstractCegarLoop]: Abstraction has 16785 states and 24300 transitions. [2025-03-16 22:37:49,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.555555555555555) internal successors, (190), 18 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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 22:37:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 16785 states and 24300 transitions. [2025-03-16 22:37:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-16 22:37:49,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:49,475 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:37:49,485 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 22:37:49,676 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,SelfDestructingSolverStorable27 [2025-03-16 22:37:49,676 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:49,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash -667793379, now seen corresponding path program 1 times [2025-03-16 22:37:49,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:49,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991919281] [2025-03-16 22:37:49,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:49,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-16 22:37:49,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-16 22:37:49,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:49,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:50,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:50,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991919281] [2025-03-16 22:37:50,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991919281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:50,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458598466] [2025-03-16 22:37:50,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:50,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:50,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:50,472 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 22:37:50,472 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 22:37:50,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-16 22:37:50,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-16 22:37:50,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:50,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:50,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-16 22:37:50,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 59 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:51,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 59 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:52,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458598466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:52,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:37:52,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18, 18] total 41 [2025-03-16 22:37:52,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63490790] [2025-03-16 22:37:52,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:52,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-16 22:37:52,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:52,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-16 22:37:52,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722 [2025-03-16 22:37:52,339 INFO L87 Difference]: Start difference. First operand 16785 states and 24300 transitions. Second operand has 42 states, 42 states have (on average 12.642857142857142) internal successors, (531), 41 states have internal predecessors, (531), 0 states have call successors, (0), 0 states 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 22:37:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:54,412 INFO L93 Difference]: Finished difference Result 27228 states and 39374 transitions. [2025-03-16 22:37:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-16 22:37:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 12.642857142857142) internal successors, (531), 41 states have internal predecessors, (531), 0 states have call successors, (0), 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 197 [2025-03-16 22:37:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:54,425 INFO L225 Difference]: With dead ends: 27228 [2025-03-16 22:37:54,425 INFO L226 Difference]: Without dead ends: 12501 [2025-03-16 22:37:54,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=867, Invalid=5453, Unknown=0, NotChecked=0, Total=6320 [2025-03-16 22:37:54,439 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 5506 mSDsluCounter, 5065 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5506 SdHoareTripleChecker+Valid, 5340 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:54,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5506 Valid, 5340 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 22:37:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12501 states. [2025-03-16 22:37:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12501 to 9031. [2025-03-16 22:37:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9031 states, 9030 states have (on average 1.4160575858250277) internal successors, (12787), 9030 states have internal predecessors, (12787), 0 states have call successors, (0), 0 states 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 22:37:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9031 states to 9031 states and 12787 transitions. [2025-03-16 22:37:54,526 INFO L78 Accepts]: Start accepts. Automaton has 9031 states and 12787 transitions. Word has length 197 [2025-03-16 22:37:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:54,526 INFO L471 AbstractCegarLoop]: Abstraction has 9031 states and 12787 transitions. [2025-03-16 22:37:54,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 12.642857142857142) internal successors, (531), 41 states have internal predecessors, (531), 0 states have call successors, (0), 0 states 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 22:37:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 9031 states and 12787 transitions. [2025-03-16 22:37:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-16 22:37:54,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:54,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:54,540 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 22:37:54,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:54,732 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash 332333608, now seen corresponding path program 1 times [2025-03-16 22:37:54,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:54,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737287210] [2025-03-16 22:37:54,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:54,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:54,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-16 22:37:55,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-16 22:37:55,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:55,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 22:37:55,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:55,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737287210] [2025-03-16 22:37:55,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737287210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:55,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:55,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:37:55,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276166295] [2025-03-16 22:37:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:55,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:37:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:55,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:37:55,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:55,650 INFO L87 Difference]: Start difference. First operand 9031 states and 12787 transitions. Second operand has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:55,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:55,814 INFO L93 Difference]: Finished difference Result 14688 states and 20992 transitions. [2025-03-16 22:37:55,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:55,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2025-03-16 22:37:55,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:55,823 INFO L225 Difference]: With dead ends: 14688 [2025-03-16 22:37:55,823 INFO L226 Difference]: Without dead ends: 9841 [2025-03-16 22:37:55,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:55,828 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 119 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:55,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1117 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:37:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9841 states. [2025-03-16 22:37:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9841 to 9419. [2025-03-16 22:37:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9419 states, 9418 states have (on average 1.413145041410066) internal successors, (13309), 9418 states have internal predecessors, (13309), 0 states have call successors, (0), 0 states 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 22:37:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9419 states to 9419 states and 13309 transitions. [2025-03-16 22:37:55,905 INFO L78 Accepts]: Start accepts. Automaton has 9419 states and 13309 transitions. Word has length 197 [2025-03-16 22:37:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:55,905 INFO L471 AbstractCegarLoop]: Abstraction has 9419 states and 13309 transitions. [2025-03-16 22:37:55,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 9419 states and 13309 transitions. [2025-03-16 22:37:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-16 22:37:55,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:55,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:55,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 22:37:55,911 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:55,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:55,911 INFO L85 PathProgramCache]: Analyzing trace with hash -936012447, now seen corresponding path program 1 times [2025-03-16 22:37:55,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:55,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627375412] [2025-03-16 22:37:55,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:55,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:55,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-16 22:37:56,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-16 22:37:56,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:56,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-16 22:37:56,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:56,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627375412] [2025-03-16 22:37:56,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627375412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:56,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:56,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:37:56,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816344855] [2025-03-16 22:37:56,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:56,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:37:56,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:56,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:37:56,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:56,457 INFO L87 Difference]: Start difference. First operand 9419 states and 13309 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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 22:37:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:56,615 INFO L93 Difference]: Finished difference Result 14022 states and 19886 transitions. [2025-03-16 22:37:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 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 197 [2025-03-16 22:37:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:56,623 INFO L225 Difference]: With dead ends: 14022 [2025-03-16 22:37:56,623 INFO L226 Difference]: Without dead ends: 9759 [2025-03-16 22:37:56,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:56,627 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 447 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:56,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1383 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:37:56,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9759 states. [2025-03-16 22:37:56,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9759 to 8353. [2025-03-16 22:37:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8353 states, 8352 states have (on average 1.4165469348659003) internal successors, (11831), 8352 states have internal predecessors, (11831), 0 states have call successors, (0), 0 states 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 22:37:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8353 states to 8353 states and 11831 transitions. [2025-03-16 22:37:56,693 INFO L78 Accepts]: Start accepts. Automaton has 8353 states and 11831 transitions. Word has length 197 [2025-03-16 22:37:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:56,693 INFO L471 AbstractCegarLoop]: Abstraction has 8353 states and 11831 transitions. [2025-03-16 22:37:56,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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 22:37:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 8353 states and 11831 transitions. [2025-03-16 22:37:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-16 22:37:56,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:56,698 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:56,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 22:37:56,698 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:56,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:56,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1562744624, now seen corresponding path program 1 times [2025-03-16 22:37:56,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:56,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438715185] [2025-03-16 22:37:56,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:56,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-16 22:37:57,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-16 22:37:57,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:57,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat