./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label05.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ab20fd2c170582703dc94cfdcd8e10a79137aac9ab76b1936884b512261ae10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:01:11,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:01:11,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:01:11,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:01:11,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:01:11,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:01:11,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:01:11,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:01:11,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:01:11,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:01:11,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:01:11,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:01:11,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:01:11,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:01:11,497 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:01:11,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:01:11,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:01:11,497 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:01:11,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:01:11,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:01:11,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:01:11,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:01:11,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:01:11,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:01:11,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:01:11,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:01:11,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:01:11,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:01:11,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:01:11,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:01:11,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:01:11,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:01:11,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:01:11,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:01:11,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:01:11,499 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:01:11,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:01:11,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:01:11,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:01:11,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:01:11,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:01:11,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:01:11,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:01:11,500 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ab20fd2c170582703dc94cfdcd8e10a79137aac9ab76b1936884b512261ae10 [2025-02-05 12:01:11,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:01:11,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:01:11,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:01:11,816 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:01:11,816 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:01:11,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label05.c [2025-02-05 12:01:13,156 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ae34de64/3554cf18d8ca4851a4c1f56c0ba03a2e/FLAGad7607fdd [2025-02-05 12:01:13,645 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:01:13,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label05.c [2025-02-05 12:01:13,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ae34de64/3554cf18d8ca4851a4c1f56c0ba03a2e/FLAGad7607fdd [2025-02-05 12:01:13,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ae34de64/3554cf18d8ca4851a4c1f56c0ba03a2e [2025-02-05 12:01:13,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:01:13,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:01:13,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:01:13,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:01:13,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:01:13,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:13" (1/1) ... [2025-02-05 12:01:13,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5aff80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:13, skipping insertion in model container [2025-02-05 12:01:13,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:13" (1/1) ... [2025-02-05 12:01:13,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:01:14,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label05.c[9078,9091] [2025-02-05 12:01:14,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:01:14,484 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:01:14,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label05.c[9078,9091] [2025-02-05 12:01:14,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:01:14,719 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:01:14,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14 WrapperNode [2025-02-05 12:01:14,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:01:14,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:01:14,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:01:14,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:01:14,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (1/1) ... [2025-02-05 12:01:14,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (1/1) ... [2025-02-05 12:01:14,989 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:01:14,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:01:14,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:01:14,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:01:14,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:01:15,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (1/1) ... [2025-02-05 12:01:15,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (1/1) ... [2025-02-05 12:01:15,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (1/1) ... [2025-02-05 12:01:15,277 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-02-05 12:01:15,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (1/1) ... [2025-02-05 12:01:15,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (1/1) ... [2025-02-05 12:01:15,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (1/1) ... [2025-02-05 12:01:15,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (1/1) ... [2025-02-05 12:01:15,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (1/1) ... [2025-02-05 12:01:15,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (1/1) ... [2025-02-05 12:01:15,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:01:15,561 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:01:15,561 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:01:15,561 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:01:15,562 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (1/1) ... [2025-02-05 12:01:15,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:01:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:01:15,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:01:15,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:01:15,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:01:15,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:01:15,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:01:15,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:01:15,674 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:01:15,675 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:01:18,675 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:01:18,805 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:01:18,806 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:01:18,836 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:01:18,836 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:01:18,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:18 BoogieIcfgContainer [2025-02-05 12:01:18,837 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:01:18,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:01:18,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:01:18,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:01:18,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:01:13" (1/3) ... [2025-02-05 12:01:18,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fb2009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:18, skipping insertion in model container [2025-02-05 12:01:18,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:14" (2/3) ... [2025-02-05 12:01:18,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fb2009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:18, skipping insertion in model container [2025-02-05 12:01:18,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:18" (3/3) ... [2025-02-05 12:01:18,847 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label05.c [2025-02-05 12:01:18,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:01:18,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label05.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:01:18,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:01:18,945 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;@17e2fa5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:01:18,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:01:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 12:01:18,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:18,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:18,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:18,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash 605050075, now seen corresponding path program 1 times [2025-02-05 12:01:18,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:18,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391550352] [2025-02-05 12:01:18,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:19,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 12:01:19,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 12:01:19,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:19,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:19,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:19,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391550352] [2025-02-05 12:01:19,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391550352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:19,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:19,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:01:19,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309434378] [2025-02-05 12:01:19,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:19,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:19,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:19,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:19,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:19,447 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:22,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:22,073 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-02-05 12:01:22,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:22,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 12:01:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:22,088 INFO L225 Difference]: With dead ends: 1644 [2025-02-05 12:01:22,088 INFO L226 Difference]: Without dead ends: 977 [2025-02-05 12:01:22,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:22,095 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 427 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:22,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 12:01:22,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-05 12:01:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-02-05 12:01:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-02-05 12:01:22,164 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 61 [2025-02-05 12:01:22,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:22,165 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-02-05 12:01:22,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:22,165 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-02-05 12:01:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 12:01:22,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:22,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:22,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:01:22,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:22,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash 484828122, now seen corresponding path program 1 times [2025-02-05 12:01:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:22,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91408524] [2025-02-05 12:01:22,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:22,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:22,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 12:01:22,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 12:01:22,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:22,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:22,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:22,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91408524] [2025-02-05 12:01:22,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91408524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:22,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:22,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:01:22,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110601550] [2025-02-05 12:01:22,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:22,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:22,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:22,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:22,469 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:24,412 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2025-02-05 12:01:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:24,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-02-05 12:01:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:24,424 INFO L225 Difference]: With dead ends: 2813 [2025-02-05 12:01:24,424 INFO L226 Difference]: Without dead ends: 1844 [2025-02-05 12:01:24,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:24,427 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:24,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:01:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-05 12:01:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2025-02-05 12:01:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2025-02-05 12:01:24,528 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 128 [2025-02-05 12:01:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:24,529 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2025-02-05 12:01:24,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2025-02-05 12:01:24,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 12:01:24,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:24,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:24,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:01:24,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:24,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1800859218, now seen corresponding path program 1 times [2025-02-05 12:01:24,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:24,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491269451] [2025-02-05 12:01:24,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:24,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 12:01:24,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 12:01:24,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:24,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:24,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:24,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491269451] [2025-02-05 12:01:24,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491269451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:24,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:24,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:24,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069515503] [2025-02-05 12:01:24,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:24,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:24,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:24,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:24,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:24,776 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:26,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:26,981 INFO L93 Difference]: Finished difference Result 4552 states and 6282 transitions. [2025-02-05 12:01:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-02-05 12:01:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:26,995 INFO L225 Difference]: With dead ends: 4552 [2025-02-05 12:01:26,995 INFO L226 Difference]: Without dead ends: 2713 [2025-02-05 12:01:26,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:26,999 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 446 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:26,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 886 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:01:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2025-02-05 12:01:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2711. [2025-02-05 12:01:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2710 states have (on average 1.3003690036900368) internal successors, (3524), 2710 states have internal predecessors, (3524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3524 transitions. [2025-02-05 12:01:27,060 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3524 transitions. Word has length 131 [2025-02-05 12:01:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:27,061 INFO L471 AbstractCegarLoop]: Abstraction has 2711 states and 3524 transitions. [2025-02-05 12:01:27,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3524 transitions. [2025-02-05 12:01:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 12:01:27,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:27,069 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:27,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:01:27,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:27,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1444219208, now seen corresponding path program 1 times [2025-02-05 12:01:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:27,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745780] [2025-02-05 12:01:27,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:27,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 12:01:27,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 12:01:27,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:27,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 12:01:27,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:27,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745780] [2025-02-05 12:01:27,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:27,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:27,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:01:27,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470725709] [2025-02-05 12:01:27,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:27,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:27,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:27,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:27,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:27,316 INFO L87 Difference]: Start difference. First operand 2711 states and 3524 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:29,256 INFO L93 Difference]: Finished difference Result 7984 states and 10361 transitions. [2025-02-05 12:01:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:29,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-02-05 12:01:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:29,277 INFO L225 Difference]: With dead ends: 7984 [2025-02-05 12:01:29,278 INFO L226 Difference]: Without dead ends: 4421 [2025-02-05 12:01:29,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:29,285 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:29,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:01:29,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2025-02-05 12:01:29,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3571. [2025-02-05 12:01:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 3570 states have (on average 1.1775910364145659) internal successors, (4204), 3570 states have internal predecessors, (4204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 4204 transitions. [2025-02-05 12:01:29,357 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 4204 transitions. Word has length 200 [2025-02-05 12:01:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:29,357 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 4204 transitions. [2025-02-05 12:01:29,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 4204 transitions. [2025-02-05 12:01:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 12:01:29,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:29,361 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:29,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:01:29,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:29,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:29,362 INFO L85 PathProgramCache]: Analyzing trace with hash 535838070, now seen corresponding path program 1 times [2025-02-05 12:01:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:29,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603199886] [2025-02-05 12:01:29,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:29,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:29,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 12:01:29,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 12:01:29,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:29,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:29,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603199886] [2025-02-05 12:01:29,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603199886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:29,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:29,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:29,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936430111] [2025-02-05 12:01:29,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:29,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:29,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:29,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:29,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:29,633 INFO L87 Difference]: Start difference. First operand 3571 states and 4204 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:31,168 INFO L93 Difference]: Finished difference Result 9273 states and 11087 transitions. [2025-02-05 12:01:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2025-02-05 12:01:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:31,189 INFO L225 Difference]: With dead ends: 9273 [2025-02-05 12:01:31,189 INFO L226 Difference]: Without dead ends: 5704 [2025-02-05 12:01:31,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:31,196 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:31,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:01:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2025-02-05 12:01:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 5704. [2025-02-05 12:01:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5704 states, 5703 states have (on average 1.1595651411537786) internal successors, (6613), 5703 states have internal predecessors, (6613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 6613 transitions. [2025-02-05 12:01:31,301 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 6613 transitions. Word has length 213 [2025-02-05 12:01:31,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:31,301 INFO L471 AbstractCegarLoop]: Abstraction has 5704 states and 6613 transitions. [2025-02-05 12:01:31,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 6613 transitions. [2025-02-05 12:01:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 12:01:31,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:31,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:31,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:01:31,307 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:31,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1117387717, now seen corresponding path program 1 times [2025-02-05 12:01:31,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:31,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188339912] [2025-02-05 12:01:31,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:31,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:31,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 12:01:31,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 12:01:31,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:31,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 12:01:31,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:31,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188339912] [2025-02-05 12:01:31,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188339912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:31,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:31,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:31,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736260998] [2025-02-05 12:01:31,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:31,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:31,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:31,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:31,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:31,525 INFO L87 Difference]: Start difference. First operand 5704 states and 6613 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:33,045 INFO L93 Difference]: Finished difference Result 14376 states and 16776 transitions. [2025-02-05 12:01:33,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:33,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2025-02-05 12:01:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:33,072 INFO L225 Difference]: With dead ends: 14376 [2025-02-05 12:01:33,073 INFO L226 Difference]: Without dead ends: 8673 [2025-02-05 12:01:33,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:33,082 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 390 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:33,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:01:33,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8673 states. [2025-02-05 12:01:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8673 to 5677. [2025-02-05 12:01:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 5676 states have (on average 1.1578576462297392) internal successors, (6572), 5676 states have internal predecessors, (6572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:33,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 6572 transitions. [2025-02-05 12:01:33,223 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 6572 transitions. Word has length 215 [2025-02-05 12:01:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:33,223 INFO L471 AbstractCegarLoop]: Abstraction has 5677 states and 6572 transitions. [2025-02-05 12:01:33,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 6572 transitions. [2025-02-05 12:01:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-02-05 12:01:33,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:33,227 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:33,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:01:33,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:33,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -319387911, now seen corresponding path program 1 times [2025-02-05 12:01:33,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649895390] [2025-02-05 12:01:33,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:33,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-02-05 12:01:33,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-02-05 12:01:33,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:33,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:01:33,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:33,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649895390] [2025-02-05 12:01:33,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649895390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:33,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:33,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:33,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912924894] [2025-02-05 12:01:33,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:33,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:33,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:33,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:33,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:33,535 INFO L87 Difference]: Start difference. First operand 5677 states and 6572 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:35,104 INFO L93 Difference]: Finished difference Result 13935 states and 16238 transitions. [2025-02-05 12:01:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:35,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293 [2025-02-05 12:01:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:35,127 INFO L225 Difference]: With dead ends: 13935 [2025-02-05 12:01:35,127 INFO L226 Difference]: Without dead ends: 7832 [2025-02-05 12:01:35,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:35,134 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 495 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:35,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 629 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:01:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7832 states. [2025-02-05 12:01:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7832 to 7402. [2025-02-05 12:01:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7402 states, 7401 states have (on average 1.1638967707066612) internal successors, (8614), 7401 states have internal predecessors, (8614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 8614 transitions. [2025-02-05 12:01:35,243 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 8614 transitions. Word has length 293 [2025-02-05 12:01:35,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:35,244 INFO L471 AbstractCegarLoop]: Abstraction has 7402 states and 8614 transitions. [2025-02-05 12:01:35,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 8614 transitions. [2025-02-05 12:01:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-05 12:01:35,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:35,248 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:35,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:01:35,249 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:35,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:35,250 INFO L85 PathProgramCache]: Analyzing trace with hash -458904840, now seen corresponding path program 1 times [2025-02-05 12:01:35,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:35,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414306077] [2025-02-05 12:01:35,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:35,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:35,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-05 12:01:35,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-05 12:01:35,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:35,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:01:35,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:35,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414306077] [2025-02-05 12:01:35,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414306077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:35,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:35,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:35,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14363969] [2025-02-05 12:01:35,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:35,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:35,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:35,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:35,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:35,471 INFO L87 Difference]: Start difference. First operand 7402 states and 8614 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:37,064 INFO L93 Difference]: Finished difference Result 19038 states and 22311 transitions. [2025-02-05 12:01:37,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:37,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2025-02-05 12:01:37,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:37,091 INFO L225 Difference]: With dead ends: 19038 [2025-02-05 12:01:37,091 INFO L226 Difference]: Without dead ends: 11213 [2025-02-05 12:01:37,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:37,102 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 379 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:37,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 842 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:01:37,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11213 states. [2025-02-05 12:01:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11213 to 10363. [2025-02-05 12:01:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10363 states, 10362 states have (on average 1.132117351862575) internal successors, (11731), 10362 states have internal predecessors, (11731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10363 states to 10363 states and 11731 transitions. [2025-02-05 12:01:37,267 INFO L78 Accepts]: Start accepts. Automaton has 10363 states and 11731 transitions. Word has length 298 [2025-02-05 12:01:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:37,267 INFO L471 AbstractCegarLoop]: Abstraction has 10363 states and 11731 transitions. [2025-02-05 12:01:37,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 10363 states and 11731 transitions. [2025-02-05 12:01:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-02-05 12:01:37,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:37,275 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:37,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:01:37,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:37,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:37,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2038047326, now seen corresponding path program 1 times [2025-02-05 12:01:37,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:37,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415953606] [2025-02-05 12:01:37,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:37,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:37,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-02-05 12:01:37,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-02-05 12:01:37,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:37,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:01:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415953606] [2025-02-05 12:01:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415953606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:37,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:37,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:37,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963184306] [2025-02-05 12:01:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:37,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:37,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:37,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:37,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:37,554 INFO L87 Difference]: Start difference. First operand 10363 states and 11731 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:39,034 INFO L93 Difference]: Finished difference Result 24567 states and 27907 transitions. [2025-02-05 12:01:39,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:39,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2025-02-05 12:01:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:39,060 INFO L225 Difference]: With dead ends: 24567 [2025-02-05 12:01:39,061 INFO L226 Difference]: Without dead ends: 13774 [2025-02-05 12:01:39,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:39,073 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 444 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:39,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 296 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:01:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13774 states. [2025-02-05 12:01:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13774 to 12918. [2025-02-05 12:01:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12918 states, 12917 states have (on average 1.1388867384067507) internal successors, (14711), 12917 states have internal predecessors, (14711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12918 states to 12918 states and 14711 transitions. [2025-02-05 12:01:39,387 INFO L78 Accepts]: Start accepts. Automaton has 12918 states and 14711 transitions. Word has length 316 [2025-02-05 12:01:39,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:39,388 INFO L471 AbstractCegarLoop]: Abstraction has 12918 states and 14711 transitions. [2025-02-05 12:01:39,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand 12918 states and 14711 transitions. [2025-02-05 12:01:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-02-05 12:01:39,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:39,396 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:39,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:01:39,397 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:39,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash -578525517, now seen corresponding path program 1 times [2025-02-05 12:01:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:39,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896660318] [2025-02-05 12:01:39,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:39,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:39,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-02-05 12:01:39,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-02-05 12:01:39,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:39,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:01:39,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:39,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896660318] [2025-02-05 12:01:39,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896660318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:39,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:39,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:01:39,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739258367] [2025-02-05 12:01:39,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:39,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:01:39,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:39,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:01:39,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:01:39,819 INFO L87 Difference]: Start difference. First operand 12918 states and 14711 transitions. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:42,122 INFO L93 Difference]: Finished difference Result 46353 states and 52890 transitions. [2025-02-05 12:01:42,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:01:42,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2025-02-05 12:01:42,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:42,157 INFO L225 Difference]: With dead ends: 46353 [2025-02-05 12:01:42,157 INFO L226 Difference]: Without dead ends: 32156 [2025-02-05 12:01:42,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:01:42,169 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 864 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2615 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 3101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 2615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:42,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 303 Invalid, 3101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 2615 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:01:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32156 states. [2025-02-05 12:01:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32156 to 31677. [2025-02-05 12:01:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31677 states, 31676 states have (on average 1.1246685187523677) internal successors, (35625), 31676 states have internal predecessors, (35625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31677 states to 31677 states and 35625 transitions. [2025-02-05 12:01:42,510 INFO L78 Accepts]: Start accepts. Automaton has 31677 states and 35625 transitions. Word has length 321 [2025-02-05 12:01:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:42,510 INFO L471 AbstractCegarLoop]: Abstraction has 31677 states and 35625 transitions. [2025-02-05 12:01:42,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 31677 states and 35625 transitions. [2025-02-05 12:01:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-02-05 12:01:42,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:42,515 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:01:42,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:01:42,515 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:42,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2019519012, now seen corresponding path program 1 times [2025-02-05 12:01:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:42,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437869304] [2025-02-05 12:01:42,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:42,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-02-05 12:01:42,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-02-05 12:01:42,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:42,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:01:42,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:42,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437869304] [2025-02-05 12:01:42,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437869304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:42,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:42,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:42,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723713331] [2025-02-05 12:01:42,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:42,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:42,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:42,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:42,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:42,810 INFO L87 Difference]: Start difference. First operand 31677 states and 35625 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:44,307 INFO L93 Difference]: Finished difference Result 76998 states and 86991 transitions. [2025-02-05 12:01:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:01:44,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2025-02-05 12:01:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:44,359 INFO L225 Difference]: With dead ends: 76998 [2025-02-05 12:01:44,360 INFO L226 Difference]: Without dead ends: 44894 [2025-02-05 12:01:44,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:44,387 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 423 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:44,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 426 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:01:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44894 states. [2025-02-05 12:01:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44894 to 43162. [2025-02-05 12:01:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43162 states, 43161 states have (on average 1.1074117837862885) internal successors, (47797), 43161 states have internal predecessors, (47797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43162 states to 43162 states and 47797 transitions. [2025-02-05 12:01:44,902 INFO L78 Accepts]: Start accepts. Automaton has 43162 states and 47797 transitions. Word has length 350 [2025-02-05 12:01:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:44,902 INFO L471 AbstractCegarLoop]: Abstraction has 43162 states and 47797 transitions. [2025-02-05 12:01:44,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 43162 states and 47797 transitions. [2025-02-05 12:01:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-02-05 12:01:44,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:44,906 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:01:44,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:01:44,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:44,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1688787561, now seen corresponding path program 1 times [2025-02-05 12:01:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:44,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755567600] [2025-02-05 12:01:44,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:44,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:44,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-02-05 12:01:44,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-02-05 12:01:44,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:44,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 340 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:01:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:45,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755567600] [2025-02-05 12:01:45,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755567600] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:01:45,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191556198] [2025-02-05 12:01:45,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:45,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:01:45,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:01:45,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:01:45,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 12:01:45,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-02-05 12:01:45,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-02-05 12:01:45,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:45,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:45,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 12:01:45,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:01:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 304 proven. 82 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-05 12:01:45,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:01:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 304 proven. 82 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-05 12:01:47,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191556198] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 12:01:47,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 12:01:47,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-02-05 12:01:47,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206836836] [2025-02-05 12:01:47,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 12:01:47,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 12:01:47,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:47,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 12:01:47,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 12:01:47,012 INFO L87 Difference]: Start difference. First operand 43162 states and 47797 transitions. Second operand has 9 states, 9 states have (on average 93.55555555555556) internal successors, (842), 9 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:01:57,189 INFO L93 Difference]: Finished difference Result 151118 states and 167179 transitions. [2025-02-05 12:01:57,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 12:01:57,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 93.55555555555556) internal successors, (842), 9 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 356 [2025-02-05 12:01:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:01:57,352 INFO L225 Difference]: With dead ends: 151118 [2025-02-05 12:01:57,352 INFO L226 Difference]: Without dead ends: 103699 [2025-02-05 12:01:57,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2025-02-05 12:01:57,378 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 6990 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 11483 mSolverCounterSat, 2291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6990 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 13774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2291 IncrementalHoareTripleChecker+Valid, 11483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:01:57,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6990 Valid, 529 Invalid, 13774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2291 Valid, 11483 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-02-05 12:01:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103699 states. [2025-02-05 12:01:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103699 to 85728. [2025-02-05 12:01:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85728 states, 85727 states have (on average 1.102324821818097) internal successors, (94499), 85727 states have internal predecessors, (94499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85728 states to 85728 states and 94499 transitions. [2025-02-05 12:01:58,638 INFO L78 Accepts]: Start accepts. Automaton has 85728 states and 94499 transitions. Word has length 356 [2025-02-05 12:01:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:01:58,638 INFO L471 AbstractCegarLoop]: Abstraction has 85728 states and 94499 transitions. [2025-02-05 12:01:58,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.55555555555556) internal successors, (842), 9 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:01:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 85728 states and 94499 transitions. [2025-02-05 12:01:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-05 12:01:58,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:01:58,648 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:01:58,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 12:01:58,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 12:01:58,849 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:01:58,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:01:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash -600636305, now seen corresponding path program 1 times [2025-02-05 12:01:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:01:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041886845] [2025-02-05 12:01:58,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:01:58,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:01:58,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 12:01:58,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 12:01:58,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:01:58,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:01:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 12:01:59,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:01:59,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041886845] [2025-02-05 12:01:59,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041886845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:01:59,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:01:59,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:01:59,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635393442] [2025-02-05 12:01:59,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:01:59,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:01:59,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:01:59,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:01:59,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:01:59,156 INFO L87 Difference]: Start difference. First operand 85728 states and 94499 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:00,730 INFO L93 Difference]: Finished difference Result 167194 states and 184279 transitions. [2025-02-05 12:02:00,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:00,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 430 [2025-02-05 12:02:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:00,814 INFO L225 Difference]: With dead ends: 167194 [2025-02-05 12:02:00,815 INFO L226 Difference]: Without dead ends: 81467 [2025-02-05 12:02:00,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:00,862 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 440 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:00,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 724 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:02:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81467 states. [2025-02-05 12:02:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81467 to 80186. [2025-02-05 12:02:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80186 states, 80185 states have (on average 1.0767475213568622) internal successors, (86339), 80185 states have internal predecessors, (86339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80186 states to 80186 states and 86339 transitions. [2025-02-05 12:02:01,833 INFO L78 Accepts]: Start accepts. Automaton has 80186 states and 86339 transitions. Word has length 430 [2025-02-05 12:02:01,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:01,833 INFO L471 AbstractCegarLoop]: Abstraction has 80186 states and 86339 transitions. [2025-02-05 12:02:01,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 80186 states and 86339 transitions. [2025-02-05 12:02:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-02-05 12:02:01,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:01,839 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:01,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:02:01,840 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:01,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:01,840 INFO L85 PathProgramCache]: Analyzing trace with hash 42880801, now seen corresponding path program 1 times [2025-02-05 12:02:01,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:01,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517662322] [2025-02-05 12:02:01,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:01,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:01,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-02-05 12:02:01,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-02-05 12:02:01,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:01,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 690 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-05 12:02:02,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:02,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517662322] [2025-02-05 12:02:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517662322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:02,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:02,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:02:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779268693] [2025-02-05 12:02:02,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:02,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:02,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:02,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:02,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:02,148 INFO L87 Difference]: Start difference. First operand 80186 states and 86339 transitions. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:03,942 INFO L93 Difference]: Finished difference Result 160370 states and 172676 transitions. [2025-02-05 12:02:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:03,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 438 [2025-02-05 12:02:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:04,032 INFO L225 Difference]: With dead ends: 160370 [2025-02-05 12:02:04,032 INFO L226 Difference]: Without dead ends: 80186 [2025-02-05 12:02:04,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:04,079 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 818 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:04,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 753 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2088 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:02:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80186 states. [2025-02-05 12:02:04,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80186 to 80186. [2025-02-05 12:02:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80186 states, 80185 states have (on average 1.07579971316331) internal successors, (86263), 80185 states have internal predecessors, (86263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80186 states to 80186 states and 86263 transitions. [2025-02-05 12:02:05,009 INFO L78 Accepts]: Start accepts. Automaton has 80186 states and 86263 transitions. Word has length 438 [2025-02-05 12:02:05,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:05,010 INFO L471 AbstractCegarLoop]: Abstraction has 80186 states and 86263 transitions. [2025-02-05 12:02:05,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand 80186 states and 86263 transitions. [2025-02-05 12:02:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-05 12:02:05,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:05,015 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:05,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:02:05,015 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:05,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2144894837, now seen corresponding path program 1 times [2025-02-05 12:02:05,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:05,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334097326] [2025-02-05 12:02:05,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:05,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:05,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-05 12:02:05,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-05 12:02:05,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:05,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 548 proven. 175 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 12:02:05,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:05,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334097326] [2025-02-05 12:02:05,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334097326] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:05,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044818251] [2025-02-05 12:02:05,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:05,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:05,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:02:05,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:02:05,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 12:02:05,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-05 12:02:05,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-05 12:02:05,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:05,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:05,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 12:02:05,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:02:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-05 12:02:06,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:02:06,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044818251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:06,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:02:06,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-05 12:02:06,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486747798] [2025-02-05 12:02:06,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:06,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:06,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:06,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:06,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:02:06,071 INFO L87 Difference]: Start difference. First operand 80186 states and 86263 transitions. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:08,077 INFO L93 Difference]: Finished difference Result 163349 states and 175712 transitions. [2025-02-05 12:02:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:08,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2025-02-05 12:02:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:08,192 INFO L225 Difference]: With dead ends: 163349 [2025-02-05 12:02:08,192 INFO L226 Difference]: Without dead ends: 83165 [2025-02-05 12:02:08,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:02:08,253 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 830 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:08,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 346 Invalid, 2294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2136 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:02:08,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83165 states. [2025-02-05 12:02:09,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83165 to 82315. [2025-02-05 12:02:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82315 states, 82314 states have (on average 1.075272736108074) internal successors, (88510), 82314 states have internal predecessors, (88510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82315 states to 82315 states and 88510 transitions. [2025-02-05 12:02:09,609 INFO L78 Accepts]: Start accepts. Automaton has 82315 states and 88510 transitions. Word has length 439 [2025-02-05 12:02:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:09,609 INFO L471 AbstractCegarLoop]: Abstraction has 82315 states and 88510 transitions. [2025-02-05 12:02:09,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 82315 states and 88510 transitions. [2025-02-05 12:02:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-05 12:02:09,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:09,616 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:02:09,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 12:02:09,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 12:02:09,816 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:09,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:09,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2147298103, now seen corresponding path program 1 times [2025-02-05 12:02:09,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:09,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250454310] [2025-02-05 12:02:09,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:09,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-05 12:02:09,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-05 12:02:09,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:09,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:02:10,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250454310] [2025-02-05 12:02:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250454310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:10,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:10,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:10,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703531663] [2025-02-05 12:02:10,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:10,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:10,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:10,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:10,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:10,211 INFO L87 Difference]: Start difference. First operand 82315 states and 88510 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:12,051 INFO L93 Difference]: Finished difference Result 176576 states and 189763 transitions. [2025-02-05 12:02:12,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:12,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 447 [2025-02-05 12:02:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:12,166 INFO L225 Difference]: With dead ends: 176576 [2025-02-05 12:02:12,166 INFO L226 Difference]: Without dead ends: 93838 [2025-02-05 12:02:12,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:12,203 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 402 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:12,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 826 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:02:12,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93838 states. [2025-02-05 12:02:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93838 to 83165. [2025-02-05 12:02:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83165 states, 83164 states have (on average 1.0726275792410178) internal successors, (89204), 83164 states have internal predecessors, (89204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83165 states to 83165 states and 89204 transitions. [2025-02-05 12:02:13,139 INFO L78 Accepts]: Start accepts. Automaton has 83165 states and 89204 transitions. Word has length 447 [2025-02-05 12:02:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:13,139 INFO L471 AbstractCegarLoop]: Abstraction has 83165 states and 89204 transitions. [2025-02-05 12:02:13,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 83165 states and 89204 transitions. [2025-02-05 12:02:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-05 12:02:13,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:13,153 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:02:13,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:02:13,153 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:13,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:13,153 INFO L85 PathProgramCache]: Analyzing trace with hash -193617024, now seen corresponding path program 1 times [2025-02-05 12:02:13,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:13,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720378565] [2025-02-05 12:02:13,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:13,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:13,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-05 12:02:13,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-05 12:02:13,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:13,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:02:13,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:13,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720378565] [2025-02-05 12:02:13,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720378565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:13,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:13,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:02:13,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313520544] [2025-02-05 12:02:13,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:13,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:13,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:13,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:13,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:13,632 INFO L87 Difference]: Start difference. First operand 83165 states and 89204 transitions. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:16,566 INFO L93 Difference]: Finished difference Result 198702 states and 213089 transitions. [2025-02-05 12:02:16,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:16,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 548 [2025-02-05 12:02:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:16,745 INFO L225 Difference]: With dead ends: 198702 [2025-02-05 12:02:16,745 INFO L226 Difference]: Without dead ends: 115114 [2025-02-05 12:02:16,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:16,820 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 854 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:16,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 198 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:02:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115114 states. [2025-02-05 12:02:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115114 to 99355. [2025-02-05 12:02:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99355 states, 99354 states have (on average 1.0718038528896672) internal successors, (106488), 99354 states have internal predecessors, (106488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99355 states to 99355 states and 106488 transitions. [2025-02-05 12:02:18,528 INFO L78 Accepts]: Start accepts. Automaton has 99355 states and 106488 transitions. Word has length 548 [2025-02-05 12:02:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:18,529 INFO L471 AbstractCegarLoop]: Abstraction has 99355 states and 106488 transitions. [2025-02-05 12:02:18,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 99355 states and 106488 transitions. [2025-02-05 12:02:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-02-05 12:02:18,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:18,542 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:02:18,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:02:18,542 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:18,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash -856479908, now seen corresponding path program 1 times [2025-02-05 12:02:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:18,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358573422] [2025-02-05 12:02:18,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:18,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:18,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-02-05 12:02:18,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-02-05 12:02:18,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:18,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-02-05 12:02:18,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:18,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358573422] [2025-02-05 12:02:18,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358573422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:18,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:18,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:18,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097282667] [2025-02-05 12:02:18,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:18,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:18,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:18,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:18,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:18,893 INFO L87 Difference]: Start difference. First operand 99355 states and 106488 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:20,746 INFO L93 Difference]: Finished difference Result 211095 states and 226219 transitions. [2025-02-05 12:02:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:20,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 551 [2025-02-05 12:02:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:20,909 INFO L225 Difference]: With dead ends: 211095 [2025-02-05 12:02:20,909 INFO L226 Difference]: Without dead ends: 111314 [2025-02-05 12:02:20,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:20,980 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 428 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:20,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 279 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:02:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111314 states. [2025-02-05 12:02:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111314 to 101474. [2025-02-05 12:02:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101474 states, 101473 states have (on average 1.0709351255999133) internal successors, (108671), 101473 states have internal predecessors, (108671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101474 states to 101474 states and 108671 transitions. [2025-02-05 12:02:22,360 INFO L78 Accepts]: Start accepts. Automaton has 101474 states and 108671 transitions. Word has length 551 [2025-02-05 12:02:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:22,360 INFO L471 AbstractCegarLoop]: Abstraction has 101474 states and 108671 transitions. [2025-02-05 12:02:22,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 101474 states and 108671 transitions. [2025-02-05 12:02:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-02-05 12:02:22,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:22,376 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:02:22,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:02:22,377 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:22,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:22,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1565787121, now seen corresponding path program 1 times [2025-02-05 12:02:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:22,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207584468] [2025-02-05 12:02:22,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:22,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:22,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-02-05 12:02:22,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-02-05 12:02:22,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:22,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2025-02-05 12:02:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207584468] [2025-02-05 12:02:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207584468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:22,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:22,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690304887] [2025-02-05 12:02:22,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:22,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:22,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:22,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:22,786 INFO L87 Difference]: Start difference. First operand 101474 states and 108671 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:24,761 INFO L93 Difference]: Finished difference Result 216983 states and 232581 transitions. [2025-02-05 12:02:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:24,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 568 [2025-02-05 12:02:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:24,933 INFO L225 Difference]: With dead ends: 216983 [2025-02-05 12:02:24,933 INFO L226 Difference]: Without dead ends: 115084 [2025-02-05 12:02:25,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:25,004 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 416 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:25,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 325 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:02:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115084 states. [2025-02-05 12:02:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115084 to 95501. [2025-02-05 12:02:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95501 states, 95500 states have (on average 1.0677068062827224) internal successors, (101966), 95500 states have internal predecessors, (101966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95501 states to 95501 states and 101966 transitions. [2025-02-05 12:02:26,225 INFO L78 Accepts]: Start accepts. Automaton has 95501 states and 101966 transitions. Word has length 568 [2025-02-05 12:02:26,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:26,225 INFO L471 AbstractCegarLoop]: Abstraction has 95501 states and 101966 transitions. [2025-02-05 12:02:26,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 95501 states and 101966 transitions. [2025-02-05 12:02:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2025-02-05 12:02:26,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:26,238 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:26,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 12:02:26,238 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:26,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:26,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1726269347, now seen corresponding path program 1 times [2025-02-05 12:02:26,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:26,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433826529] [2025-02-05 12:02:26,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:26,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:26,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes. [2025-02-05 12:02:26,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements. [2025-02-05 12:02:26,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:26,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 542 proven. 72 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:02:26,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:26,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433826529] [2025-02-05 12:02:26,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433826529] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:26,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247196306] [2025-02-05 12:02:26,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:26,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:26,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:02:26,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:02:26,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 12:02:26,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes. [2025-02-05 12:02:27,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements. [2025-02-05 12:02:27,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:27,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:27,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 12:02:27,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:02:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 391 proven. 59 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 12:02:27,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:02:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 12:02:27,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247196306] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:27,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:02:27,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-02-05 12:02:27,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515522478] [2025-02-05 12:02:27,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:27,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:27,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:27,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:27,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:02:27,483 INFO L87 Difference]: Start difference. First operand 95501 states and 101966 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:30,056 INFO L93 Difference]: Finished difference Result 205916 states and 219736 transitions. [2025-02-05 12:02:30,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:30,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 628 [2025-02-05 12:02:30,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:30,210 INFO L225 Difference]: With dead ends: 205916 [2025-02-05 12:02:30,211 INFO L226 Difference]: Without dead ends: 109139 [2025-02-05 12:02:30,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1259 GetRequests, 1252 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:02:30,270 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 874 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2284 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 2703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 2284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:30,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 207 Invalid, 2703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 2284 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:02:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109139 states.