./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.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.circular_pointer_top_w128_d8_e0.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 cc215c1310f8b4d8a3ef1501261e91ba08e9c5718658396972a4e0020f5cf43f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:36:33,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:36:33,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:36:33,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:36:33,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:36:33,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:36:33,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:36:33,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:36:33,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:36:33,605 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:36:33,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:36:33,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:36:33,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:36:33,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:36:33,606 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:36:33,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:36:33,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:36:33,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:36:33,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:36:33,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:36:33,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:36:33,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:36:33,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:36:33,607 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:36:33,607 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:36:33,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:36:33,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:36:33,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:36:33,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:36:33,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:36:33,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:36:33,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:36:33,608 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:36:33,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:36:33,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:36:33,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:36:33,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:36:33,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:36:33,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:36:33,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:36:33,609 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 -> cc215c1310f8b4d8a3ef1501261e91ba08e9c5718658396972a4e0020f5cf43f [2025-03-16 21:36:33,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:36:33,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:36:33,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:36:33,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:36:33,827 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:36:33,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c [2025-03-16 21:36:34,927 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070070eb3/e0d0224886f844d48259b5359e419c0c/FLAGfc42a97a7 [2025-03-16 21:36:35,192 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:36:35,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c [2025-03-16 21:36:35,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070070eb3/e0d0224886f844d48259b5359e419c0c/FLAGfc42a97a7 [2025-03-16 21:36:35,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070070eb3/e0d0224886f844d48259b5359e419c0c [2025-03-16 21:36:35,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:36:35,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:36:35,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:36:35,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:36:35,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:36:35,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:35,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867afc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35, skipping insertion in model container [2025-03-16 21:36:35,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:35,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:36:35,677 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.circular_pointer_top_w128_d8_e0.c[1334,1347] [2025-03-16 21:36:35,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:36:35,816 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:36:35,824 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.circular_pointer_top_w128_d8_e0.c[1334,1347] [2025-03-16 21:36:35,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:36:35,929 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:36:35,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35 WrapperNode [2025-03-16 21:36:35,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:36:35,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:36:35,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:36:35,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:36:35,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:35,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:36,122 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1382 [2025-03-16 21:36:36,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:36:36,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:36:36,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:36:36,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:36:36,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:36,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:36,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:36,206 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 21:36:36,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:36,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:36,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:36,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:36,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:36,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:36,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:36:36,303 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:36:36,303 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:36:36,303 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:36:36,304 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (1/1) ... [2025-03-16 21:36:36,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:36:36,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:36,342 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 21:36:36,356 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 21:36:36,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:36:36,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 21:36:36,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 21:36:36,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:36:36,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:36:36,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:36:36,557 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:36:36,559 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:36:37,810 INFO L? ?]: Removed 752 outVars from TransFormulas that were not future-live. [2025-03-16 21:36:37,810 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:36:37,896 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:36:37,900 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:36:37,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:36:37 BoogieIcfgContainer [2025-03-16 21:36:37,900 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:36:37,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:36:37,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:36:37,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:36:37,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:36:35" (1/3) ... [2025-03-16 21:36:37,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1824d224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:36:37, skipping insertion in model container [2025-03-16 21:36:37,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:35" (2/3) ... [2025-03-16 21:36:37,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1824d224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:36:37, skipping insertion in model container [2025-03-16 21:36:37,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:36:37" (3/3) ... [2025-03-16 21:36:37,907 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c [2025-03-16 21:36:37,920 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:36:37,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c that has 2 procedures, 390 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:36:37,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:36:37,987 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;@3e3ef603, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:36:37,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:36:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 390 states, 384 states have (on average 1.4947916666666667) internal successors, (574), 385 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 21:36:38,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:38,003 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:38,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:38,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:38,008 INFO L85 PathProgramCache]: Analyzing trace with hash 329665021, now seen corresponding path program 1 times [2025-03-16 21:36:38,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:38,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691060060] [2025-03-16 21:36:38,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:38,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:38,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 21:36:38,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 21:36:38,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:38,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 21:36:38,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:38,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691060060] [2025-03-16 21:36:38,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691060060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:38,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386068821] [2025-03-16 21:36:38,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:38,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:38,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:38,386 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 21:36:38,390 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 21:36:38,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 21:36:38,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 21:36:38,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:38,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:38,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 21:36:38,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 21:36:38,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:36:38,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386068821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:38,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:36:38,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 21:36:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418544028] [2025-03-16 21:36:38,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:38,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 21:36:38,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:38,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 21:36:38,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 21:36:38,748 INFO L87 Difference]: Start difference. First operand has 390 states, 384 states have (on average 1.4947916666666667) internal successors, (574), 385 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:36:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:38,899 INFO L93 Difference]: Finished difference Result 709 states and 1059 transitions. [2025-03-16 21:36:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 21:36:38,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2025-03-16 21:36:38,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:38,907 INFO L225 Difference]: With dead ends: 709 [2025-03-16 21:36:38,907 INFO L226 Difference]: Without dead ends: 388 [2025-03-16 21:36:38,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 21:36:38,911 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:38,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-16 21:36:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-03-16 21:36:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 383 states have (on average 1.4882506527415145) internal successors, (570), 383 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 576 transitions. [2025-03-16 21:36:38,950 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 576 transitions. Word has length 116 [2025-03-16 21:36:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:38,950 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 576 transitions. [2025-03-16 21:36:38,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:36:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 576 transitions. [2025-03-16 21:36:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 21:36:38,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:38,954 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:38,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 21:36:39,155 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,SelfDestructingSolverStorable0 [2025-03-16 21:36:39,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:39,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:39,156 INFO L85 PathProgramCache]: Analyzing trace with hash -598367334, now seen corresponding path program 1 times [2025-03-16 21:36:39,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:39,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833734931] [2025-03-16 21:36:39,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:39,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:39,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 21:36:39,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 21:36:39,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:39,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:39,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:39,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833734931] [2025-03-16 21:36:39,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833734931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:39,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:39,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335064843] [2025-03-16 21:36:39,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:39,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:39,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:39,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:39,904 INFO L87 Difference]: Start difference. First operand 388 states and 576 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:40,096 INFO L93 Difference]: Finished difference Result 392 states and 580 transitions. [2025-03-16 21:36:40,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:40,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 116 [2025-03-16 21:36:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:40,099 INFO L225 Difference]: With dead ends: 392 [2025-03-16 21:36:40,100 INFO L226 Difference]: Without dead ends: 390 [2025-03-16 21:36:40,100 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 21:36:40,101 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:40,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-16 21:36:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-03-16 21:36:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4857142857142858) internal successors, (572), 385 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2025-03-16 21:36:40,118 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 116 [2025-03-16 21:36:40,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:40,120 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2025-03-16 21:36:40,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2025-03-16 21:36:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 21:36:40,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:40,121 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:40,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:36:40,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:40,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1364838705, now seen corresponding path program 1 times [2025-03-16 21:36:40,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:40,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683717887] [2025-03-16 21:36:40,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:40,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 21:36:40,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 21:36:40,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:40,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:40,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683717887] [2025-03-16 21:36:40,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683717887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:40,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334796558] [2025-03-16 21:36:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:40,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:40,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:40,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:40,577 INFO L87 Difference]: Start difference. First operand 390 states and 578 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:41,051 INFO L93 Difference]: Finished difference Result 970 states and 1440 transitions. [2025-03-16 21:36:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:36:41,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2025-03-16 21:36:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:41,054 INFO L225 Difference]: With dead ends: 970 [2025-03-16 21:36:41,054 INFO L226 Difference]: Without dead ends: 390 [2025-03-16 21:36:41,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:36:41,056 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1090 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:41,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1412 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:36:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-16 21:36:41,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-03-16 21:36:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.483116883116883) internal successors, (571), 385 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 577 transitions. [2025-03-16 21:36:41,071 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 577 transitions. Word has length 117 [2025-03-16 21:36:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:41,071 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 577 transitions. [2025-03-16 21:36:41,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 577 transitions. [2025-03-16 21:36:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 21:36:41,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:41,073 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:41,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:36:41,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:41,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1499737672, now seen corresponding path program 1 times [2025-03-16 21:36:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517161946] [2025-03-16 21:36:41,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:41,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 21:36:41,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 21:36:41,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:41,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:41,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:41,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517161946] [2025-03-16 21:36:41,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517161946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:41,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:41,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:41,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557470421] [2025-03-16 21:36:41,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:41,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:41,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:41,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:41,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:41,335 INFO L87 Difference]: Start difference. First operand 390 states and 577 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:41,520 INFO L93 Difference]: Finished difference Result 713 states and 1054 transitions. [2025-03-16 21:36:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:41,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2025-03-16 21:36:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:41,522 INFO L225 Difference]: With dead ends: 713 [2025-03-16 21:36:41,525 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:41,526 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 21:36:41,526 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 0 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:41,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1432 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4806201550387597) internal successors, (573), 387 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2025-03-16 21:36:41,540 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 118 [2025-03-16 21:36:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:41,541 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2025-03-16 21:36:41,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2025-03-16 21:36:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 21:36:41,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:41,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:41,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:36:41,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:41,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:41,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1178737116, now seen corresponding path program 1 times [2025-03-16 21:36:41,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:41,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544190217] [2025-03-16 21:36:41,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:41,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:41,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 21:36:41,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 21:36:41,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:41,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:41,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:41,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544190217] [2025-03-16 21:36:41,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544190217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:41,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:41,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:41,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249245629] [2025-03-16 21:36:41,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:41,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:41,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:41,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:41,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:41,875 INFO L87 Difference]: Start difference. First operand 392 states and 579 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:42,032 INFO L93 Difference]: Finished difference Result 715 states and 1055 transitions. [2025-03-16 21:36:42,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:42,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2025-03-16 21:36:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:42,034 INFO L225 Difference]: With dead ends: 715 [2025-03-16 21:36:42,034 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:42,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:42,035 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 487 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:42,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 929 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.475452196382429) internal successors, (571), 387 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 577 transitions. [2025-03-16 21:36:42,042 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 577 transitions. Word has length 119 [2025-03-16 21:36:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:42,043 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 577 transitions. [2025-03-16 21:36:42,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 577 transitions. [2025-03-16 21:36:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 21:36:42,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:42,045 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:42,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:36:42,045 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:42,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:42,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1555667804, now seen corresponding path program 1 times [2025-03-16 21:36:42,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:42,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918346841] [2025-03-16 21:36:42,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:42,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:42,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 21:36:42,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 21:36:42,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:42,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:42,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:42,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918346841] [2025-03-16 21:36:42,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918346841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:42,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:42,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:42,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020146089] [2025-03-16 21:36:42,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:42,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:42,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:42,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:42,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:42,297 INFO L87 Difference]: Start difference. First operand 392 states and 577 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:42,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:42,465 INFO L93 Difference]: Finished difference Result 715 states and 1051 transitions. [2025-03-16 21:36:42,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:42,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2025-03-16 21:36:42,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:42,467 INFO L225 Difference]: With dead ends: 715 [2025-03-16 21:36:42,468 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:42,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:42,468 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1041 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:42,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 929 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4728682170542635) internal successors, (570), 387 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 576 transitions. [2025-03-16 21:36:42,481 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 576 transitions. Word has length 121 [2025-03-16 21:36:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:42,481 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 576 transitions. [2025-03-16 21:36:42,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 576 transitions. [2025-03-16 21:36:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 21:36:42,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:42,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:42,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:36:42,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:42,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash -155086837, now seen corresponding path program 1 times [2025-03-16 21:36:42,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:42,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850255642] [2025-03-16 21:36:42,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:42,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:42,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 21:36:42,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 21:36:42,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:42,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:42,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:42,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850255642] [2025-03-16 21:36:42,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850255642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:42,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:42,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:42,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297754721] [2025-03-16 21:36:42,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:42,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:42,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:42,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:42,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:42,846 INFO L87 Difference]: Start difference. First operand 392 states and 576 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:43,039 INFO L93 Difference]: Finished difference Result 715 states and 1049 transitions. [2025-03-16 21:36:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:43,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2025-03-16 21:36:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:43,041 INFO L225 Difference]: With dead ends: 715 [2025-03-16 21:36:43,042 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:43,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:43,044 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 474 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:43,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 891 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4702842377260983) internal successors, (569), 387 states have internal predecessors, (569), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 575 transitions. [2025-03-16 21:36:43,060 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 575 transitions. Word has length 122 [2025-03-16 21:36:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:43,061 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 575 transitions. [2025-03-16 21:36:43,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 575 transitions. [2025-03-16 21:36:43,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 21:36:43,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:43,062 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:43,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:36:43,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:43,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:43,062 INFO L85 PathProgramCache]: Analyzing trace with hash -455804531, now seen corresponding path program 1 times [2025-03-16 21:36:43,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:43,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31032453] [2025-03-16 21:36:43,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:43,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 21:36:43,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 21:36:43,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:43,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:43,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:43,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31032453] [2025-03-16 21:36:43,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31032453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:43,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:43,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:43,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986233315] [2025-03-16 21:36:43,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:43,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:43,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:43,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:43,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:43,322 INFO L87 Difference]: Start difference. First operand 392 states and 575 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:43,531 INFO L93 Difference]: Finished difference Result 719 states and 1052 transitions. [2025-03-16 21:36:43,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:36:43,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2025-03-16 21:36:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:43,533 INFO L225 Difference]: With dead ends: 719 [2025-03-16 21:36:43,533 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:43,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 21:36:43,534 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 481 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:43,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1390 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4677002583979328) internal successors, (568), 387 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 574 transitions. [2025-03-16 21:36:43,542 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 574 transitions. Word has length 123 [2025-03-16 21:36:43,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:43,543 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 574 transitions. [2025-03-16 21:36:43,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 574 transitions. [2025-03-16 21:36:43,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 21:36:43,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:43,544 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:43,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:36:43,544 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:43,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash 576371841, now seen corresponding path program 1 times [2025-03-16 21:36:43,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:43,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818119622] [2025-03-16 21:36:43,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:43,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:43,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 21:36:43,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 21:36:43,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:43,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:43,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:43,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818119622] [2025-03-16 21:36:43,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818119622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:43,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:43,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856577805] [2025-03-16 21:36:43,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:43,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:43,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:43,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:43,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:43,768 INFO L87 Difference]: Start difference. First operand 392 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:43,956 INFO L93 Difference]: Finished difference Result 715 states and 1045 transitions. [2025-03-16 21:36:43,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:43,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2025-03-16 21:36:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:43,959 INFO L225 Difference]: With dead ends: 715 [2025-03-16 21:36:43,959 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:43,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:43,960 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 1030 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:43,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 891 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4651162790697674) internal successors, (567), 387 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 573 transitions. [2025-03-16 21:36:43,967 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 573 transitions. Word has length 124 [2025-03-16 21:36:43,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:43,968 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 573 transitions. [2025-03-16 21:36:43,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 573 transitions. [2025-03-16 21:36:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 21:36:43,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:43,969 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:43,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:36:43,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:43,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:43,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1043901614, now seen corresponding path program 1 times [2025-03-16 21:36:43,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:43,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055032246] [2025-03-16 21:36:43,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:43,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:43,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 21:36:44,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 21:36:44,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:44,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:44,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:44,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055032246] [2025-03-16 21:36:44,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055032246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:44,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:44,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:44,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433750148] [2025-03-16 21:36:44,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:44,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:44,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:44,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:44,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:44,155 INFO L87 Difference]: Start difference. First operand 392 states and 573 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:44,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:44,357 INFO L93 Difference]: Finished difference Result 715 states and 1043 transitions. [2025-03-16 21:36:44,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:44,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125 [2025-03-16 21:36:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:44,359 INFO L225 Difference]: With dead ends: 715 [2025-03-16 21:36:44,359 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:44,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:44,360 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 552 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:44,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 897 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4625322997416021) internal successors, (566), 387 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 572 transitions. [2025-03-16 21:36:44,368 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 572 transitions. Word has length 125 [2025-03-16 21:36:44,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:44,369 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 572 transitions. [2025-03-16 21:36:44,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 572 transitions. [2025-03-16 21:36:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 21:36:44,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:44,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:44,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:36:44,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:44,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:44,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1407914815, now seen corresponding path program 1 times [2025-03-16 21:36:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105558976] [2025-03-16 21:36:44,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:44,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:44,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 21:36:44,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 21:36:44,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:44,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:44,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:44,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105558976] [2025-03-16 21:36:44,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105558976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:44,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:44,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013017113] [2025-03-16 21:36:44,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:44,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:44,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:44,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:44,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:44,651 INFO L87 Difference]: Start difference. First operand 392 states and 572 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:36:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:44,826 INFO L93 Difference]: Finished difference Result 715 states and 1041 transitions. [2025-03-16 21:36:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:44,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 126 [2025-03-16 21:36:44,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:44,828 INFO L225 Difference]: With dead ends: 715 [2025-03-16 21:36:44,828 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:44,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:44,829 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 518 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:44,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 925 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4599483204134367) internal successors, (565), 387 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 571 transitions. [2025-03-16 21:36:44,837 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 571 transitions. Word has length 126 [2025-03-16 21:36:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:44,838 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 571 transitions. [2025-03-16 21:36:44,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:36:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 571 transitions. [2025-03-16 21:36:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 21:36:44,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:44,839 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:44,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 21:36:44,839 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:44,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:44,839 INFO L85 PathProgramCache]: Analyzing trace with hash -496071274, now seen corresponding path program 1 times [2025-03-16 21:36:44,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:44,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339875667] [2025-03-16 21:36:44,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:44,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:44,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 21:36:44,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 21:36:44,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:44,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:45,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:45,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339875667] [2025-03-16 21:36:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339875667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:45,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:45,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:45,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499850543] [2025-03-16 21:36:45,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:45,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:45,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:45,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:45,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:45,113 INFO L87 Difference]: Start difference. First operand 392 states and 571 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:36:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:45,284 INFO L93 Difference]: Finished difference Result 715 states and 1039 transitions. [2025-03-16 21:36:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:45,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 127 [2025-03-16 21:36:45,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:45,286 INFO L225 Difference]: With dead ends: 715 [2025-03-16 21:36:45,286 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:45,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:45,287 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 516 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:45,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 925 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:45,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4573643410852712) internal successors, (564), 387 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 570 transitions. [2025-03-16 21:36:45,296 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 570 transitions. Word has length 127 [2025-03-16 21:36:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:45,296 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 570 transitions. [2025-03-16 21:36:45,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 21:36:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 570 transitions. [2025-03-16 21:36:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 21:36:45,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:45,299 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:45,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:36:45,299 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:45,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash 703887903, now seen corresponding path program 1 times [2025-03-16 21:36:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:45,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534776130] [2025-03-16 21:36:45,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:45,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:45,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 21:36:45,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 21:36:45,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:45,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:45,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:45,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534776130] [2025-03-16 21:36:45,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534776130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:45,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:45,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615382379] [2025-03-16 21:36:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:45,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:45,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:45,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:45,631 INFO L87 Difference]: Start difference. First operand 392 states and 570 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:45,887 INFO L93 Difference]: Finished difference Result 717 states and 1039 transitions. [2025-03-16 21:36:45,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:45,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 128 [2025-03-16 21:36:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:45,889 INFO L225 Difference]: With dead ends: 717 [2025-03-16 21:36:45,889 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:45,889 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 21:36:45,890 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:45,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1286 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.454780361757106) internal successors, (563), 387 states have internal predecessors, (563), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 569 transitions. [2025-03-16 21:36:45,897 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 569 transitions. Word has length 128 [2025-03-16 21:36:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:45,897 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 569 transitions. [2025-03-16 21:36:45,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 569 transitions. [2025-03-16 21:36:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 21:36:45,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:45,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:45,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 21:36:45,899 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:45,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash -882640465, now seen corresponding path program 1 times [2025-03-16 21:36:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:45,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129427865] [2025-03-16 21:36:45,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:45,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:45,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 21:36:45,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 21:36:45,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:45,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:46,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129427865] [2025-03-16 21:36:46,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129427865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:46,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:46,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945210645] [2025-03-16 21:36:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:46,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:46,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:46,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:46,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:46,207 INFO L87 Difference]: Start difference. First operand 392 states and 569 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:46,418 INFO L93 Difference]: Finished difference Result 715 states and 1035 transitions. [2025-03-16 21:36:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 129 [2025-03-16 21:36:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:46,420 INFO L225 Difference]: With dead ends: 715 [2025-03-16 21:36:46,420 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:46,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:46,421 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 469 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:46,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 885 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4521963824289406) internal successors, (562), 387 states have internal predecessors, (562), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 568 transitions. [2025-03-16 21:36:46,431 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 568 transitions. Word has length 129 [2025-03-16 21:36:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:46,432 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 568 transitions. [2025-03-16 21:36:46,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 568 transitions. [2025-03-16 21:36:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 21:36:46,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:46,433 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:46,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 21:36:46,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:46,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1202337266, now seen corresponding path program 1 times [2025-03-16 21:36:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:46,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300699821] [2025-03-16 21:36:46,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:46,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:46,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 21:36:46,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 21:36:46,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:46,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:46,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300699821] [2025-03-16 21:36:46,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300699821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:46,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:46,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984744652] [2025-03-16 21:36:46,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:46,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:46,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:46,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:46,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:46,756 INFO L87 Difference]: Start difference. First operand 392 states and 568 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:46,972 INFO L93 Difference]: Finished difference Result 715 states and 1033 transitions. [2025-03-16 21:36:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:46,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130 [2025-03-16 21:36:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:46,974 INFO L225 Difference]: With dead ends: 715 [2025-03-16 21:36:46,974 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:46,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:46,976 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 926 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:46,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 885 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.449612403100775) internal successors, (561), 387 states have internal predecessors, (561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 567 transitions. [2025-03-16 21:36:46,984 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 567 transitions. Word has length 130 [2025-03-16 21:36:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:46,985 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 567 transitions. [2025-03-16 21:36:46,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 567 transitions. [2025-03-16 21:36:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 21:36:46,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:46,986 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:46,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 21:36:46,986 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:46,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:46,987 INFO L85 PathProgramCache]: Analyzing trace with hash -132021469, now seen corresponding path program 1 times [2025-03-16 21:36:46,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:46,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491754692] [2025-03-16 21:36:46,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:46,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:47,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 21:36:47,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 21:36:47,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:47,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:47,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:47,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491754692] [2025-03-16 21:36:47,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491754692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:47,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:47,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227532398] [2025-03-16 21:36:47,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:47,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:47,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:47,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:47,294 INFO L87 Difference]: Start difference. First operand 392 states and 567 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:47,516 INFO L93 Difference]: Finished difference Result 715 states and 1031 transitions. [2025-03-16 21:36:47,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:47,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131 [2025-03-16 21:36:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:47,518 INFO L225 Difference]: With dead ends: 715 [2025-03-16 21:36:47,518 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 21:36:47,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:47,519 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 464 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:47,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 891 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 21:36:47,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-16 21:36:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4470284237726099) internal successors, (560), 387 states have internal predecessors, (560), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 566 transitions. [2025-03-16 21:36:47,528 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 566 transitions. Word has length 131 [2025-03-16 21:36:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:47,528 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 566 transitions. [2025-03-16 21:36:47,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 566 transitions. [2025-03-16 21:36:47,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 21:36:47,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:47,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:47,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 21:36:47,529 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:47,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:47,530 INFO L85 PathProgramCache]: Analyzing trace with hash -121325496, now seen corresponding path program 1 times [2025-03-16 21:36:47,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:47,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880279287] [2025-03-16 21:36:47,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:47,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:47,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 21:36:47,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 21:36:47,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:47,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:47,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:47,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880279287] [2025-03-16 21:36:47,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880279287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:47,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:47,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:36:47,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344349176] [2025-03-16 21:36:47,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:47,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:36:47,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:47,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:36:47,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:36:47,842 INFO L87 Difference]: Start difference. First operand 392 states and 566 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:48,312 INFO L93 Difference]: Finished difference Result 779 states and 1122 transitions. [2025-03-16 21:36:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:36:48,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 132 [2025-03-16 21:36:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:48,315 INFO L225 Difference]: With dead ends: 779 [2025-03-16 21:36:48,315 INFO L226 Difference]: Without dead ends: 396 [2025-03-16 21:36:48,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:36:48,316 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 600 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:48,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 2270 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:36:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-16 21:36:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394. [2025-03-16 21:36:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.442159383033419) internal successors, (561), 389 states have internal predecessors, (561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 21:36:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 567 transitions. [2025-03-16 21:36:48,328 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 567 transitions. Word has length 132 [2025-03-16 21:36:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:48,328 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 567 transitions. [2025-03-16 21:36:48,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 567 transitions. [2025-03-16 21:36:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 21:36:48,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:48,330 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:48,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 21:36:48,330 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:48,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:48,330 INFO L85 PathProgramCache]: Analyzing trace with hash -129999352, now seen corresponding path program 1 times [2025-03-16 21:36:48,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:48,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011541435] [2025-03-16 21:36:48,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:48,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:48,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 21:36:48,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 21:36:48,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:48,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 21:36:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011541435] [2025-03-16 21:36:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011541435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:48,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:48,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:36:48,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204852966] [2025-03-16 21:36:48,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:48,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:36:48,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:48,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:36:48,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:48,853 INFO L87 Difference]: Start difference. First operand 394 states and 567 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:49,135 INFO L93 Difference]: Finished difference Result 841 states and 1198 transitions. [2025-03-16 21:36:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:36:49,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133 [2025-03-16 21:36:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:49,137 INFO L225 Difference]: With dead ends: 841 [2025-03-16 21:36:49,137 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 21:36:49,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:36:49,138 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 697 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:49,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1818 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 21:36:49,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 21:36:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.419291338582677) internal successors, (721), 508 states have internal predecessors, (721), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 733 transitions. [2025-03-16 21:36:49,151 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 733 transitions. Word has length 133 [2025-03-16 21:36:49,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:49,152 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 733 transitions. [2025-03-16 21:36:49,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:36:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 733 transitions. [2025-03-16 21:36:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-16 21:36:49,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:49,155 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:49,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 21:36:49,155 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:49,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1810076834, now seen corresponding path program 1 times [2025-03-16 21:36:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:49,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804613675] [2025-03-16 21:36:49,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:49,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:49,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 21:36:49,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 21:36:49,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:49,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:36:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:49,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804613675] [2025-03-16 21:36:49,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804613675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:49,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:49,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512156489] [2025-03-16 21:36:49,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:49,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:49,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:49,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:49,594 INFO L87 Difference]: Start difference. First operand 516 states and 733 transitions. Second operand has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:49,775 INFO L93 Difference]: Finished difference Result 841 states and 1197 transitions. [2025-03-16 21:36:49,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:49,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 321 [2025-03-16 21:36:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:49,778 INFO L225 Difference]: With dead ends: 841 [2025-03-16 21:36:49,778 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 21:36:49,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:49,779 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 936 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:49,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 883 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 21:36:49,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 21:36:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4173228346456692) internal successors, (720), 508 states have internal predecessors, (720), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 732 transitions. [2025-03-16 21:36:49,795 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 732 transitions. Word has length 321 [2025-03-16 21:36:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:49,796 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 732 transitions. [2025-03-16 21:36:49,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 732 transitions. [2025-03-16 21:36:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-16 21:36:49,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:49,799 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:49,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 21:36:49,800 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:49,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:49,800 INFO L85 PathProgramCache]: Analyzing trace with hash -317520216, now seen corresponding path program 1 times [2025-03-16 21:36:49,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:49,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10453024] [2025-03-16 21:36:49,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:49,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:49,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-16 21:36:49,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-16 21:36:49,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:49,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:36:50,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10453024] [2025-03-16 21:36:50,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10453024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:50,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:50,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:50,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402328239] [2025-03-16 21:36:50,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:50,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:50,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:50,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:50,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:50,233 INFO L87 Difference]: Start difference. First operand 516 states and 732 transitions. Second operand has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:50,440 INFO L93 Difference]: Finished difference Result 841 states and 1195 transitions. [2025-03-16 21:36:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:50,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 322 [2025-03-16 21:36:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:50,443 INFO L225 Difference]: With dead ends: 841 [2025-03-16 21:36:50,443 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 21:36:50,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:50,445 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 920 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:50,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 883 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 21:36:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 21:36:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4153543307086613) internal successors, (719), 508 states have internal predecessors, (719), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 731 transitions. [2025-03-16 21:36:50,460 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 731 transitions. Word has length 322 [2025-03-16 21:36:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:50,460 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 731 transitions. [2025-03-16 21:36:50,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 731 transitions. [2025-03-16 21:36:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-16 21:36:50,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:50,463 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:50,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 21:36:50,464 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:50,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:50,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1071195729, now seen corresponding path program 1 times [2025-03-16 21:36:50,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:50,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990955866] [2025-03-16 21:36:50,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:50,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-16 21:36:50,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-16 21:36:50,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:50,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:36:50,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990955866] [2025-03-16 21:36:50,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990955866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:50,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:50,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:50,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643909185] [2025-03-16 21:36:50,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:50,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:50,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:50,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:50,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:50,968 INFO L87 Difference]: Start difference. First operand 516 states and 731 transitions. Second operand has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:51,148 INFO L93 Difference]: Finished difference Result 841 states and 1193 transitions. [2025-03-16 21:36:51,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:51,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323 [2025-03-16 21:36:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:51,151 INFO L225 Difference]: With dead ends: 841 [2025-03-16 21:36:51,151 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 21:36:51,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:51,151 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 498 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:51,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 889 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:51,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 21:36:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 21:36:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4133858267716535) internal successors, (718), 508 states have internal predecessors, (718), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 730 transitions. [2025-03-16 21:36:51,166 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 730 transitions. Word has length 323 [2025-03-16 21:36:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:51,167 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 730 transitions. [2025-03-16 21:36:51,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 730 transitions. [2025-03-16 21:36:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 21:36:51,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:51,169 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:51,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 21:36:51,170 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:51,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1083323047, now seen corresponding path program 1 times [2025-03-16 21:36:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:51,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779174766] [2025-03-16 21:36:51,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:51,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:51,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 21:36:51,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 21:36:51,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:51,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:36:51,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:51,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779174766] [2025-03-16 21:36:51,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779174766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:51,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:51,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:51,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796310091] [2025-03-16 21:36:51,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:51,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:51,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:51,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:51,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:51,597 INFO L87 Difference]: Start difference. First operand 516 states and 730 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:51,770 INFO L93 Difference]: Finished difference Result 841 states and 1191 transitions. [2025-03-16 21:36:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:51,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2025-03-16 21:36:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:51,772 INFO L225 Difference]: With dead ends: 841 [2025-03-16 21:36:51,773 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 21:36:51,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:51,774 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 490 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:51,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 889 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:51,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 21:36:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 21:36:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4114173228346456) internal successors, (717), 508 states have internal predecessors, (717), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 729 transitions. [2025-03-16 21:36:51,786 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 729 transitions. Word has length 324 [2025-03-16 21:36:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:51,786 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 729 transitions. [2025-03-16 21:36:51,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 729 transitions. [2025-03-16 21:36:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-16 21:36:51,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:51,789 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:51,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 21:36:51,789 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:51,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:51,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1957255808, now seen corresponding path program 1 times [2025-03-16 21:36:51,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:51,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839760702] [2025-03-16 21:36:51,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:51,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:51,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-16 21:36:51,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-16 21:36:51,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:51,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:36:52,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839760702] [2025-03-16 21:36:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839760702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:52,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:52,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:52,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039833954] [2025-03-16 21:36:52,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:52,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:52,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:52,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:52,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:52,246 INFO L87 Difference]: Start difference. First operand 516 states and 729 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:52,447 INFO L93 Difference]: Finished difference Result 841 states and 1189 transitions. [2025-03-16 21:36:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:52,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2025-03-16 21:36:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:52,450 INFO L225 Difference]: With dead ends: 841 [2025-03-16 21:36:52,450 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 21:36:52,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:52,451 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 865 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:52,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 899 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 21:36:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 21:36:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4094488188976377) internal successors, (716), 508 states have internal predecessors, (716), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 728 transitions. [2025-03-16 21:36:52,462 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 728 transitions. Word has length 325 [2025-03-16 21:36:52,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:52,462 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 728 transitions. [2025-03-16 21:36:52,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 728 transitions. [2025-03-16 21:36:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-16 21:36:52,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:52,465 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:52,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 21:36:52,465 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:52,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:52,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1308710518, now seen corresponding path program 1 times [2025-03-16 21:36:52,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:52,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997920203] [2025-03-16 21:36:52,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:52,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:52,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-16 21:36:52,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-16 21:36:52,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:52,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:36:52,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:52,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997920203] [2025-03-16 21:36:52,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997920203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:52,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:52,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:52,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360247519] [2025-03-16 21:36:52,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:52,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:52,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:52,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:52,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:52,912 INFO L87 Difference]: Start difference. First operand 516 states and 728 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:53,071 INFO L93 Difference]: Finished difference Result 841 states and 1187 transitions. [2025-03-16 21:36:53,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:53,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2025-03-16 21:36:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:53,073 INFO L225 Difference]: With dead ends: 841 [2025-03-16 21:36:53,074 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 21:36:53,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:53,075 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 849 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:53,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 899 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:53,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 21:36:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 21:36:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4074803149606299) internal successors, (715), 508 states have internal predecessors, (715), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 727 transitions. [2025-03-16 21:36:53,088 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 727 transitions. Word has length 326 [2025-03-16 21:36:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:53,088 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 727 transitions. [2025-03-16 21:36:53,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 727 transitions. [2025-03-16 21:36:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-16 21:36:53,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:53,092 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:53,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 21:36:53,092 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:53,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1148121391, now seen corresponding path program 1 times [2025-03-16 21:36:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:53,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135356557] [2025-03-16 21:36:53,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:53,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:53,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-16 21:36:53,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-16 21:36:53,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:53,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:36:53,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:53,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135356557] [2025-03-16 21:36:53,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135356557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:53,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:53,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:53,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176056614] [2025-03-16 21:36:53,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:53,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:53,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:53,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:53,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:53,665 INFO L87 Difference]: Start difference. First operand 516 states and 727 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:53,961 INFO L93 Difference]: Finished difference Result 841 states and 1185 transitions. [2025-03-16 21:36:53,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:53,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2025-03-16 21:36:53,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:53,964 INFO L225 Difference]: With dead ends: 841 [2025-03-16 21:36:53,964 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 21:36:53,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:53,965 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 789 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:53,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 673 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:36:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 21:36:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 21:36:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.405511811023622) internal successors, (714), 508 states have internal predecessors, (714), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 726 transitions. [2025-03-16 21:36:53,980 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 726 transitions. Word has length 327 [2025-03-16 21:36:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:53,980 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 726 transitions. [2025-03-16 21:36:53,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 726 transitions. [2025-03-16 21:36:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-16 21:36:53,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:53,982 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:53,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 21:36:53,983 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:53,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1965761733, now seen corresponding path program 1 times [2025-03-16 21:36:53,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:53,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006711664] [2025-03-16 21:36:53,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:54,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-16 21:36:54,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-16 21:36:54,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:54,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:36:54,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:54,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006711664] [2025-03-16 21:36:54,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006711664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:54,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:54,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:54,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760823326] [2025-03-16 21:36:54,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:54,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:54,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:54,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:54,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:54,680 INFO L87 Difference]: Start difference. First operand 516 states and 726 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:54,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:54,833 INFO L93 Difference]: Finished difference Result 841 states and 1183 transitions. [2025-03-16 21:36:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:54,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2025-03-16 21:36:54,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:54,835 INFO L225 Difference]: With dead ends: 841 [2025-03-16 21:36:54,835 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 21:36:54,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:54,836 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 381 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:54,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 897 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 21:36:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 21:36:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4035433070866141) internal successors, (713), 508 states have internal predecessors, (713), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 725 transitions. [2025-03-16 21:36:54,848 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 725 transitions. Word has length 328 [2025-03-16 21:36:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:54,849 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 725 transitions. [2025-03-16 21:36:54,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:54,849 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 725 transitions. [2025-03-16 21:36:54,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-16 21:36:54,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:54,850 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:54,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 21:36:54,851 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:54,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:54,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1217502118, now seen corresponding path program 1 times [2025-03-16 21:36:54,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:54,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106853977] [2025-03-16 21:36:54,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:54,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:54,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-16 21:36:55,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-16 21:36:55,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:55,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:36:55,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:55,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106853977] [2025-03-16 21:36:55,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106853977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:55,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:55,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:55,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390347217] [2025-03-16 21:36:55,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:55,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:55,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:55,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:55,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:55,459 INFO L87 Difference]: Start difference. First operand 516 states and 725 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:55,653 INFO L93 Difference]: Finished difference Result 841 states and 1181 transitions. [2025-03-16 21:36:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:55,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2025-03-16 21:36:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:55,655 INFO L225 Difference]: With dead ends: 841 [2025-03-16 21:36:55,655 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 21:36:55,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:55,656 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 453 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:55,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 881 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 21:36:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 21:36:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.4015748031496063) internal successors, (712), 508 states have internal predecessors, (712), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 724 transitions. [2025-03-16 21:36:55,666 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 724 transitions. Word has length 329 [2025-03-16 21:36:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:55,666 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 724 transitions. [2025-03-16 21:36:55,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 724 transitions. [2025-03-16 21:36:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-16 21:36:55,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:55,668 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:55,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 21:36:55,668 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:55,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1462308975, now seen corresponding path program 1 times [2025-03-16 21:36:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:55,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411546089] [2025-03-16 21:36:55,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:55,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:55,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-16 21:36:55,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-16 21:36:55,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:55,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:36:56,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:56,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411546089] [2025-03-16 21:36:56,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411546089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:56,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:56,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:56,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608874026] [2025-03-16 21:36:56,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:56,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:56,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:56,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:56,317 INFO L87 Difference]: Start difference. First operand 516 states and 724 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:56,531 INFO L93 Difference]: Finished difference Result 841 states and 1179 transitions. [2025-03-16 21:36:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:56,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2025-03-16 21:36:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:56,533 INFO L225 Difference]: With dead ends: 841 [2025-03-16 21:36:56,533 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 21:36:56,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:56,533 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 850 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:56,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 875 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 21:36:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 21:36:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.3996062992125984) internal successors, (711), 508 states have internal predecessors, (711), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 723 transitions. [2025-03-16 21:36:56,546 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 723 transitions. Word has length 330 [2025-03-16 21:36:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:56,546 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 723 transitions. [2025-03-16 21:36:56,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 723 transitions. [2025-03-16 21:36:56,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-16 21:36:56,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:56,549 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:56,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 21:36:56,549 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:56,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1005575427, now seen corresponding path program 1 times [2025-03-16 21:36:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:56,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268895134] [2025-03-16 21:36:56,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:56,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:56,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-16 21:36:56,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-16 21:36:56,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:56,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:36:57,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:57,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268895134] [2025-03-16 21:36:57,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268895134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:57,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:57,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327356613] [2025-03-16 21:36:57,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:57,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:57,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:57,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:57,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:57,236 INFO L87 Difference]: Start difference. First operand 516 states and 723 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:57,415 INFO L93 Difference]: Finished difference Result 841 states and 1177 transitions. [2025-03-16 21:36:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:57,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331 [2025-03-16 21:36:57,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:57,417 INFO L225 Difference]: With dead ends: 841 [2025-03-16 21:36:57,417 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 21:36:57,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:57,419 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 390 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:57,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 875 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 21:36:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 21:36:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.3976377952755905) internal successors, (710), 508 states have internal predecessors, (710), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 722 transitions. [2025-03-16 21:36:57,428 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 722 transitions. Word has length 331 [2025-03-16 21:36:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:57,428 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 722 transitions. [2025-03-16 21:36:57,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 722 transitions. [2025-03-16 21:36:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-16 21:36:57,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:57,430 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:57,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 21:36:57,430 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:57,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1769034230, now seen corresponding path program 1 times [2025-03-16 21:36:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:57,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732871075] [2025-03-16 21:36:57,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:57,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-16 21:36:57,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-16 21:36:57,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:57,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 21:36:58,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:58,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732871075] [2025-03-16 21:36:58,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732871075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:58,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:58,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741631554] [2025-03-16 21:36:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:58,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:58,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:58,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:58,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:58,392 INFO L87 Difference]: Start difference. First operand 516 states and 722 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:58,589 INFO L93 Difference]: Finished difference Result 931 states and 1285 transitions. [2025-03-16 21:36:58,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:36:58,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2025-03-16 21:36:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:58,592 INFO L225 Difference]: With dead ends: 931 [2025-03-16 21:36:58,592 INFO L226 Difference]: Without dead ends: 604 [2025-03-16 21:36:58,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:58,593 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 18 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:58,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1800 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-16 21:36:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 600. [2025-03-16 21:36:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 592 states have (on average 1.3682432432432432) internal successors, (810), 592 states have internal predecessors, (810), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 21:36:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 822 transitions. [2025-03-16 21:36:58,601 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 822 transitions. Word has length 332 [2025-03-16 21:36:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:58,602 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 822 transitions. [2025-03-16 21:36:58,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 822 transitions. [2025-03-16 21:36:58,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-16 21:36:58,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:58,603 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:58,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 21:36:58,604 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:58,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:58,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1450962100, now seen corresponding path program 1 times [2025-03-16 21:36:58,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:58,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985464388] [2025-03-16 21:36:58,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:58,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:58,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-16 21:36:58,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-16 21:36:58,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:58,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:36:59,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:59,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985464388] [2025-03-16 21:36:59,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985464388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:59,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:59,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:36:59,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916916449] [2025-03-16 21:36:59,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:59,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:36:59,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:59,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:36:59,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:59,286 INFO L87 Difference]: Start difference. First operand 600 states and 822 transitions. Second operand has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:59,807 INFO L93 Difference]: Finished difference Result 1404 states and 1930 transitions. [2025-03-16 21:36:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:36:59,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 334 [2025-03-16 21:36:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:59,810 INFO L225 Difference]: With dead ends: 1404 [2025-03-16 21:36:59,810 INFO L226 Difference]: Without dead ends: 1037 [2025-03-16 21:36:59,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 21:36:59,811 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 351 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:59,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1890 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:36:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-03-16 21:36:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 923. [2025-03-16 21:36:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 912 states have (on average 1.3640350877192982) internal successors, (1244), 912 states have internal predecessors, (1244), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-16 21:36:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1262 transitions. [2025-03-16 21:36:59,826 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1262 transitions. Word has length 334 [2025-03-16 21:36:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:59,826 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1262 transitions. [2025-03-16 21:36:59,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:36:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1262 transitions. [2025-03-16 21:36:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-16 21:36:59,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:59,828 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:59,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 21:36:59,829 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:59,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:59,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1534612066, now seen corresponding path program 1 times [2025-03-16 21:36:59,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:59,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507941447] [2025-03-16 21:36:59,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:59,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:59,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-16 21:37:00,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-16 21:37:00,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:00,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-16 21:37:00,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:00,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507941447] [2025-03-16 21:37:00,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507941447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:00,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:00,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:37:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042944028] [2025-03-16 21:37:00,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:00,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:37:00,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:00,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:37:00,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:00,770 INFO L87 Difference]: Start difference. First operand 923 states and 1262 transitions. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:01,168 INFO L93 Difference]: Finished difference Result 1734 states and 2361 transitions. [2025-03-16 21:37:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:37:01,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 335 [2025-03-16 21:37:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:01,171 INFO L225 Difference]: With dead ends: 1734 [2025-03-16 21:37:01,171 INFO L226 Difference]: Without dead ends: 929 [2025-03-16 21:37:01,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:37:01,175 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 511 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:01,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1304 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-16 21:37:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 926. [2025-03-16 21:37:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 915 states have (on average 1.3628415300546448) internal successors, (1247), 915 states have internal predecessors, (1247), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-16 21:37:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1265 transitions. [2025-03-16 21:37:01,196 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1265 transitions. Word has length 335 [2025-03-16 21:37:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:01,196 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1265 transitions. [2025-03-16 21:37:01,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1265 transitions. [2025-03-16 21:37:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-03-16 21:37:01,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:01,199 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:01,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 21:37:01,199 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:01,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1559687964, now seen corresponding path program 1 times [2025-03-16 21:37:01,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:01,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425924492] [2025-03-16 21:37:01,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:01,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-16 21:37:01,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-16 21:37:01,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:01,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 21:37:02,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:02,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425924492] [2025-03-16 21:37:02,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425924492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:02,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:02,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:02,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827371262] [2025-03-16 21:37:02,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:02,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:02,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:02,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:02,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:02,491 INFO L87 Difference]: Start difference. First operand 926 states and 1265 transitions. Second operand has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:02,761 INFO L93 Difference]: Finished difference Result 1600 states and 2160 transitions. [2025-03-16 21:37:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:37:02,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 337 [2025-03-16 21:37:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:02,767 INFO L225 Difference]: With dead ends: 1600 [2025-03-16 21:37:02,767 INFO L226 Difference]: Without dead ends: 950 [2025-03-16 21:37:02,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:02,768 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 322 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:02,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1004 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-03-16 21:37:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 944. [2025-03-16 21:37:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 933 states have (on average 1.3558413719185423) internal successors, (1265), 933 states have internal predecessors, (1265), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-16 21:37:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1283 transitions. [2025-03-16 21:37:02,781 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1283 transitions. Word has length 337 [2025-03-16 21:37:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:02,781 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1283 transitions. [2025-03-16 21:37:02,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1283 transitions. [2025-03-16 21:37:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-16 21:37:02,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:02,783 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:02,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 21:37:02,784 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:02,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash 295269890, now seen corresponding path program 1 times [2025-03-16 21:37:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:02,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595085503] [2025-03-16 21:37:02,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:02,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:02,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-16 21:37:03,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-16 21:37:03,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:03,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-16 21:37:03,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:03,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595085503] [2025-03-16 21:37:03,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595085503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:03,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:03,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:37:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700105275] [2025-03-16 21:37:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:03,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:37:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:03,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:37:03,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:03,564 INFO L87 Difference]: Start difference. First operand 944 states and 1283 transitions. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:03,804 INFO L93 Difference]: Finished difference Result 2094 states and 2820 transitions. [2025-03-16 21:37:03,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:37:03,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339 [2025-03-16 21:37:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:03,808 INFO L225 Difference]: With dead ends: 2094 [2025-03-16 21:37:03,808 INFO L226 Difference]: Without dead ends: 1414 [2025-03-16 21:37:03,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:37:03,809 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 755 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:03,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 2083 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:37:03,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-16 21:37:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1188. [2025-03-16 21:37:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1171 states have (on average 1.3706233988044407) internal successors, (1605), 1171 states have internal predecessors, (1605), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 21:37:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1635 transitions. [2025-03-16 21:37:03,826 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1635 transitions. Word has length 339 [2025-03-16 21:37:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:03,827 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1635 transitions. [2025-03-16 21:37:03,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1635 transitions. [2025-03-16 21:37:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-16 21:37:03,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:03,829 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:03,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 21:37:03,829 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:03,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:03,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1045756812, now seen corresponding path program 1 times [2025-03-16 21:37:03,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:03,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791776175] [2025-03-16 21:37:03,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:03,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:03,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-16 21:37:04,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-16 21:37:04,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:04,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 21:37:04,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:04,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791776175] [2025-03-16 21:37:04,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791776175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:04,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:04,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:37:04,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262882195] [2025-03-16 21:37:04,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:04,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:37:04,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:04,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:37:04,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:04,935 INFO L87 Difference]: Start difference. First operand 1188 states and 1635 transitions. Second operand has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:05,342 INFO L93 Difference]: Finished difference Result 2042 states and 2728 transitions. [2025-03-16 21:37:05,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:37:05,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 339 [2025-03-16 21:37:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:05,346 INFO L225 Difference]: With dead ends: 2042 [2025-03-16 21:37:05,346 INFO L226 Difference]: Without dead ends: 1386 [2025-03-16 21:37:05,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 21:37:05,347 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 350 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:05,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1360 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2025-03-16 21:37:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1170. [2025-03-16 21:37:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1153 states have (on average 1.3712055507372072) internal successors, (1581), 1153 states have internal predecessors, (1581), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 21:37:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1611 transitions. [2025-03-16 21:37:05,374 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1611 transitions. Word has length 339 [2025-03-16 21:37:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:05,374 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1611 transitions. [2025-03-16 21:37:05,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 21:37:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1611 transitions. [2025-03-16 21:37:05,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-16 21:37:05,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:05,378 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:05,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 21:37:05,378 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:05,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:05,379 INFO L85 PathProgramCache]: Analyzing trace with hash -672507582, now seen corresponding path program 1 times [2025-03-16 21:37:05,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:05,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076371967] [2025-03-16 21:37:05,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:05,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:05,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-16 21:37:05,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-16 21:37:05,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:05,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:37:06,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:06,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076371967] [2025-03-16 21:37:06,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076371967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:06,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:06,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:37:06,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037283676] [2025-03-16 21:37:06,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:06,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:37:06,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:06,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:37:06,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:06,166 INFO L87 Difference]: Start difference. First operand 1170 states and 1611 transitions. Second operand has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:06,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:06,598 INFO L93 Difference]: Finished difference Result 1561 states and 2147 transitions. [2025-03-16 21:37:06,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:37:06,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339 [2025-03-16 21:37:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:06,602 INFO L225 Difference]: With dead ends: 1561 [2025-03-16 21:37:06,602 INFO L226 Difference]: Without dead ends: 1193 [2025-03-16 21:37:06,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 21:37:06,603 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 999 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:06,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 1310 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-03-16 21:37:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1171. [2025-03-16 21:37:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1154 states have (on average 1.3708838821490468) internal successors, (1582), 1154 states have internal predecessors, (1582), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 21:37:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1612 transitions. [2025-03-16 21:37:06,620 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1612 transitions. Word has length 339 [2025-03-16 21:37:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:06,621 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1612 transitions. [2025-03-16 21:37:06,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1612 transitions. [2025-03-16 21:37:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-16 21:37:06,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:06,623 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:06,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 21:37:06,624 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:06,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1170902095, now seen corresponding path program 1 times [2025-03-16 21:37:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:06,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365433820] [2025-03-16 21:37:06,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:06,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-16 21:37:06,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-16 21:37:06,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:06,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-16 21:37:07,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:07,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365433820] [2025-03-16 21:37:07,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365433820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:07,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:07,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:37:07,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959865575] [2025-03-16 21:37:07,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:07,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:37:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:07,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:37:07,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:37:07,650 INFO L87 Difference]: Start difference. First operand 1171 states and 1612 transitions. Second operand has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:08,721 INFO L93 Difference]: Finished difference Result 2561 states and 3510 transitions. [2025-03-16 21:37:08,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:37:08,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339 [2025-03-16 21:37:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:08,726 INFO L225 Difference]: With dead ends: 2561 [2025-03-16 21:37:08,726 INFO L226 Difference]: Without dead ends: 2053 [2025-03-16 21:37:08,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:37:08,726 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 1312 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:08,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 3567 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 21:37:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2025-03-16 21:37:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1311. [2025-03-16 21:37:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1288 states have (on average 1.3726708074534162) internal successors, (1768), 1288 states have internal predecessors, (1768), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 21:37:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1810 transitions. [2025-03-16 21:37:08,746 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1810 transitions. Word has length 339 [2025-03-16 21:37:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:08,746 INFO L471 AbstractCegarLoop]: Abstraction has 1311 states and 1810 transitions. [2025-03-16 21:37:08,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1810 transitions. [2025-03-16 21:37:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-16 21:37:08,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:08,749 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:08,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 21:37:08,749 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:08,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:08,750 INFO L85 PathProgramCache]: Analyzing trace with hash 36372008, now seen corresponding path program 1 times [2025-03-16 21:37:08,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:08,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442325285] [2025-03-16 21:37:08,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:08,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:08,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-16 21:37:09,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-16 21:37:09,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:09,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 21:37:10,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442325285] [2025-03-16 21:37:10,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442325285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:10,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:10,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 21:37:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282265090] [2025-03-16 21:37:10,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:10,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 21:37:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:10,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 21:37:10,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:37:10,143 INFO L87 Difference]: Start difference. First operand 1311 states and 1810 transitions. Second operand has 11 states, 11 states have (on average 24.545454545454547) internal successors, (270), 11 states have internal predecessors, (270), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 21:37:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:11,134 INFO L93 Difference]: Finished difference Result 2822 states and 3833 transitions. [2025-03-16 21:37:11,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 21:37:11,134 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 24.545454545454547) internal successors, (270), 11 states have internal predecessors, (270), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 340 [2025-03-16 21:37:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:11,140 INFO L225 Difference]: With dead ends: 2822 [2025-03-16 21:37:11,140 INFO L226 Difference]: Without dead ends: 2099 [2025-03-16 21:37:11,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-03-16 21:37:11,142 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 1728 mSDsluCounter, 2553 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:11,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 3042 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 21:37:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2025-03-16 21:37:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1454. [2025-03-16 21:37:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1424 states have (on average 1.3799157303370786) internal successors, (1965), 1424 states have internal predecessors, (1965), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-16 21:37:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2021 transitions. [2025-03-16 21:37:11,168 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2021 transitions. Word has length 340 [2025-03-16 21:37:11,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:11,168 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 2021 transitions. [2025-03-16 21:37:11,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.545454545454547) internal successors, (270), 11 states have internal predecessors, (270), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 21:37:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2021 transitions. [2025-03-16 21:37:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-16 21:37:11,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:11,171 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:11,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 21:37:11,171 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:11,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash -560707216, now seen corresponding path program 1 times [2025-03-16 21:37:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:11,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18955731] [2025-03-16 21:37:11,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:11,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-16 21:37:11,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-16 21:37:11,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:11,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-16 21:37:11,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18955731] [2025-03-16 21:37:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18955731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:37:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477612763] [2025-03-16 21:37:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:11,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:37:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:11,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:37:11,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:37:11,923 INFO L87 Difference]: Start difference. First operand 1454 states and 2021 transitions. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 21:37:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:12,291 INFO L93 Difference]: Finished difference Result 2552 states and 3538 transitions. [2025-03-16 21:37:12,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:37:12,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 342 [2025-03-16 21:37:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:12,295 INFO L225 Difference]: With dead ends: 2552 [2025-03-16 21:37:12,295 INFO L226 Difference]: Without dead ends: 1482 [2025-03-16 21:37:12,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:37:12,296 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 537 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:12,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1306 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-03-16 21:37:12,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1468. [2025-03-16 21:37:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1438 states have (on average 1.3713490959666204) internal successors, (1972), 1438 states have internal predecessors, (1972), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-16 21:37:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2028 transitions. [2025-03-16 21:37:12,318 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2028 transitions. Word has length 342 [2025-03-16 21:37:12,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:12,319 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 2028 transitions. [2025-03-16 21:37:12,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 21:37:12,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2028 transitions. [2025-03-16 21:37:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-16 21:37:12,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:12,321 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:12,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 21:37:12,321 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:12,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash -430468324, now seen corresponding path program 1 times [2025-03-16 21:37:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:12,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210830796] [2025-03-16 21:37:12,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:12,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-16 21:37:12,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-16 21:37:12,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:12,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-16 21:37:13,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:13,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210830796] [2025-03-16 21:37:13,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210830796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:13,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:13,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:37:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386004858] [2025-03-16 21:37:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:13,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:37:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:13,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:37:13,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:37:13,706 INFO L87 Difference]: Start difference. First operand 1468 states and 2028 transitions. Second operand has 8 states, 8 states have (on average 31.875) internal successors, (255), 8 states have internal predecessors, (255), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 21:37:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:14,227 INFO L93 Difference]: Finished difference Result 2572 states and 3538 transitions. [2025-03-16 21:37:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:37:14,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 31.875) internal successors, (255), 8 states have internal predecessors, (255), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 344 [2025-03-16 21:37:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:14,230 INFO L225 Difference]: With dead ends: 2572 [2025-03-16 21:37:14,230 INFO L226 Difference]: Without dead ends: 1524 [2025-03-16 21:37:14,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:37:14,231 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 497 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:14,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1944 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:37:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2025-03-16 21:37:14,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1503. [2025-03-16 21:37:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1473 states have (on average 1.3672776646300069) internal successors, (2014), 1473 states have internal predecessors, (2014), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-16 21:37:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2070 transitions. [2025-03-16 21:37:14,252 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2070 transitions. Word has length 344 [2025-03-16 21:37:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:14,252 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 2070 transitions. [2025-03-16 21:37:14,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.875) internal successors, (255), 8 states have internal predecessors, (255), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 21:37:14,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2070 transitions. [2025-03-16 21:37:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-16 21:37:14,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:14,255 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:14,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 21:37:14,255 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:14,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1148865072, now seen corresponding path program 1 times [2025-03-16 21:37:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:14,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008345640] [2025-03-16 21:37:14,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:14,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:14,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-16 21:37:14,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-16 21:37:14,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:14,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:37:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:15,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008345640] [2025-03-16 21:37:15,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008345640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:37:15,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473359390] [2025-03-16 21:37:15,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:15,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:37:15,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:37:15,838 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 21:37:15,839 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 21:37:16,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-16 21:37:16,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-16 21:37:16,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:16,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:16,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-16 21:37:16,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:37:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 82 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-16 21:37:17,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:37:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:37:18,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473359390] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 21:37:18,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:37:18,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 9] total 26 [2025-03-16 21:37:18,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345215502] [2025-03-16 21:37:18,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:18,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:37:18,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:18,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:37:18,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-03-16 21:37:18,215 INFO L87 Difference]: Start difference. First operand 1503 states and 2070 transitions. Second operand has 10 states, 10 states have (on average 31.9) internal successors, (319), 10 states have internal predecessors, (319), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 21:37:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:18,641 INFO L93 Difference]: Finished difference Result 2384 states and 3262 transitions. [2025-03-16 21:37:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:37:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 31.9) internal successors, (319), 10 states have internal predecessors, (319), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 346 [2025-03-16 21:37:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:18,644 INFO L225 Difference]: With dead ends: 2384 [2025-03-16 21:37:18,644 INFO L226 Difference]: Without dead ends: 1409 [2025-03-16 21:37:18,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 677 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2025-03-16 21:37:18,645 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 2430 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:18,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2431 Valid, 1296 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:18,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-03-16 21:37:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1374. [2025-03-16 21:37:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1351 states have (on average 1.3501110288675056) internal successors, (1824), 1351 states have internal predecessors, (1824), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 21:37:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1866 transitions. [2025-03-16 21:37:18,665 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1866 transitions. Word has length 346 [2025-03-16 21:37:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:18,665 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 1866 transitions. [2025-03-16 21:37:18,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.9) internal successors, (319), 10 states have internal predecessors, (319), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 21:37:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1866 transitions. [2025-03-16 21:37:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-16 21:37:18,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:18,667 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:18,678 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 21:37:18,867 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,SelfDestructingSolverStorable40 [2025-03-16 21:37:18,868 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:18,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash 644088624, now seen corresponding path program 1 times [2025-03-16 21:37:18,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:18,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668553783] [2025-03-16 21:37:18,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:18,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:18,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-16 21:37:19,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-16 21:37:19,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:19,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 21:37:19,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:19,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668553783] [2025-03-16 21:37:19,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668553783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:19,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:19,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:37:19,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875989076] [2025-03-16 21:37:19,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:19,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:37:19,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:19,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:37:19,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:19,745 INFO L87 Difference]: Start difference. First operand 1374 states and 1866 transitions. Second operand has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 21:37:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:20,122 INFO L93 Difference]: Finished difference Result 2216 states and 2997 transitions. [2025-03-16 21:37:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:37:20,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 346 [2025-03-16 21:37:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:20,125 INFO L225 Difference]: With dead ends: 2216 [2025-03-16 21:37:20,125 INFO L226 Difference]: Without dead ends: 1388 [2025-03-16 21:37:20,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:37:20,127 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 486 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:20,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1296 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2025-03-16 21:37:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1381. [2025-03-16 21:37:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1358 states have (on average 1.3483063328424154) internal successors, (1831), 1358 states have internal predecessors, (1831), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 21:37:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1873 transitions. [2025-03-16 21:37:20,146 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1873 transitions. Word has length 346 [2025-03-16 21:37:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:20,146 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1873 transitions. [2025-03-16 21:37:20,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 21:37:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1873 transitions. [2025-03-16 21:37:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 21:37:20,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:20,148 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:20,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 21:37:20,148 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:20,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:20,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1068076806, now seen corresponding path program 1 times [2025-03-16 21:37:20,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:20,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224726052] [2025-03-16 21:37:20,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:20,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 21:37:20,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 21:37:20,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:20,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-16 21:37:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:21,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224726052] [2025-03-16 21:37:21,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224726052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 21:37:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412016264] [2025-03-16 21:37:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:21,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:37:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:21,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:37:21,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:37:21,685 INFO L87 Difference]: Start difference. First operand 1381 states and 1873 transitions. Second operand has 10 states, 10 states have (on average 27.4) internal successors, (274), 10 states have internal predecessors, (274), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 21:37:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:22,556 INFO L93 Difference]: Finished difference Result 2411 states and 3262 transitions. [2025-03-16 21:37:22,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 21:37:22,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.4) internal successors, (274), 10 states have internal predecessors, (274), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 348 [2025-03-16 21:37:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:22,560 INFO L225 Difference]: With dead ends: 2411 [2025-03-16 21:37:22,560 INFO L226 Difference]: Without dead ends: 1770 [2025-03-16 21:37:22,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-16 21:37:22,561 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 1683 mSDsluCounter, 4153 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 4830 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:22,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 4830 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:37:22,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-03-16 21:37:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1455. [2025-03-16 21:37:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1428 states have (on average 1.3480392156862746) internal successors, (1925), 1428 states have internal predecessors, (1925), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-16 21:37:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1975 transitions. [2025-03-16 21:37:22,600 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1975 transitions. Word has length 348 [2025-03-16 21:37:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:22,600 INFO L471 AbstractCegarLoop]: Abstraction has 1455 states and 1975 transitions. [2025-03-16 21:37:22,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.4) internal successors, (274), 10 states have internal predecessors, (274), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 21:37:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1975 transitions. [2025-03-16 21:37:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 21:37:22,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:22,605 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:22,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 21:37:22,605 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:22,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:22,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1825434513, now seen corresponding path program 1 times [2025-03-16 21:37:22,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:22,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595050646] [2025-03-16 21:37:22,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:22,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:22,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 21:37:23,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 21:37:23,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:23,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 84 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:37:24,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:24,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595050646] [2025-03-16 21:37:24,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595050646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:37:24,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236798092] [2025-03-16 21:37:24,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:24,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:37:24,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:37:24,081 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 21:37:24,082 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 21:37:24,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 21:37:25,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 21:37:25,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:25,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:25,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 2063 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 21:37:25,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:37:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 21:37:25,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:37:25,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236798092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:25,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:37:25,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-03-16 21:37:25,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136158220] [2025-03-16 21:37:25,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:25,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:37:25,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:25,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:37:25,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:37:25,073 INFO L87 Difference]: Start difference. First operand 1455 states and 1975 transitions. Second operand has 6 states, 5 states have (on average 59.8) internal successors, (299), 6 states have internal predecessors, (299), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 21:37:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:25,263 INFO L93 Difference]: Finished difference Result 2310 states and 3123 transitions. [2025-03-16 21:37:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:37:25,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 59.8) internal successors, (299), 6 states have internal predecessors, (299), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 348 [2025-03-16 21:37:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:25,265 INFO L225 Difference]: With dead ends: 2310 [2025-03-16 21:37:25,265 INFO L226 Difference]: Without dead ends: 1455 [2025-03-16 21:37:25,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:37:25,267 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 0 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:25,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2231 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:37:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2025-03-16 21:37:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1455. [2025-03-16 21:37:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1428 states have (on average 1.341736694677871) internal successors, (1916), 1428 states have internal predecessors, (1916), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-16 21:37:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1966 transitions. [2025-03-16 21:37:25,288 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1966 transitions. Word has length 348 [2025-03-16 21:37:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:25,288 INFO L471 AbstractCegarLoop]: Abstraction has 1455 states and 1966 transitions. [2025-03-16 21:37:25,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 59.8) internal successors, (299), 6 states have internal predecessors, (299), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 21:37:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1966 transitions. [2025-03-16 21:37:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 21:37:25,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:25,290 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:25,303 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 21:37:25,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:37:25,491 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:25,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash 28863739, now seen corresponding path program 1 times [2025-03-16 21:37:25,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:25,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677867790] [2025-03-16 21:37:25,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:25,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 21:37:26,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 21:37:26,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:26,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 19 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-16 21:37:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677867790] [2025-03-16 21:37:26,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677867790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:37:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265928960] [2025-03-16 21:37:26,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:26,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:37:26,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:37:26,876 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 21:37:26,877 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 21:37:27,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 21:37:27,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 21:37:27,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:27,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:27,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 2063 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 21:37:27,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:37:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 21:37:27,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:37:27,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265928960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:27,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:37:27,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2025-03-16 21:37:27,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534254464] [2025-03-16 21:37:27,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:27,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:37:27,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:27,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:37:27,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:37:27,999 INFO L87 Difference]: Start difference. First operand 1455 states and 1966 transitions. Second operand has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:28,559 INFO L93 Difference]: Finished difference Result 3090 states and 4170 transitions. [2025-03-16 21:37:28,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:37:28,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 348 [2025-03-16 21:37:28,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:28,563 INFO L225 Difference]: With dead ends: 3090 [2025-03-16 21:37:28,563 INFO L226 Difference]: Without dead ends: 2569 [2025-03-16 21:37:28,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-16 21:37:28,564 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 928 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:28,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1981 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:37:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2025-03-16 21:37:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2223. [2025-03-16 21:37:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2174 states have (on average 1.3247470101195953) internal successors, (2880), 2174 states have internal predecessors, (2880), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-16 21:37:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 2974 transitions. [2025-03-16 21:37:28,602 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 2974 transitions. Word has length 348 [2025-03-16 21:37:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:28,602 INFO L471 AbstractCegarLoop]: Abstraction has 2223 states and 2974 transitions. [2025-03-16 21:37:28,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2974 transitions. [2025-03-16 21:37:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 21:37:28,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:28,605 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:28,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 21:37:28,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:37:28,806 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:28,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:28,806 INFO L85 PathProgramCache]: Analyzing trace with hash 265118550, now seen corresponding path program 1 times [2025-03-16 21:37:28,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:28,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222011382] [2025-03-16 21:37:28,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:28,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:28,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 21:37:28,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 21:37:28,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:28,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-16 21:37:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:29,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222011382] [2025-03-16 21:37:29,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222011382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:29,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:29,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:37:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211996904] [2025-03-16 21:37:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:29,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:37:29,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:29,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:37:29,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:29,252 INFO L87 Difference]: Start difference. First operand 2223 states and 2974 transitions. Second operand has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:29,401 INFO L93 Difference]: Finished difference Result 3108 states and 4167 transitions. [2025-03-16 21:37:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:37:29,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 348 [2025-03-16 21:37:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:29,405 INFO L225 Difference]: With dead ends: 3108 [2025-03-16 21:37:29,405 INFO L226 Difference]: Without dead ends: 2393 [2025-03-16 21:37:29,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:37:29,406 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 16 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:29,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1790 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:37:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2025-03-16 21:37:29,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2393. [2025-03-16 21:37:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 2344 states have (on average 1.331911262798635) internal successors, (3122), 2344 states have internal predecessors, (3122), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-16 21:37:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3216 transitions. [2025-03-16 21:37:29,446 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3216 transitions. Word has length 348 [2025-03-16 21:37:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:29,446 INFO L471 AbstractCegarLoop]: Abstraction has 2393 states and 3216 transitions. [2025-03-16 21:37:29,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3216 transitions. [2025-03-16 21:37:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-16 21:37:29,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:29,449 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:29,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-16 21:37:29,449 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:29,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:29,450 INFO L85 PathProgramCache]: Analyzing trace with hash 153817065, now seen corresponding path program 1 times [2025-03-16 21:37:29,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:29,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543011390] [2025-03-16 21:37:29,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:29,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:29,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-16 21:37:30,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-16 21:37:30,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:30,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 21:37:30,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543011390] [2025-03-16 21:37:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543011390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:30,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:30,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:37:30,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833932507] [2025-03-16 21:37:30,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:30,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:37:30,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:30,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:37:30,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:37:30,943 INFO L87 Difference]: Start difference. First operand 2393 states and 3216 transitions. Second operand has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 21:37:31,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:31,987 INFO L93 Difference]: Finished difference Result 4897 states and 6499 transitions. [2025-03-16 21:37:31,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 21:37:31,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 349 [2025-03-16 21:37:31,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:31,994 INFO L225 Difference]: With dead ends: 4897 [2025-03-16 21:37:31,994 INFO L226 Difference]: Without dead ends: 3896 [2025-03-16 21:37:31,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-03-16 21:37:31,996 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1342 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:31,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 2808 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 21:37:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2025-03-16 21:37:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 2956. [2025-03-16 21:37:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2956 states, 2890 states have (on average 1.329757785467128) internal successors, (3843), 2890 states have internal predecessors, (3843), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-16 21:37:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 3971 transitions. [2025-03-16 21:37:32,055 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 3971 transitions. Word has length 349 [2025-03-16 21:37:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:32,056 INFO L471 AbstractCegarLoop]: Abstraction has 2956 states and 3971 transitions. [2025-03-16 21:37:32,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 21:37:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 3971 transitions. [2025-03-16 21:37:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-16 21:37:32,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:32,061 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:32,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-16 21:37:32,062 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:32,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:32,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1041882619, now seen corresponding path program 1 times [2025-03-16 21:37:32,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:32,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140851494] [2025-03-16 21:37:32,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:32,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:32,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-16 21:37:32,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-16 21:37:32,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:32,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:37:33,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:33,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140851494] [2025-03-16 21:37:33,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140851494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:37:33,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175383781] [2025-03-16 21:37:33,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:33,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:37:33,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:37:33,962 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 21:37:33,964 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 21:37:34,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-16 21:37:35,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-16 21:37:35,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:35,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:35,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 2072 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 21:37:35,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:37:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 83 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:37:35,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:37:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:37:35,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175383781] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 21:37:35,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:37:35,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 8] total 22 [2025-03-16 21:37:35,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951113568] [2025-03-16 21:37:35,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:35,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:37:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:35,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:37:35,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-16 21:37:35,405 INFO L87 Difference]: Start difference. First operand 2956 states and 3971 transitions. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:35,906 INFO L93 Difference]: Finished difference Result 3832 states and 5160 transitions. [2025-03-16 21:37:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:37:35,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 351 [2025-03-16 21:37:35,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:35,913 INFO L225 Difference]: With dead ends: 3832 [2025-03-16 21:37:35,913 INFO L226 Difference]: Without dead ends: 3393 [2025-03-16 21:37:35,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 692 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2025-03-16 21:37:35,916 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 351 mSDsluCounter, 3628 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:35,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 4428 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:37:35,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2025-03-16 21:37:35,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 3190. [2025-03-16 21:37:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3190 states, 3120 states have (on average 1.3269230769230769) internal successors, (4140), 3120 states have internal predecessors, (4140), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-16 21:37:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 4276 transitions. [2025-03-16 21:37:35,969 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 4276 transitions. Word has length 351 [2025-03-16 21:37:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:35,969 INFO L471 AbstractCegarLoop]: Abstraction has 3190 states and 4276 transitions. [2025-03-16 21:37:35,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 4276 transitions. [2025-03-16 21:37:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-16 21:37:35,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:35,974 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:35,991 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 21:37:36,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-16 21:37:36,175 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:36,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1533792353, now seen corresponding path program 1 times [2025-03-16 21:37:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:36,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813845606] [2025-03-16 21:37:36,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:36,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:36,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-16 21:37:36,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-16 21:37:36,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:36,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:37:38,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:38,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813845606] [2025-03-16 21:37:38,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813845606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:37:38,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76456333] [2025-03-16 21:37:38,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:38,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:37:38,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:37:38,133 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 21:37:38,133 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 21:37:38,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-16 21:37:39,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-16 21:37:39,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:39,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:39,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 2075 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 21:37:39,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:37:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-16 21:37:39,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:37:39,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76456333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:39,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:37:39,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-03-16 21:37:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810000903] [2025-03-16 21:37:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:39,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:37:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:39,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:37:39,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:37:39,243 INFO L87 Difference]: Start difference. First operand 3190 states and 4276 transitions. Second operand has 6 states, 5 states have (on average 53.4) internal successors, (267), 6 states have internal predecessors, (267), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 21:37:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:39,485 INFO L93 Difference]: Finished difference Result 5608 states and 7500 transitions. [2025-03-16 21:37:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:37:39,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 53.4) internal successors, (267), 6 states have internal predecessors, (267), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 352 [2025-03-16 21:37:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:39,490 INFO L225 Difference]: With dead ends: 5608 [2025-03-16 21:37:39,490 INFO L226 Difference]: Without dead ends: 3190 [2025-03-16 21:37:39,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:37:39,494 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 0 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:39,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2232 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:37:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2025-03-16 21:37:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3162. [2025-03-16 21:37:39,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3162 states, 3092 states have (on average 1.3240620957309186) internal successors, (4094), 3092 states have internal predecessors, (4094), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-16 21:37:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 4230 transitions. [2025-03-16 21:37:39,545 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 4230 transitions. Word has length 352 [2025-03-16 21:37:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:39,545 INFO L471 AbstractCegarLoop]: Abstraction has 3162 states and 4230 transitions. [2025-03-16 21:37:39,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 53.4) internal successors, (267), 6 states have internal predecessors, (267), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 21:37:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 4230 transitions. [2025-03-16 21:37:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-16 21:37:39,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:39,549 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:39,566 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 21:37:39,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-16 21:37:39,750 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:39,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:39,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1930664781, now seen corresponding path program 1 times [2025-03-16 21:37:39,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:39,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325954585] [2025-03-16 21:37:39,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:39,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:39,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-16 21:37:40,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-16 21:37:40,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:40,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:37:40,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:40,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325954585] [2025-03-16 21:37:40,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325954585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:40,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:40,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:37:40,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544835530] [2025-03-16 21:37:40,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:40,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:37:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:40,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:37:40,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:40,604 INFO L87 Difference]: Start difference. First operand 3162 states and 4230 transitions. Second operand has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:41,169 INFO L93 Difference]: Finished difference Result 4809 states and 6444 transitions. [2025-03-16 21:37:41,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:37:41,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2025-03-16 21:37:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:41,175 INFO L225 Difference]: With dead ends: 4809 [2025-03-16 21:37:41,175 INFO L226 Difference]: Without dead ends: 4140 [2025-03-16 21:37:41,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 21:37:41,177 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 744 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:41,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 2045 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:37:41,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2025-03-16 21:37:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 3334. [2025-03-16 21:37:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 3260 states have (on average 1.3251533742331287) internal successors, (4320), 3260 states have internal predecessors, (4320), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-16 21:37:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4464 transitions. [2025-03-16 21:37:41,237 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4464 transitions. Word has length 352 [2025-03-16 21:37:41,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:41,237 INFO L471 AbstractCegarLoop]: Abstraction has 3334 states and 4464 transitions. [2025-03-16 21:37:41,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4464 transitions. [2025-03-16 21:37:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-16 21:37:41,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:41,244 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:41,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-16 21:37:41,244 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:41,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash -486987729, now seen corresponding path program 1 times [2025-03-16 21:37:41,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:41,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894037731] [2025-03-16 21:37:41,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:41,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:41,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-16 21:37:41,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-16 21:37:41,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:41,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:37:42,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:42,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894037731] [2025-03-16 21:37:42,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894037731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:42,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:42,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 21:37:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769042340] [2025-03-16 21:37:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:42,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:37:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:42,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:37:42,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:37:42,537 INFO L87 Difference]: Start difference. First operand 3334 states and 4464 transitions. Second operand has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:43,446 INFO L93 Difference]: Finished difference Result 7592 states and 10194 transitions. [2025-03-16 21:37:43,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 21:37:43,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2025-03-16 21:37:43,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:43,455 INFO L225 Difference]: With dead ends: 7592 [2025-03-16 21:37:43,455 INFO L226 Difference]: Without dead ends: 6923 [2025-03-16 21:37:43,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-16 21:37:43,459 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 1746 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 1949 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 2721 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:43,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 2721 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1949 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:37:43,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6923 states. [2025-03-16 21:37:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6923 to 3690. [2025-03-16 21:37:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 3600 states have (on average 1.3222222222222222) internal successors, (4760), 3600 states have internal predecessors, (4760), 88 states have call successors, (88), 1 states have call predecessors, (88), 1 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 21:37:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 4936 transitions. [2025-03-16 21:37:43,540 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 4936 transitions. Word has length 352 [2025-03-16 21:37:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:43,540 INFO L471 AbstractCegarLoop]: Abstraction has 3690 states and 4936 transitions. [2025-03-16 21:37:43,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 4936 transitions. [2025-03-16 21:37:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-16 21:37:43,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:43,546 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:43,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-16 21:37:43,547 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:43,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:43,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1505665061, now seen corresponding path program 1 times [2025-03-16 21:37:43,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:43,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583746592] [2025-03-16 21:37:43,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:43,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:43,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-16 21:37:43,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-16 21:37:43,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:43,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-16 21:37:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583746592] [2025-03-16 21:37:44,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583746592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:44,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:44,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:37:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052556549] [2025-03-16 21:37:44,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:44,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:37:44,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:44,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:37:44,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:44,364 INFO L87 Difference]: Start difference. First operand 3690 states and 4936 transitions. Second operand has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 21:37:44,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:44,790 INFO L93 Difference]: Finished difference Result 6096 states and 8138 transitions. [2025-03-16 21:37:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:37:44,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 353 [2025-03-16 21:37:44,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:44,795 INFO L225 Difference]: With dead ends: 6096 [2025-03-16 21:37:44,795 INFO L226 Difference]: Without dead ends: 3766 [2025-03-16 21:37:44,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:37:44,798 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 491 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:44,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1296 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2025-03-16 21:37:44,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3654. [2025-03-16 21:37:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 3564 states have (on average 1.3204264870931537) internal successors, (4706), 3564 states have internal predecessors, (4706), 88 states have call successors, (88), 1 states have call predecessors, (88), 1 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 21:37:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 4882 transitions. [2025-03-16 21:37:44,870 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 4882 transitions. Word has length 353 [2025-03-16 21:37:44,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:44,870 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 4882 transitions. [2025-03-16 21:37:44,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 21:37:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 4882 transitions. [2025-03-16 21:37:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-16 21:37:44,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:44,876 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:44,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-16 21:37:44,876 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:44,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1335448246, now seen corresponding path program 1 times [2025-03-16 21:37:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315768588] [2025-03-16 21:37:44,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:44,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-16 21:37:44,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-16 21:37:44,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:44,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-16 21:37:45,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:45,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315768588] [2025-03-16 21:37:45,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315768588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:37:45,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:37:45,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:37:45,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381488384] [2025-03-16 21:37:45,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:37:45,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:37:45,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:37:45,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:37:45,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:45,379 INFO L87 Difference]: Start difference. First operand 3654 states and 4882 transitions. Second operand has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:37:45,769 INFO L93 Difference]: Finished difference Result 5180 states and 6904 transitions. [2025-03-16 21:37:45,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:37:45,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 353 [2025-03-16 21:37:45,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:37:45,774 INFO L225 Difference]: With dead ends: 5180 [2025-03-16 21:37:45,774 INFO L226 Difference]: Without dead ends: 3814 [2025-03-16 21:37:45,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:37:45,776 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 503 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:37:45,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1330 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:37:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2025-03-16 21:37:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3734. [2025-03-16 21:37:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3644 states have (on average 1.3133918770581778) internal successors, (4786), 3644 states have internal predecessors, (4786), 88 states have call successors, (88), 1 states have call predecessors, (88), 1 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 21:37:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4962 transitions. [2025-03-16 21:37:45,867 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4962 transitions. Word has length 353 [2025-03-16 21:37:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:37:45,867 INFO L471 AbstractCegarLoop]: Abstraction has 3734 states and 4962 transitions. [2025-03-16 21:37:45,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 21:37:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4962 transitions. [2025-03-16 21:37:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-16 21:37:45,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:37:45,873 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:37:45,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-16 21:37:45,873 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:37:45,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:37:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1713587367, now seen corresponding path program 1 times [2025-03-16 21:37:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:37:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279063527] [2025-03-16 21:37:45,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:45,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:37:45,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-16 21:37:46,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-16 21:37:46,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:37:46,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 51 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 21:37:49,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:37:49,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279063527] [2025-03-16 21:37:49,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279063527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:37:49,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151710473] [2025-03-16 21:37:49,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:37:49,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:37:49,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:37:49,412 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 21:37:49,413 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 21:37:50,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.