./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label31.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af3862af5b8a27b2989fe566f1104f15a4544b51e9167db28055ff534e84b220 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:18:51,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:18:51,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:18:51,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:18:51,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:18:51,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:18:51,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:18:51,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:18:51,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:18:51,441 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:18:51,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:18:51,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:18:51,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:18:51,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:18:51,442 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:18:51,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:18:51,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:18:51,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:18:51,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:18:51,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:18:51,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:18:51,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:18:51,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:18:51,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:18:51,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:18:51,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:18:51,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:18:51,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:18:51,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:18:51,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:18:51,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:18:51,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:18:51,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:18:51,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:18:51,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:18:51,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:18:51,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:18:51,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:18:51,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:18:51,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:18:51,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:18:51,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:18:51,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:18:51,445 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af3862af5b8a27b2989fe566f1104f15a4544b51e9167db28055ff534e84b220 [2025-03-16 15:18:51,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:18:51,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:18:51,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:18:51,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:18:51,688 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:18:51,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label31.c [2025-03-16 15:18:52,850 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8166b3a15/9b2efc56f5544b858500f4ecd7e968d5/FLAGa490ee5ce [2025-03-16 15:18:53,274 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:18:53,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label31.c [2025-03-16 15:18:53,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8166b3a15/9b2efc56f5544b858500f4ecd7e968d5/FLAGa490ee5ce [2025-03-16 15:18:53,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8166b3a15/9b2efc56f5544b858500f4ecd7e968d5 [2025-03-16 15:18:53,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:18:53,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:18:53,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:18:53,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:18:53,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:18:53,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:18:53" (1/1) ... [2025-03-16 15:18:53,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da69076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:53, skipping insertion in model container [2025-03-16 15:18:53,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:18:53" (1/1) ... [2025-03-16 15:18:53,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:18:53,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label31.c[1403,1416] [2025-03-16 15:18:53,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:18:53,996 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:18:54,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label31.c[1403,1416] [2025-03-16 15:18:54,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:18:54,196 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:18:54,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54 WrapperNode [2025-03-16 15:18:54,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:18:54,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:18:54,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:18:54,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:18:54,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (1/1) ... [2025-03-16 15:18:54,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (1/1) ... [2025-03-16 15:18:54,414 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-16 15:18:54,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:18:54,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:18:54,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:18:54,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:18:54,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (1/1) ... [2025-03-16 15:18:54,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (1/1) ... [2025-03-16 15:18:54,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (1/1) ... [2025-03-16 15:18:54,632 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:18:54,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (1/1) ... [2025-03-16 15:18:54,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (1/1) ... [2025-03-16 15:18:54,734 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (1/1) ... [2025-03-16 15:18:54,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (1/1) ... [2025-03-16 15:18:54,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (1/1) ... [2025-03-16 15:18:54,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (1/1) ... [2025-03-16 15:18:54,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:18:54,804 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:18:54,805 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:18:54,805 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:18:54,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (1/1) ... [2025-03-16 15:18:54,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:18:54,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:18:54,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:18:54,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:18:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:18:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:18:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:18:54,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:18:54,899 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:18:54,900 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:18:57,367 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-16 15:18:57,535 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-16 15:18:57,535 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:18:57,575 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:18:57,575 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:18:57,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:18:57 BoogieIcfgContainer [2025-03-16 15:18:57,576 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:18:57,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:18:57,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:18:57,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:18:57,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:18:53" (1/3) ... [2025-03-16 15:18:57,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719a80d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:18:57, skipping insertion in model container [2025-03-16 15:18:57,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:54" (2/3) ... [2025-03-16 15:18:57,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719a80d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:18:57, skipping insertion in model container [2025-03-16 15:18:57,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:18:57" (3/3) ... [2025-03-16 15:18:57,608 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label31.c [2025-03-16 15:18:57,622 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:18:57,623 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label31.c that has 1 procedures, 529 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:18:57,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:18:57,710 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;@1b63e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:18:57,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:18:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 15:18:57,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:57,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:57,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:57,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:57,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2127285138, now seen corresponding path program 1 times [2025-03-16 15:18:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:57,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730939233] [2025-03-16 15:18:57,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:57,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 15:18:57,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 15:18:57,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:57,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:18:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:57,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730939233] [2025-03-16 15:18:57,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730939233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:57,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:57,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:18:57,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3185123] [2025-03-16 15:18:57,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:57,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:18:57,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:57,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:18:57,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:18:57,856 INFO L87 Difference]: Start difference. First operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:57,907 INFO L93 Difference]: Finished difference Result 1057 states and 1999 transitions. [2025-03-16 15:18:57,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:18:57,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-16 15:18:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:57,927 INFO L225 Difference]: With dead ends: 1057 [2025-03-16 15:18:57,927 INFO L226 Difference]: Without dead ends: 526 [2025-03-16 15:18:57,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:18:57,933 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:57,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:18:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-16 15:18:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-16 15:18:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2025-03-16 15:18:57,988 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 7 [2025-03-16 15:18:57,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:57,988 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2025-03-16 15:18:57,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2025-03-16 15:18:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 15:18:57,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:57,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:57,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:18:57,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:57,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2127286099, now seen corresponding path program 1 times [2025-03-16 15:18:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:57,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169928502] [2025-03-16 15:18:57,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:57,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 15:18:58,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 15:18:58,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:58,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:18:58,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:58,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169928502] [2025-03-16 15:18:58,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169928502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:58,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:58,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:18:58,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531107463] [2025-03-16 15:18:58,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:58,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:58,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:58,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:58,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:58,053 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:59,914 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2025-03-16 15:18:59,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:59,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-16 15:18:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:59,918 INFO L225 Difference]: With dead ends: 1501 [2025-03-16 15:18:59,918 INFO L226 Difference]: Without dead ends: 976 [2025-03-16 15:18:59,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:59,919 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 464 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:59,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 449 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:18:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-16 15:18:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2025-03-16 15:18:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2025-03-16 15:18:59,945 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 7 [2025-03-16 15:18:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:59,945 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2025-03-16 15:18:59,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2025-03-16 15:18:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 15:18:59,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:59,947 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:18:59,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:18:59,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:59,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:59,948 INFO L85 PathProgramCache]: Analyzing trace with hash 126467273, now seen corresponding path program 1 times [2025-03-16 15:18:59,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:59,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005585468] [2025-03-16 15:18:59,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:59,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:59,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 15:19:00,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 15:19:00,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:00,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:00,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:00,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005585468] [2025-03-16 15:19:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005585468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:00,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:00,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:19:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723448293] [2025-03-16 15:19:00,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:00,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:00,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:00,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:00,181 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:02,024 INFO L93 Difference]: Finished difference Result 2812 states and 4380 transitions. [2025-03-16 15:19:02,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:02,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-16 15:19:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:02,032 INFO L225 Difference]: With dead ends: 2812 [2025-03-16 15:19:02,033 INFO L226 Difference]: Without dead ends: 1843 [2025-03-16 15:19:02,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:02,036 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 579 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.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:02,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 579 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:19:02,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-16 15:19:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2025-03-16 15:19:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3501903208265362) internal successors, (2483), 1839 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2483 transitions. [2025-03-16 15:19:02,071 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2483 transitions. Word has length 74 [2025-03-16 15:19:02,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:02,071 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2483 transitions. [2025-03-16 15:19:02,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2483 transitions. [2025-03-16 15:19:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 15:19:02,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:02,073 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:19:02,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:19:02,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:02,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:02,074 INFO L85 PathProgramCache]: Analyzing trace with hash 941346937, now seen corresponding path program 1 times [2025-03-16 15:19:02,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:02,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533999350] [2025-03-16 15:19:02,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:02,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:02,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 15:19:02,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 15:19:02,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:02,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:02,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533999350] [2025-03-16 15:19:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533999350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:02,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:02,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186791376] [2025-03-16 15:19:02,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:02,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:02,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:02,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:02,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:02,310 INFO L87 Difference]: Start difference. First operand 1840 states and 2483 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:05,015 INFO L93 Difference]: Finished difference Result 5862 states and 8155 transitions. [2025-03-16 15:19:05,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:19:05,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-16 15:19:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:05,027 INFO L225 Difference]: With dead ends: 5862 [2025-03-16 15:19:05,027 INFO L226 Difference]: Without dead ends: 4023 [2025-03-16 15:19:05,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:05,031 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 972 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2906 mSolverCounterSat, 697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 3603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 697 IncrementalHoareTripleChecker+Valid, 2906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:05,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 435 Invalid, 3603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [697 Valid, 2906 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:19:05,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4023 states. [2025-03-16 15:19:05,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4023 to 4019. [2025-03-16 15:19:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4019 states, 4018 states have (on average 1.326281732205077) internal successors, (5329), 4018 states have internal predecessors, (5329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5329 transitions. [2025-03-16 15:19:05,088 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5329 transitions. Word has length 77 [2025-03-16 15:19:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:05,089 INFO L471 AbstractCegarLoop]: Abstraction has 4019 states and 5329 transitions. [2025-03-16 15:19:05,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5329 transitions. [2025-03-16 15:19:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 15:19:05,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:05,095 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:05,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:19:05,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:05,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:05,096 INFO L85 PathProgramCache]: Analyzing trace with hash 542867720, now seen corresponding path program 1 times [2025-03-16 15:19:05,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:05,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824585491] [2025-03-16 15:19:05,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:05,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 15:19:05,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 15:19:05,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:05,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-16 15:19:05,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:05,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824585491] [2025-03-16 15:19:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824585491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:05,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:19:05,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550289371] [2025-03-16 15:19:05,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:05,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:05,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:05,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:05,338 INFO L87 Difference]: Start difference. First operand 4019 states and 5329 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:06,811 INFO L93 Difference]: Finished difference Result 10601 states and 14363 transitions. [2025-03-16 15:19:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:06,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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 142 [2025-03-16 15:19:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:06,826 INFO L225 Difference]: With dead ends: 10601 [2025-03-16 15:19:06,826 INFO L226 Difference]: Without dead ends: 6579 [2025-03-16 15:19:06,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:06,832 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 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.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:06,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:19:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2025-03-16 15:19:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 5304. [2025-03-16 15:19:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5304 states, 5303 states have (on average 1.2268527248727135) internal successors, (6506), 5303 states have internal predecessors, (6506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 6506 transitions. [2025-03-16 15:19:06,903 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 6506 transitions. Word has length 142 [2025-03-16 15:19:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:06,904 INFO L471 AbstractCegarLoop]: Abstraction has 5304 states and 6506 transitions. [2025-03-16 15:19:06,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 6506 transitions. [2025-03-16 15:19:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 15:19:06,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:06,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:06,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:19:06,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:06,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1029601602, now seen corresponding path program 1 times [2025-03-16 15:19:06,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:06,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344927881] [2025-03-16 15:19:06,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:06,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 15:19:06,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 15:19:06,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:06,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:19:07,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:07,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344927881] [2025-03-16 15:19:07,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344927881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:07,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:07,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830160086] [2025-03-16 15:19:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:07,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:07,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:07,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:07,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:07,074 INFO L87 Difference]: Start difference. First operand 5304 states and 6506 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:08,453 INFO L93 Difference]: Finished difference Result 13164 states and 16535 transitions. [2025-03-16 15:19:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:08,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-03-16 15:19:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:08,470 INFO L225 Difference]: With dead ends: 13164 [2025-03-16 15:19:08,471 INFO L226 Difference]: Without dead ends: 7861 [2025-03-16 15:19:08,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:08,477 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 500 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:08,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 806 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:19:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7861 states. [2025-03-16 15:19:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7861 to 7861. [2025-03-16 15:19:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7861 states, 7860 states have (on average 1.210178117048346) internal successors, (9512), 7860 states have internal predecessors, (9512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 9512 transitions. [2025-03-16 15:19:08,572 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 9512 transitions. Word has length 155 [2025-03-16 15:19:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:08,572 INFO L471 AbstractCegarLoop]: Abstraction has 7861 states and 9512 transitions. [2025-03-16 15:19:08,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 9512 transitions. [2025-03-16 15:19:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-16 15:19:08,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:08,576 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:19:08,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:19:08,576 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:08,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash -96791232, now seen corresponding path program 1 times [2025-03-16 15:19:08,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:08,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174879168] [2025-03-16 15:19:08,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:08,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:08,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-16 15:19:08,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-16 15:19:08,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:08,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-16 15:19:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174879168] [2025-03-16 15:19:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174879168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:08,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:08,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:08,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267461932] [2025-03-16 15:19:08,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:08,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:08,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:08,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:08,793 INFO L87 Difference]: Start difference. First operand 7861 states and 9512 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:10,329 INFO L93 Difference]: Finished difference Result 19109 states and 23098 transitions. [2025-03-16 15:19:10,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:10,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2025-03-16 15:19:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:10,351 INFO L225 Difference]: With dead ends: 19109 [2025-03-16 15:19:10,351 INFO L226 Difference]: Without dead ends: 10399 [2025-03-16 15:19:10,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:10,357 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 436 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:10,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 950 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:19:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10399 states. [2025-03-16 15:19:10,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10399 to 7414. [2025-03-16 15:19:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7414 states, 7413 states have (on average 1.165789828679347) internal successors, (8642), 7413 states have internal predecessors, (8642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7414 states to 7414 states and 8642 transitions. [2025-03-16 15:19:10,441 INFO L78 Accepts]: Start accepts. Automaton has 7414 states and 8642 transitions. Word has length 260 [2025-03-16 15:19:10,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:10,441 INFO L471 AbstractCegarLoop]: Abstraction has 7414 states and 8642 transitions. [2025-03-16 15:19:10,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 7414 states and 8642 transitions. [2025-03-16 15:19:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-16 15:19:10,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:10,444 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:19:10,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:19:10,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:10,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:10,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1614441590, now seen corresponding path program 1 times [2025-03-16 15:19:10,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:10,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145209265] [2025-03-16 15:19:10,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:10,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:10,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-16 15:19:10,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-16 15:19:10,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:10,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-16 15:19:10,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:10,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145209265] [2025-03-16 15:19:10,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145209265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:10,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:10,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:10,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519756131] [2025-03-16 15:19:10,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:10,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:10,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:10,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:10,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:10,573 INFO L87 Difference]: Start difference. First operand 7414 states and 8642 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:11,948 INFO L93 Difference]: Finished difference Result 18650 states and 21995 transitions. [2025-03-16 15:19:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:11,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2025-03-16 15:19:11,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:11,964 INFO L225 Difference]: With dead ends: 18650 [2025-03-16 15:19:11,964 INFO L226 Difference]: Without dead ends: 11236 [2025-03-16 15:19:11,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:11,972 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 451 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:11,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 425 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:19:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11236 states. [2025-03-16 15:19:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11236 to 8666. [2025-03-16 15:19:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8666 states, 8665 states have (on average 1.1521061742642815) internal successors, (9983), 8665 states have internal predecessors, (9983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8666 states to 8666 states and 9983 transitions. [2025-03-16 15:19:12,056 INFO L78 Accepts]: Start accepts. Automaton has 8666 states and 9983 transitions. Word has length 264 [2025-03-16 15:19:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:12,057 INFO L471 AbstractCegarLoop]: Abstraction has 8666 states and 9983 transitions. [2025-03-16 15:19:12,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 8666 states and 9983 transitions. [2025-03-16 15:19:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-16 15:19:12,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:12,059 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:19:12,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:19:12,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:12,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash -173382052, now seen corresponding path program 1 times [2025-03-16 15:19:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622288752] [2025-03-16 15:19:12,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:12,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-16 15:19:12,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-16 15:19:12,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:12,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 15:19:12,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622288752] [2025-03-16 15:19:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622288752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:12,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:12,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992457630] [2025-03-16 15:19:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:12,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:12,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:12,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:12,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:12,221 INFO L87 Difference]: Start difference. First operand 8666 states and 9983 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:13,754 INFO L93 Difference]: Finished difference Result 22010 states and 25364 transitions. [2025-03-16 15:19:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:13,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 277 [2025-03-16 15:19:13,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:13,772 INFO L225 Difference]: With dead ends: 22010 [2025-03-16 15:19:13,772 INFO L226 Difference]: Without dead ends: 13345 [2025-03-16 15:19:13,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:13,779 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 483 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:13,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 395 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:19:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13345 states. [2025-03-16 15:19:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13345 to 11641. [2025-03-16 15:19:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11641 states, 11640 states have (on average 1.1441580756013745) internal successors, (13318), 11640 states have internal predecessors, (13318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11641 states to 11641 states and 13318 transitions. [2025-03-16 15:19:13,884 INFO L78 Accepts]: Start accepts. Automaton has 11641 states and 13318 transitions. Word has length 277 [2025-03-16 15:19:13,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:13,885 INFO L471 AbstractCegarLoop]: Abstraction has 11641 states and 13318 transitions. [2025-03-16 15:19:13,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 11641 states and 13318 transitions. [2025-03-16 15:19:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-16 15:19:13,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:13,889 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:13,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:19:13,889 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:13,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:13,891 INFO L85 PathProgramCache]: Analyzing trace with hash -148451379, now seen corresponding path program 1 times [2025-03-16 15:19:13,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:13,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712844414] [2025-03-16 15:19:13,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:13,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 15:19:13,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 15:19:13,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:13,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 15:19:14,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:14,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712844414] [2025-03-16 15:19:14,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712844414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:14,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:14,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:14,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290284868] [2025-03-16 15:19:14,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:14,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:14,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:14,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:14,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:14,146 INFO L87 Difference]: Start difference. First operand 11641 states and 13318 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:15,548 INFO L93 Difference]: Finished difference Result 28846 states and 33335 transitions. [2025-03-16 15:19:15,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:15,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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-03-16 15:19:15,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:15,568 INFO L225 Difference]: With dead ends: 28846 [2025-03-16 15:19:15,568 INFO L226 Difference]: Without dead ends: 16781 [2025-03-16 15:19:15,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:15,576 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 382 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:15,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 913 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:19:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16781 states. [2025-03-16 15:19:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16781 to 16348. [2025-03-16 15:19:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16348 states, 16347 states have (on average 1.1292591912889216) internal successors, (18460), 16347 states have internal predecessors, (18460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16348 states to 16348 states and 18460 transitions. [2025-03-16 15:19:15,708 INFO L78 Accepts]: Start accepts. Automaton has 16348 states and 18460 transitions. Word has length 321 [2025-03-16 15:19:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:15,709 INFO L471 AbstractCegarLoop]: Abstraction has 16348 states and 18460 transitions. [2025-03-16 15:19:15,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 16348 states and 18460 transitions. [2025-03-16 15:19:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-16 15:19:15,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:15,712 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:15,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:19:15,712 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:15,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:15,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1793137645, now seen corresponding path program 1 times [2025-03-16 15:19:15,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:15,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171021824] [2025-03-16 15:19:15,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:15,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:15,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-16 15:19:15,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-16 15:19:15,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:15,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:19:16,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:16,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171021824] [2025-03-16 15:19:16,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171021824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:16,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:16,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295636141] [2025-03-16 15:19:16,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:16,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:16,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:16,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:16,077 INFO L87 Difference]: Start difference. First operand 16348 states and 18460 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:17,457 INFO L93 Difference]: Finished difference Result 39112 states and 44252 transitions. [2025-03-16 15:19:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:17,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 328 [2025-03-16 15:19:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:17,479 INFO L225 Difference]: With dead ends: 39112 [2025-03-16 15:19:17,479 INFO L226 Difference]: Without dead ends: 22332 [2025-03-16 15:19:17,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:17,493 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 393 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:17,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 770 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:19:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22332 states. [2025-03-16 15:19:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22332 to 19345. [2025-03-16 15:19:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19345 states, 19344 states have (on average 1.1328060380479736) internal successors, (21913), 19344 states have internal predecessors, (21913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19345 states to 19345 states and 21913 transitions. [2025-03-16 15:19:17,710 INFO L78 Accepts]: Start accepts. Automaton has 19345 states and 21913 transitions. Word has length 328 [2025-03-16 15:19:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:17,711 INFO L471 AbstractCegarLoop]: Abstraction has 19345 states and 21913 transitions. [2025-03-16 15:19:17,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 19345 states and 21913 transitions. [2025-03-16 15:19:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-16 15:19:17,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:17,717 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:19:17,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:19:17,718 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:17,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2011173457, now seen corresponding path program 1 times [2025-03-16 15:19:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:17,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025775633] [2025-03-16 15:19:17,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:17,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-16 15:19:17,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-16 15:19:17,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:17,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-16 15:19:17,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:17,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025775633] [2025-03-16 15:19:17,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025775633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:17,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:17,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:17,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324714787] [2025-03-16 15:19:17,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:17,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:17,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:17,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:17,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:17,939 INFO L87 Difference]: Start difference. First operand 19345 states and 21913 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:19,325 INFO L93 Difference]: Finished difference Result 45074 states and 51540 transitions. [2025-03-16 15:19:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:19,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 402 [2025-03-16 15:19:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:19,348 INFO L225 Difference]: With dead ends: 45074 [2025-03-16 15:19:19,348 INFO L226 Difference]: Without dead ends: 25305 [2025-03-16 15:19:19,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:19,361 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 341 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:19,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 789 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:19:19,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25305 states. [2025-03-16 15:19:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25305 to 19319. [2025-03-16 15:19:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19319 states, 19318 states have (on average 1.1325188942954758) internal successors, (21878), 19318 states have internal predecessors, (21878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19319 states to 19319 states and 21878 transitions. [2025-03-16 15:19:19,599 INFO L78 Accepts]: Start accepts. Automaton has 19319 states and 21878 transitions. Word has length 402 [2025-03-16 15:19:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:19,599 INFO L471 AbstractCegarLoop]: Abstraction has 19319 states and 21878 transitions. [2025-03-16 15:19:19,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 19319 states and 21878 transitions. [2025-03-16 15:19:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 15:19:19,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:19,607 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:19,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:19:19,607 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:19,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:19,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1970732584, now seen corresponding path program 1 times [2025-03-16 15:19:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39359096] [2025-03-16 15:19:19,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:19,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 15:19:19,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 15:19:19,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:19,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-16 15:19:19,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:19,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39359096] [2025-03-16 15:19:19,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39359096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:19,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:19,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531998610] [2025-03-16 15:19:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:19,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:19,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:19,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:19,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:19,948 INFO L87 Difference]: Start difference. First operand 19319 states and 21878 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:21,437 INFO L93 Difference]: Finished difference Result 47155 states and 53417 transitions. [2025-03-16 15:19:21,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:21,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 403 [2025-03-16 15:19:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:21,461 INFO L225 Difference]: With dead ends: 47155 [2025-03-16 15:19:21,462 INFO L226 Difference]: Without dead ends: 26976 [2025-03-16 15:19:21,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:21,473 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 446 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:21,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 661 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:19:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26976 states. [2025-03-16 15:19:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26976 to 24413. [2025-03-16 15:19:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24413 states, 24412 states have (on average 1.12350483368835) internal successors, (27427), 24412 states have internal predecessors, (27427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24413 states to 24413 states and 27427 transitions. [2025-03-16 15:19:21,736 INFO L78 Accepts]: Start accepts. Automaton has 24413 states and 27427 transitions. Word has length 403 [2025-03-16 15:19:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:21,736 INFO L471 AbstractCegarLoop]: Abstraction has 24413 states and 27427 transitions. [2025-03-16 15:19:21,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 24413 states and 27427 transitions. [2025-03-16 15:19:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-16 15:19:21,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:21,743 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:19:21,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:19:21,743 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:21,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash 88432703, now seen corresponding path program 1 times [2025-03-16 15:19:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847088382] [2025-03-16 15:19:21,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:21,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-16 15:19:21,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-16 15:19:21,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:21,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 15:19:22,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:22,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847088382] [2025-03-16 15:19:22,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847088382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:22,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:22,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:19:22,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419228797] [2025-03-16 15:19:22,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:22,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:22,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:22,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:22,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:22,172 INFO L87 Difference]: Start difference. First operand 24413 states and 27427 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:24,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:24,253 INFO L93 Difference]: Finished difference Result 62486 states and 70115 transitions. [2025-03-16 15:19:24,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:19:24,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 407 [2025-03-16 15:19:24,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:24,290 INFO L225 Difference]: With dead ends: 62486 [2025-03-16 15:19:24,291 INFO L226 Difference]: Without dead ends: 38074 [2025-03-16 15:19:24,304 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-03-16 15:19:24,304 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 836 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:24,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 199 Invalid, 2879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:19:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38074 states. [2025-03-16 15:19:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38074 to 34225. [2025-03-16 15:19:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34225 states, 34224 states have (on average 1.1238896680691912) internal successors, (38464), 34224 states have internal predecessors, (38464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34225 states to 34225 states and 38464 transitions. [2025-03-16 15:19:24,642 INFO L78 Accepts]: Start accepts. Automaton has 34225 states and 38464 transitions. Word has length 407 [2025-03-16 15:19:24,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:24,643 INFO L471 AbstractCegarLoop]: Abstraction has 34225 states and 38464 transitions. [2025-03-16 15:19:24,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 34225 states and 38464 transitions. [2025-03-16 15:19:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-16 15:19:24,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:24,651 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:19:24,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:19:24,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:24,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:24,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1500509525, now seen corresponding path program 1 times [2025-03-16 15:19:24,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:24,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477970777] [2025-03-16 15:19:24,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:24,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:24,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-16 15:19:24,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-16 15:19:24,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:24,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-16 15:19:25,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:25,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477970777] [2025-03-16 15:19:25,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477970777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:25,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:25,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971507794] [2025-03-16 15:19:25,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:25,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:25,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:25,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:25,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:25,028 INFO L87 Difference]: Start difference. First operand 34225 states and 38464 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:26,335 INFO L93 Difference]: Finished difference Result 77394 states and 87185 transitions. [2025-03-16 15:19:26,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:26,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 426 [2025-03-16 15:19:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:26,378 INFO L225 Difference]: With dead ends: 77394 [2025-03-16 15:19:26,378 INFO L226 Difference]: Without dead ends: 43170 [2025-03-16 15:19:26,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:26,389 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 392 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:26,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 334 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:19:26,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43170 states. [2025-03-16 15:19:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43170 to 42735. [2025-03-16 15:19:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42735 states, 42734 states have (on average 1.1186408948378341) internal successors, (47804), 42734 states have internal predecessors, (47804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42735 states to 42735 states and 47804 transitions. [2025-03-16 15:19:26,855 INFO L78 Accepts]: Start accepts. Automaton has 42735 states and 47804 transitions. Word has length 426 [2025-03-16 15:19:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:26,856 INFO L471 AbstractCegarLoop]: Abstraction has 42735 states and 47804 transitions. [2025-03-16 15:19:26,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 42735 states and 47804 transitions. [2025-03-16 15:19:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-16 15:19:26,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:26,862 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:19:26,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:19:26,862 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:26,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:26,863 INFO L85 PathProgramCache]: Analyzing trace with hash -111735799, now seen corresponding path program 1 times [2025-03-16 15:19:26,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:26,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343370195] [2025-03-16 15:19:26,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:26,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:26,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-16 15:19:26,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-16 15:19:26,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:26,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-16 15:19:27,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:27,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343370195] [2025-03-16 15:19:27,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343370195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:27,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:27,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:27,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284196694] [2025-03-16 15:19:27,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:27,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:27,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:27,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:27,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:27,378 INFO L87 Difference]: Start difference. First operand 42735 states and 47804 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:28,887 INFO L93 Difference]: Finished difference Result 98671 states and 109853 transitions. [2025-03-16 15:19:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:28,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 427 [2025-03-16 15:19:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:28,954 INFO L225 Difference]: With dead ends: 98671 [2025-03-16 15:19:28,954 INFO L226 Difference]: Without dead ends: 55085 [2025-03-16 15:19:28,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:28,987 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 372 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:28,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 824 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:19:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55085 states. [2025-03-16 15:19:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55085 to 52940. [2025-03-16 15:19:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52940 states, 52939 states have (on average 1.1039498290485275) internal successors, (58442), 52939 states have internal predecessors, (58442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52940 states to 52940 states and 58442 transitions. [2025-03-16 15:19:29,590 INFO L78 Accepts]: Start accepts. Automaton has 52940 states and 58442 transitions. Word has length 427 [2025-03-16 15:19:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:29,591 INFO L471 AbstractCegarLoop]: Abstraction has 52940 states and 58442 transitions. [2025-03-16 15:19:29,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 52940 states and 58442 transitions. [2025-03-16 15:19:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-16 15:19:29,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:29,598 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:19:29,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:19:29,598 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:29,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash 152017257, now seen corresponding path program 1 times [2025-03-16 15:19:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:29,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389499368] [2025-03-16 15:19:29,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:29,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:29,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-16 15:19:29,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-16 15:19:29,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:29,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-16 15:19:29,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:29,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389499368] [2025-03-16 15:19:29,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389499368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:29,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:29,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:29,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906737136] [2025-03-16 15:19:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:29,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:29,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:29,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:29,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:29,920 INFO L87 Difference]: Start difference. First operand 52940 states and 58442 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:31,318 INFO L93 Difference]: Finished difference Result 113562 states and 125553 transitions. [2025-03-16 15:19:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:31,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 450 [2025-03-16 15:19:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:31,396 INFO L225 Difference]: With dead ends: 113562 [2025-03-16 15:19:31,396 INFO L226 Difference]: Without dead ends: 60194 [2025-03-16 15:19:31,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:31,432 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 427 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:31,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 265 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:19:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60194 states. [2025-03-16 15:19:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60194 to 58470. [2025-03-16 15:19:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58470 states, 58469 states have (on average 1.1043629957755392) internal successors, (64571), 58469 states have internal predecessors, (64571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58470 states to 58470 states and 64571 transitions. [2025-03-16 15:19:31,949 INFO L78 Accepts]: Start accepts. Automaton has 58470 states and 64571 transitions. Word has length 450 [2025-03-16 15:19:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:31,949 INFO L471 AbstractCegarLoop]: Abstraction has 58470 states and 64571 transitions. [2025-03-16 15:19:31,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 58470 states and 64571 transitions. [2025-03-16 15:19:31,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-16 15:19:31,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:31,954 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:31,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:19:31,954 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:31,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:31,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1999353814, now seen corresponding path program 1 times [2025-03-16 15:19:31,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:31,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241327458] [2025-03-16 15:19:31,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:31,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:32,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-16 15:19:32,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-16 15:19:32,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:32,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-03-16 15:19:32,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:32,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241327458] [2025-03-16 15:19:32,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241327458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:32,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:32,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:32,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696067932] [2025-03-16 15:19:32,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:32,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:32,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:32,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:32,188 INFO L87 Difference]: Start difference. First operand 58470 states and 64571 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:33,562 INFO L93 Difference]: Finished difference Result 139068 states and 153532 transitions. [2025-03-16 15:19:33,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:33,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 450 [2025-03-16 15:19:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:33,648 INFO L225 Difference]: With dead ends: 139068 [2025-03-16 15:19:33,648 INFO L226 Difference]: Without dead ends: 80599 [2025-03-16 15:19:33,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:33,687 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 474 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:33,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 280 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:19:33,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80599 states. [2025-03-16 15:19:34,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80599 to 78443. [2025-03-16 15:19:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78443 states, 78442 states have (on average 1.0981616990897733) internal successors, (86142), 78442 states have internal predecessors, (86142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78443 states to 78443 states and 86142 transitions. [2025-03-16 15:19:34,594 INFO L78 Accepts]: Start accepts. Automaton has 78443 states and 86142 transitions. Word has length 450 [2025-03-16 15:19:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:34,594 INFO L471 AbstractCegarLoop]: Abstraction has 78443 states and 86142 transitions. [2025-03-16 15:19:34,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 78443 states and 86142 transitions. [2025-03-16 15:19:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-16 15:19:34,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:34,601 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:34,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:19:34,601 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:34,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:34,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1036267633, now seen corresponding path program 1 times [2025-03-16 15:19:34,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:34,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157962402] [2025-03-16 15:19:34,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:34,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:34,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-16 15:19:34,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-16 15:19:34,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:34,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-16 15:19:34,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:34,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157962402] [2025-03-16 15:19:34,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157962402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:34,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:34,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:34,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013910573] [2025-03-16 15:19:34,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:34,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:34,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:34,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:34,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:34,932 INFO L87 Difference]: Start difference. First operand 78443 states and 86142 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:36,648 INFO L93 Difference]: Finished difference Result 172218 states and 188926 transitions. [2025-03-16 15:19:36,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:36,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 450 [2025-03-16 15:19:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:36,741 INFO L225 Difference]: With dead ends: 172218 [2025-03-16 15:19:36,741 INFO L226 Difference]: Without dead ends: 93348 [2025-03-16 15:19:36,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:36,787 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 293 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:36,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 812 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:19:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93348 states. [2025-03-16 15:19:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93348 to 92054. [2025-03-16 15:19:37,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92054 states, 92053 states have (on average 1.0885902686495823) internal successors, (100208), 92053 states have internal predecessors, (100208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92054 states to 92054 states and 100208 transitions. [2025-03-16 15:19:37,886 INFO L78 Accepts]: Start accepts. Automaton has 92054 states and 100208 transitions. Word has length 450 [2025-03-16 15:19:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:37,886 INFO L471 AbstractCegarLoop]: Abstraction has 92054 states and 100208 transitions. [2025-03-16 15:19:37,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 92054 states and 100208 transitions. [2025-03-16 15:19:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-16 15:19:37,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:37,891 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:37,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:19:37,892 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:37,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash 699309402, now seen corresponding path program 1 times [2025-03-16 15:19:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:37,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854589459] [2025-03-16 15:19:37,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:37,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:37,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-16 15:19:37,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-16 15:19:37,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:37,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:19:38,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:38,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854589459] [2025-03-16 15:19:38,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854589459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:38,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:38,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:38,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662480684] [2025-03-16 15:19:38,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:38,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:38,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:38,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:38,318 INFO L87 Difference]: Start difference. First operand 92054 states and 100208 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:39,826 INFO L93 Difference]: Finished difference Result 194756 states and 211860 transitions. [2025-03-16 15:19:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:39,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 453 [2025-03-16 15:19:39,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:39,951 INFO L225 Difference]: With dead ends: 194756 [2025-03-16 15:19:39,951 INFO L226 Difference]: Without dead ends: 102278 [2025-03-16 15:19:40,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:40,015 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 247 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:40,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 788 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:19:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102278 states. [2025-03-16 15:19:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102278 to 97590. [2025-03-16 15:19:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97590 states, 97589 states have (on average 1.0835237578005719) internal successors, (105740), 97589 states have internal predecessors, (105740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97590 states to 97590 states and 105740 transitions. [2025-03-16 15:19:41,141 INFO L78 Accepts]: Start accepts. Automaton has 97590 states and 105740 transitions. Word has length 453 [2025-03-16 15:19:41,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:41,142 INFO L471 AbstractCegarLoop]: Abstraction has 97590 states and 105740 transitions. [2025-03-16 15:19:41,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 97590 states and 105740 transitions. [2025-03-16 15:19:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-16 15:19:41,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:41,148 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:41,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:19:41,148 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:41,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:41,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2044940876, now seen corresponding path program 1 times [2025-03-16 15:19:41,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:41,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156579649] [2025-03-16 15:19:41,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:41,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:41,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-16 15:19:41,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-16 15:19:41,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:41,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 15:19:41,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:41,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156579649] [2025-03-16 15:19:41,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156579649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:41,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:41,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:41,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845512313] [2025-03-16 15:19:41,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:41,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:41,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:41,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:41,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:41,377 INFO L87 Difference]: Start difference. First operand 97590 states and 105740 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:43,166 INFO L93 Difference]: Finished difference Result 207540 states and 225048 transitions. [2025-03-16 15:19:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:43,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 498 [2025-03-16 15:19:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:43,297 INFO L225 Difference]: With dead ends: 207540 [2025-03-16 15:19:43,297 INFO L226 Difference]: Without dead ends: 109513 [2025-03-16 15:19:43,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:43,360 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 489 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:43,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 696 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:19:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109513 states. [2025-03-16 15:19:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109513 to 105661. [2025-03-16 15:19:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105661 states, 105660 states have (on average 1.0785727806170737) internal successors, (113962), 105660 states have internal predecessors, (113962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105661 states to 105661 states and 113962 transitions. [2025-03-16 15:19:44,615 INFO L78 Accepts]: Start accepts. Automaton has 105661 states and 113962 transitions. Word has length 498 [2025-03-16 15:19:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:44,615 INFO L471 AbstractCegarLoop]: Abstraction has 105661 states and 113962 transitions. [2025-03-16 15:19:44,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 105661 states and 113962 transitions. [2025-03-16 15:19:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2025-03-16 15:19:44,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:44,624 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:44,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:19:44,624 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:44,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:44,625 INFO L85 PathProgramCache]: Analyzing trace with hash 738990285, now seen corresponding path program 1 times [2025-03-16 15:19:44,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:44,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030533037] [2025-03-16 15:19:44,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:44,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:44,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-03-16 15:19:44,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-03-16 15:19:44,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:44,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-16 15:19:44,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:44,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030533037] [2025-03-16 15:19:44,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030533037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:44,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:44,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 15:19:44,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452489825] [2025-03-16 15:19:44,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:44,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:19:44,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:44,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:19:44,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:19:44,996 INFO L87 Difference]: Start difference. First operand 105661 states and 113962 transitions. Second operand has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:47,997 INFO L93 Difference]: Finished difference Result 244108 states and 263028 transitions. [2025-03-16 15:19:47,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:19:47,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 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 562 [2025-03-16 15:19:47,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:48,142 INFO L225 Difference]: With dead ends: 244108 [2025-03-16 15:19:48,142 INFO L226 Difference]: Without dead ends: 137595 [2025-03-16 15:19:48,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:19:48,191 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1213 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3327 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 3772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 3327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:48,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 246 Invalid, 3772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 3327 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:19:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137595 states. [2025-03-16 15:19:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137595 to 120558. [2025-03-16 15:19:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120558 states, 120557 states have (on average 1.0706719642990452) internal successors, (129077), 120557 states have internal predecessors, (129077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120558 states to 120558 states and 129077 transitions. [2025-03-16 15:19:49,754 INFO L78 Accepts]: Start accepts. Automaton has 120558 states and 129077 transitions. Word has length 562 [2025-03-16 15:19:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:49,754 INFO L471 AbstractCegarLoop]: Abstraction has 120558 states and 129077 transitions. [2025-03-16 15:19:49,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 120558 states and 129077 transitions. [2025-03-16 15:19:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2025-03-16 15:19:49,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:49,768 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:49,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:19:49,768 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:49,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:49,769 INFO L85 PathProgramCache]: Analyzing trace with hash 502372460, now seen corresponding path program 1 times [2025-03-16 15:19:49,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:49,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12538693] [2025-03-16 15:19:49,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:49,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:49,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-03-16 15:19:49,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-03-16 15:19:49,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:49,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-16 15:19:50,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:50,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12538693] [2025-03-16 15:19:50,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12538693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:50,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:50,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 15:19:50,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169496648] [2025-03-16 15:19:50,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:50,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:19:50,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:50,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:19:50,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:19:50,206 INFO L87 Difference]: Start difference. First operand 120558 states and 129077 transitions. Second operand has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:53,007 INFO L93 Difference]: Finished difference Result 274761 states and 294267 transitions. [2025-03-16 15:19:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:19:53,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 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 562 [2025-03-16 15:19:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:53,366 INFO L225 Difference]: With dead ends: 274761 [2025-03-16 15:19:53,366 INFO L226 Difference]: Without dead ends: 152929 [2025-03-16 15:19:53,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:19:53,417 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1654 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 3333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:53,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 176 Invalid, 3333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:19:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152929 states. [2025-03-16 15:19:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152929 to 127794. [2025-03-16 15:19:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127794 states, 127793 states have (on average 1.069197843387353) internal successors, (136636), 127793 states have internal predecessors, (136636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127794 states to 127794 states and 136636 transitions. [2025-03-16 15:19:54,798 INFO L78 Accepts]: Start accepts. Automaton has 127794 states and 136636 transitions. Word has length 562 [2025-03-16 15:19:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:54,799 INFO L471 AbstractCegarLoop]: Abstraction has 127794 states and 136636 transitions. [2025-03-16 15:19:54,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 127794 states and 136636 transitions. [2025-03-16 15:19:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-16 15:19:54,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:54,806 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:54,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:19:54,807 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:54,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:54,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2117608487, now seen corresponding path program 1 times [2025-03-16 15:19:54,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:54,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351240022] [2025-03-16 15:19:54,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:54,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:54,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-16 15:19:54,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-16 15:19:54,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:54,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-16 15:19:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351240022] [2025-03-16 15:19:55,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351240022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:55,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:55,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:19:55,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143155958] [2025-03-16 15:19:55,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:55,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:55,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:55,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:55,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:55,399 INFO L87 Difference]: Start difference. First operand 127794 states and 136636 transitions. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:57,848 INFO L93 Difference]: Finished difference Result 267934 states and 286153 transitions. [2025-03-16 15:19:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:19:57,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 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 567 [2025-03-16 15:19:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:58,006 INFO L225 Difference]: With dead ends: 267934 [2025-03-16 15:19:58,006 INFO L226 Difference]: Without dead ends: 140141 [2025-03-16 15:19:58,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:58,075 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 725 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:58,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 336 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:19:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140141 states. [2025-03-16 15:19:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140141 to 136732. [2025-03-16 15:19:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136732 states, 136731 states have (on average 1.0627875170956111) internal successors, (145316), 136731 states have internal predecessors, (145316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136732 states to 136732 states and 145316 transitions. [2025-03-16 15:19:59,637 INFO L78 Accepts]: Start accepts. Automaton has 136732 states and 145316 transitions. Word has length 567 [2025-03-16 15:19:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:59,638 INFO L471 AbstractCegarLoop]: Abstraction has 136732 states and 145316 transitions. [2025-03-16 15:19:59,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 136732 states and 145316 transitions. [2025-03-16 15:19:59,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-16 15:19:59,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:59,646 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:59,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:19:59,646 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:59,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:59,646 INFO L85 PathProgramCache]: Analyzing trace with hash -428151963, now seen corresponding path program 1 times [2025-03-16 15:19:59,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:59,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466068614] [2025-03-16 15:19:59,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:59,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-16 15:19:59,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-16 15:19:59,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:59,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-16 15:19:59,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:59,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466068614] [2025-03-16 15:19:59,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466068614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:59,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:59,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:59,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975321496] [2025-03-16 15:19:59,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:59,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:59,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:59,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:59,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:59,795 INFO L87 Difference]: Start difference. First operand 136732 states and 145316 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:01,429 INFO L93 Difference]: Finished difference Result 270059 states and 286935 transitions. [2025-03-16 15:20:01,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:01,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 593 [2025-03-16 15:20:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:01,580 INFO L225 Difference]: With dead ends: 270059 [2025-03-16 15:20:01,580 INFO L226 Difference]: Without dead ends: 133328 [2025-03-16 15:20:01,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:01,658 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 497 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:01,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 606 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:20:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133328 states. [2025-03-16 15:20:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133328 to 132895. [2025-03-16 15:20:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132895 states, 132894 states have (on average 1.0552846629644679) internal successors, (140241), 132894 states have internal predecessors, (140241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132895 states to 132895 states and 140241 transitions. [2025-03-16 15:20:03,408 INFO L78 Accepts]: Start accepts. Automaton has 132895 states and 140241 transitions. Word has length 593 [2025-03-16 15:20:03,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:03,409 INFO L471 AbstractCegarLoop]: Abstraction has 132895 states and 140241 transitions. [2025-03-16 15:20:03,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:03,409 INFO L276 IsEmpty]: Start isEmpty. Operand 132895 states and 140241 transitions. [2025-03-16 15:20:03,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-03-16 15:20:03,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:03,417 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:03,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 15:20:03,417 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:03,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:03,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1279144690, now seen corresponding path program 1 times [2025-03-16 15:20:03,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:03,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352814436] [2025-03-16 15:20:03,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:03,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:03,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-03-16 15:20:03,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-03-16 15:20:03,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:03,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-16 15:20:03,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:03,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352814436] [2025-03-16 15:20:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352814436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:03,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:03,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:20:03,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449219994] [2025-03-16 15:20:03,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:03,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:20:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:03,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:20:03,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:20:03,926 INFO L87 Difference]: Start difference. First operand 132895 states and 140241 transitions. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:06,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:06,157 INFO L93 Difference]: Finished difference Result 275603 states and 290746 transitions. [2025-03-16 15:20:06,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:20:06,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 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 596 [2025-03-16 15:20:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:06,319 INFO L225 Difference]: With dead ends: 275603 [2025-03-16 15:20:06,319 INFO L226 Difference]: Without dead ends: 142709 [2025-03-16 15:20:06,375 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-03-16 15:20:06,375 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 715 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:06,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 258 Invalid, 2573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:20:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142709 states. [2025-03-16 15:20:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142709 to 132039. [2025-03-16 15:20:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132039 states, 132038 states have (on average 1.0521516533119253) internal successors, (138924), 132038 states have internal predecessors, (138924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132039 states to 132039 states and 138924 transitions. [2025-03-16 15:20:08,368 INFO L78 Accepts]: Start accepts. Automaton has 132039 states and 138924 transitions. Word has length 596 [2025-03-16 15:20:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:08,369 INFO L471 AbstractCegarLoop]: Abstraction has 132039 states and 138924 transitions. [2025-03-16 15:20:08,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 132039 states and 138924 transitions. [2025-03-16 15:20:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-03-16 15:20:08,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:08,377 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:08,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 15:20:08,377 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:08,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:08,377 INFO L85 PathProgramCache]: Analyzing trace with hash -500696530, now seen corresponding path program 1 times [2025-03-16 15:20:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:08,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288545177] [2025-03-16 15:20:08,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:08,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:08,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-03-16 15:20:08,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-03-16 15:20:08,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:08,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-16 15:20:08,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:08,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288545177] [2025-03-16 15:20:08,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288545177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:08,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:08,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:20:08,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306402751] [2025-03-16 15:20:08,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:08,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:20:08,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:08,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:20:08,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:20:08,616 INFO L87 Difference]: Start difference. First operand 132039 states and 138924 transitions. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:20:10,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:10,748 INFO L93 Difference]: Finished difference Result 270905 states and 284876 transitions. [2025-03-16 15:20:10,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:20:10,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 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 602 [2025-03-16 15:20:10,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:10,921 INFO L225 Difference]: With dead ends: 270905 [2025-03-16 15:20:10,921 INFO L226 Difference]: Without dead ends: 138867 [2025-03-16 15:20:10,985 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-03-16 15:20:10,986 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 733 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2723 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:10,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 678 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2723 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:20:11,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138867 states. [2025-03-16 15:20:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138867 to 132039. [2025-03-16 15:20:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132039 states, 132038 states have (on average 1.0520153289204623) internal successors, (138906), 132038 states have internal predecessors, (138906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)