./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_label28.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 a9f11574ad30fc17c07131211bf5f95490e2bdab1a5c8ef6b6afc80480ba8e82 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:59:57,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:59:57,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:59:57,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:59:57,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:59:57,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:59:57,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:59:57,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:59:57,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:59:57,688 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:59:57,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:59:57,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:59:57,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:59:57,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:59:57,690 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:59:57,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:59:57,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:59:57,690 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:59:57,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:59:57,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:59:57,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:59:57,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:59:57,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:59:57,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:59:57,690 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:59:57,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:59:57,691 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:59:57,691 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:59:57,691 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:59:57,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:59:57,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:59:57,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:59:57,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:59:57,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:59:57,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:59:57,692 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:59:57,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:59:57,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:59:57,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:59:57,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:59:57,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:59:57,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:59:57,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:59:57,693 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 -> a9f11574ad30fc17c07131211bf5f95490e2bdab1a5c8ef6b6afc80480ba8e82 [2025-03-03 10:59:57,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:59:57,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:59:57,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:59:57,904 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:59:57,905 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:59:57,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label28.c [2025-03-03 10:59:59,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f663707/044d7c4863124b87af974e1c898a66f1/FLAG7582c96cc [2025-03-03 10:59:59,347 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:59:59,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label28.c [2025-03-03 10:59:59,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f663707/044d7c4863124b87af974e1c898a66f1/FLAG7582c96cc [2025-03-03 10:59:59,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f663707/044d7c4863124b87af974e1c898a66f1 [2025-03-03 10:59:59,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:59:59,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:59:59,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:59:59,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:59:59,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:59:59,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:59:59" (1/1) ... [2025-03-03 10:59:59,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f8c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:59, skipping insertion in model container [2025-03-03 10:59:59,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:59:59" (1/1) ... [2025-03-03 10:59:59,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:59:59,805 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_label28.c[9518,9531] [2025-03-03 11:00:00,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:00:00,097 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:00:00,120 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_label28.c[9518,9531] [2025-03-03 11:00:00,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:00:00,316 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:00:00,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00 WrapperNode [2025-03-03 11:00:00,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:00:00,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:00:00,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:00:00,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:00:00,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (1/1) ... [2025-03-03 11:00:00,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (1/1) ... [2025-03-03 11:00:00,543 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-03 11:00:00,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:00:00,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:00:00,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:00:00,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:00:00,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (1/1) ... [2025-03-03 11:00:00,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (1/1) ... [2025-03-03 11:00:00,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (1/1) ... [2025-03-03 11:00:00,704 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-03 11:00:00,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (1/1) ... [2025-03-03 11:00:00,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (1/1) ... [2025-03-03 11:00:00,768 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (1/1) ... [2025-03-03 11:00:00,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (1/1) ... [2025-03-03 11:00:00,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (1/1) ... [2025-03-03 11:00:00,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (1/1) ... [2025-03-03 11:00:00,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:00:00,850 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:00:00,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:00:00,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:00:00,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (1/1) ... [2025-03-03 11:00:00,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:00:00,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:00:00,876 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-03 11:00:00,878 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-03 11:00:00,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:00:00,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:00:00,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:00:00,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:00:00,944 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:00:00,946 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:00:03,259 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-03 11:00:03,347 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 11:00:03,347 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:00:03,371 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:00:03,371 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:00:03,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:00:03 BoogieIcfgContainer [2025-03-03 11:00:03,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:00:03,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:00:03,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:00:03,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:00:03,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:59:59" (1/3) ... [2025-03-03 11:00:03,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7200181e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:00:03, skipping insertion in model container [2025-03-03 11:00:03,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:00" (2/3) ... [2025-03-03 11:00:03,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7200181e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:00:03, skipping insertion in model container [2025-03-03 11:00:03,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:00:03" (3/3) ... [2025-03-03 11:00:03,378 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label28.c [2025-03-03 11:00:03,389 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:00:03,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label28.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:00:03,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:00:03,459 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;@5766ac90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:00:03,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:00:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 11:00:03,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:03,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:03,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:03,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:03,477 INFO L85 PathProgramCache]: Analyzing trace with hash -928823129, now seen corresponding path program 1 times [2025-03-03 11:00:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:03,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075359412] [2025-03-03 11:00:03,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:03,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 11:00:03,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 11:00:03,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:03,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:03,808 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-03 11:00:03,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:03,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075359412] [2025-03-03 11:00:03,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075359412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:03,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:03,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:00:03,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735631563] [2025-03-03 11:00:03,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:03,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:03,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:03,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:03,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:03,830 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:05,756 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-03-03 11:00:05,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:05,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-03 11:00:05,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:05,767 INFO L225 Difference]: With dead ends: 1642 [2025-03-03 11:00:05,767 INFO L226 Difference]: Without dead ends: 975 [2025-03-03 11:00:05,770 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-03 11:00:05,771 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 426 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:05,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 551 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 11:00:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-03 11:00:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-03-03 11:00:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-03-03 11:00:05,819 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 64 [2025-03-03 11:00:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:05,819 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-03-03 11:00:05,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-03-03 11:00:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 11:00:05,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:05,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:05,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:00:05,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:05,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:05,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1658340145, now seen corresponding path program 1 times [2025-03-03 11:00:05,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:05,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240491202] [2025-03-03 11:00:05,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:05,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:05,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 11:00:05,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 11:00:05,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:05,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:00:06,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:06,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240491202] [2025-03-03 11:00:06,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240491202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:06,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:06,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:06,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254060115] [2025-03-03 11:00:06,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:06,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:06,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:06,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:06,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:06,105 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:07,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:07,828 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2025-03-03 11:00:07,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:07,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-03 11:00:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:07,835 INFO L225 Difference]: With dead ends: 2814 [2025-03-03 11:00:07,835 INFO L226 Difference]: Without dead ends: 1844 [2025-03-03 11:00:07,838 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-03 11:00:07,839 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 427 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:07,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:00:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-03 11:00:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2025-03-03 11:00:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2025-03-03 11:00:07,887 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 134 [2025-03-03 11:00:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:07,887 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2025-03-03 11:00:07,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2025-03-03 11:00:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 11:00:07,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:07,895 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:00:07,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:00:07,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:07,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:07,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1233779132, now seen corresponding path program 1 times [2025-03-03 11:00:07,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:07,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652673677] [2025-03-03 11:00:07,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:07,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:07,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 11:00:07,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 11:00:07,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:07,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:00:08,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652673677] [2025-03-03 11:00:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652673677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:08,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:00:08,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117841126] [2025-03-03 11:00:08,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:08,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:08,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:08,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:08,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:08,089 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:09,675 INFO L93 Difference]: Finished difference Result 5395 states and 7326 transitions. [2025-03-03 11:00:09,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:09,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-03 11:00:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:09,685 INFO L225 Difference]: With dead ends: 5395 [2025-03-03 11:00:09,686 INFO L226 Difference]: Without dead ends: 2701 [2025-03-03 11:00:09,690 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-03 11:00:09,693 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:09,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:00:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-03-03 11:00:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2025-03-03 11:00:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions. [2025-03-03 11:00:09,730 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 156 [2025-03-03 11:00:09,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:09,731 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions. [2025-03-03 11:00:09,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions. [2025-03-03 11:00:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 11:00:09,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:09,733 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:09,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:00:09,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:09,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:09,734 INFO L85 PathProgramCache]: Analyzing trace with hash 954966156, now seen corresponding path program 1 times [2025-03-03 11:00:09,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:09,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037353307] [2025-03-03 11:00:09,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:09,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:09,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 11:00:09,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 11:00:09,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:09,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:00:09,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:09,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037353307] [2025-03-03 11:00:09,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037353307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:09,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:09,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:09,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339952564] [2025-03-03 11:00:09,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:09,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:09,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:09,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:09,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:09,958 INFO L87 Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:11,209 INFO L93 Difference]: Finished difference Result 7108 states and 8598 transitions. [2025-03-03 11:00:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 216 [2025-03-03 11:00:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:11,221 INFO L225 Difference]: With dead ends: 7108 [2025-03-03 11:00:11,222 INFO L226 Difference]: Without dead ends: 4409 [2025-03-03 11:00:11,224 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-03 11:00:11,225 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:11,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:00:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2025-03-03 11:00:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409. [2025-03-03 11:00:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions. [2025-03-03 11:00:11,277 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 216 [2025-03-03 11:00:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:11,277 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions. [2025-03-03 11:00:11,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions. [2025-03-03 11:00:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 11:00:11,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:11,279 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:11,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:00:11,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:11,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:11,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2116587431, now seen corresponding path program 1 times [2025-03-03 11:00:11,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:11,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576871315] [2025-03-03 11:00:11,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:11,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 11:00:11,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 11:00:11,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:11,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 11:00:11,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:11,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576871315] [2025-03-03 11:00:11,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576871315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:11,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:11,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:11,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643335376] [2025-03-03 11:00:11,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:11,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:11,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:11,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:11,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:11,433 INFO L87 Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:12,679 INFO L93 Difference]: Finished difference Result 10936 states and 12970 transitions. [2025-03-03 11:00:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:12,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 218 [2025-03-03 11:00:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:12,696 INFO L225 Difference]: With dead ends: 10936 [2025-03-03 11:00:12,697 INFO L226 Difference]: Without dead ends: 6528 [2025-03-03 11:00:12,701 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-03 11:00:12,702 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 387 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:12,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:00:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2025-03-03 11:00:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382. [2025-03-03 11:00:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions. [2025-03-03 11:00:12,781 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 218 [2025-03-03 11:00:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:12,782 INFO L471 AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions. [2025-03-03 11:00:12,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions. [2025-03-03 11:00:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-03 11:00:12,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:12,785 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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-03 11:00:12,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:00:12,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:12,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:12,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1015318959, now seen corresponding path program 1 times [2025-03-03 11:00:12,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:12,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709125501] [2025-03-03 11:00:12,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:12,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:12,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-03 11:00:12,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-03 11:00:12,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:12,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:00:13,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:13,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709125501] [2025-03-03 11:00:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709125501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:13,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:13,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:13,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167921757] [2025-03-03 11:00:13,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:13,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:13,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:13,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:13,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:13,063 INFO L87 Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:14,504 INFO L93 Difference]: Finished difference Result 10045 states and 11706 transitions. [2025-03-03 11:00:14,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:14,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 284 [2025-03-03 11:00:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:14,517 INFO L225 Difference]: With dead ends: 10045 [2025-03-03 11:00:14,517 INFO L226 Difference]: Without dead ends: 5665 [2025-03-03 11:00:14,522 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-03 11:00:14,523 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 372 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:14,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 894 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:00:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2025-03-03 11:00:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 5234. [2025-03-03 11:00:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 5233 states have (on average 1.1587999235620103) internal successors, (6064), 5233 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 6064 transitions. [2025-03-03 11:00:14,597 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 6064 transitions. Word has length 284 [2025-03-03 11:00:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:14,597 INFO L471 AbstractCegarLoop]: Abstraction has 5234 states and 6064 transitions. [2025-03-03 11:00:14,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:14,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 6064 transitions. [2025-03-03 11:00:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 11:00:14,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:14,602 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:14,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:00:14,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:14,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:14,603 INFO L85 PathProgramCache]: Analyzing trace with hash -62249078, now seen corresponding path program 1 times [2025-03-03 11:00:14,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:14,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401579689] [2025-03-03 11:00:14,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:14,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:14,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 11:00:14,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 11:00:14,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:14,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-03 11:00:14,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:14,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401579689] [2025-03-03 11:00:14,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401579689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:14,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:14,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020820943] [2025-03-03 11:00:14,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:14,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:14,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:14,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:14,778 INFO L87 Difference]: Start difference. First operand 5234 states and 6064 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-03 11:00:16,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:16,092 INFO L93 Difference]: Finished difference Result 12593 states and 14783 transitions. [2025-03-03 11:00:16,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:16,093 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 296 [2025-03-03 11:00:16,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:16,108 INFO L225 Difference]: With dead ends: 12593 [2025-03-03 11:00:16,108 INFO L226 Difference]: Without dead ends: 6936 [2025-03-03 11:00:16,112 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-03 11:00:16,113 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:16,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 847 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:00:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6936 states. [2025-03-03 11:00:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6936 to 6936. [2025-03-03 11:00:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6936 states, 6935 states have (on average 1.1322278298485942) internal successors, (7852), 6935 states have internal predecessors, (7852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6936 states to 6936 states and 7852 transitions. [2025-03-03 11:00:16,177 INFO L78 Accepts]: Start accepts. Automaton has 6936 states and 7852 transitions. Word has length 296 [2025-03-03 11:00:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:16,178 INFO L471 AbstractCegarLoop]: Abstraction has 6936 states and 7852 transitions. [2025-03-03 11:00:16,178 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-03 11:00:16,178 INFO L276 IsEmpty]: Start isEmpty. Operand 6936 states and 7852 transitions. [2025-03-03 11:00:16,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-03 11:00:16,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:16,181 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 11:00:16,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:00:16,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:16,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash 990687213, now seen corresponding path program 1 times [2025-03-03 11:00:16,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:16,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316400456] [2025-03-03 11:00:16,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:16,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:16,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-03 11:00:16,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-03 11:00:16,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:16,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-03 11:00:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316400456] [2025-03-03 11:00:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316400456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:16,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:16,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:16,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803703788] [2025-03-03 11:00:16,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:16,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:16,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:16,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:16,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:16,329 INFO L87 Difference]: Start difference. First operand 6936 states and 7852 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-03 11:00:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:17,724 INFO L93 Difference]: Finished difference Result 17279 states and 19683 transitions. [2025-03-03 11:00:17,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:17,725 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 336 [2025-03-03 11:00:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:17,740 INFO L225 Difference]: With dead ends: 17279 [2025-03-03 11:00:17,740 INFO L226 Difference]: Without dead ends: 9468 [2025-03-03 11:00:17,746 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-03 11:00:17,747 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 481 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:17,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 640 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:00:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9468 states. [2025-03-03 11:00:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9468 to 9038. [2025-03-03 11:00:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9038 states, 9037 states have (on average 1.1249308398804914) internal successors, (10166), 9037 states have internal predecessors, (10166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9038 states to 9038 states and 10166 transitions. [2025-03-03 11:00:17,824 INFO L78 Accepts]: Start accepts. Automaton has 9038 states and 10166 transitions. Word has length 336 [2025-03-03 11:00:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:17,824 INFO L471 AbstractCegarLoop]: Abstraction has 9038 states and 10166 transitions. [2025-03-03 11:00:17,825 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-03 11:00:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 9038 states and 10166 transitions. [2025-03-03 11:00:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-03 11:00:17,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:17,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:17,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:00:17,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:17,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1187801748, now seen corresponding path program 1 times [2025-03-03 11:00:17,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:17,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033127142] [2025-03-03 11:00:17,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:17,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-03 11:00:17,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-03 11:00:17,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:17,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:00:18,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:18,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033127142] [2025-03-03 11:00:18,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033127142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:18,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:18,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:18,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143902969] [2025-03-03 11:00:18,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:18,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:00:18,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:18,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:00:18,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:00:18,125 INFO L87 Difference]: Start difference. First operand 9038 states and 10166 transitions. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:19,921 INFO L93 Difference]: Finished difference Result 26190 states and 29348 transitions. [2025-03-03 11:00:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:00:19,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 403 [2025-03-03 11:00:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:19,946 INFO L225 Difference]: With dead ends: 26190 [2025-03-03 11:00:19,946 INFO L226 Difference]: Without dead ends: 16729 [2025-03-03 11:00:19,957 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-03 11:00:19,957 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 507 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2686 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:19,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 373 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2686 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:00:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16729 states. [2025-03-03 11:00:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16729 to 16708. [2025-03-03 11:00:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16708 states, 16707 states have (on average 1.108277967319088) internal successors, (18516), 16707 states have internal predecessors, (18516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16708 states to 16708 states and 18516 transitions. [2025-03-03 11:00:20,107 INFO L78 Accepts]: Start accepts. Automaton has 16708 states and 18516 transitions. Word has length 403 [2025-03-03 11:00:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:20,107 INFO L471 AbstractCegarLoop]: Abstraction has 16708 states and 18516 transitions. [2025-03-03 11:00:20,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 16708 states and 18516 transitions. [2025-03-03 11:00:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-03 11:00:20,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:20,115 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 11:00:20,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 11:00:20,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:20,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:20,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2069447127, now seen corresponding path program 1 times [2025-03-03 11:00:20,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:20,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779981083] [2025-03-03 11:00:20,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:20,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:20,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-03 11:00:20,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-03 11:00:20,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:20,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 11:00:20,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:20,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779981083] [2025-03-03 11:00:20,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779981083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:20,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:20,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:20,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144964616] [2025-03-03 11:00:20,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:20,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:20,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:20,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:20,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:20,317 INFO L87 Difference]: Start difference. First operand 16708 states and 18516 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:21,402 INFO L93 Difference]: Finished difference Result 36816 states and 41081 transitions. [2025-03-03 11:00:21,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:21,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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-03 11:00:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:21,435 INFO L225 Difference]: With dead ends: 36816 [2025-03-03 11:00:21,436 INFO L226 Difference]: Without dead ends: 20110 [2025-03-03 11:00:21,451 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-03 11:00:21,451 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 415 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:21,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 299 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:00:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20110 states. [2025-03-03 11:00:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20110 to 18831. [2025-03-03 11:00:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18831 states, 18830 states have (on average 1.1070100902814657) internal successors, (20845), 18830 states have internal predecessors, (20845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 20845 transitions. [2025-03-03 11:00:21,623 INFO L78 Accepts]: Start accepts. Automaton has 18831 states and 20845 transitions. Word has length 407 [2025-03-03 11:00:21,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:21,624 INFO L471 AbstractCegarLoop]: Abstraction has 18831 states and 20845 transitions. [2025-03-03 11:00:21,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 18831 states and 20845 transitions. [2025-03-03 11:00:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-03-03 11:00:21,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:21,638 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:21,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:00:21,639 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:21,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:21,640 INFO L85 PathProgramCache]: Analyzing trace with hash 74753892, now seen corresponding path program 1 times [2025-03-03 11:00:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:21,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537475689] [2025-03-03 11:00:21,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:21,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:21,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-03 11:00:21,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-03 11:00:21,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:21,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 342 proven. 82 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 11:00:22,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:22,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537475689] [2025-03-03 11:00:22,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537475689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:00:22,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104974504] [2025-03-03 11:00:22,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:22,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:00:22,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:00:22,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:00:22,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 11:00:22,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-03 11:00:22,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-03 11:00:22,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:22,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:22,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:00:22,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:00:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:00:22,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:00:22,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104974504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:22,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:00:22,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2025-03-03 11:00:22,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096881582] [2025-03-03 11:00:22,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:22,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:00:22,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:22,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:00:22,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:00:22,815 INFO L87 Difference]: Start difference. First operand 18831 states and 20845 transitions. Second operand has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:24,921 INFO L93 Difference]: Finished difference Result 55572 states and 61843 transitions. [2025-03-03 11:00:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:00:24,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 623 [2025-03-03 11:00:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:24,969 INFO L225 Difference]: With dead ends: 55572 [2025-03-03 11:00:24,969 INFO L226 Difference]: Without dead ends: 35039 [2025-03-03 11:00:24,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:00:24,984 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 575 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:24,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 219 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 11:00:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35039 states. [2025-03-03 11:00:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35039 to 33305. [2025-03-03 11:00:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33305 states, 33304 states have (on average 1.110377131876051) internal successors, (36980), 33304 states have internal predecessors, (36980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33305 states to 33305 states and 36980 transitions. [2025-03-03 11:00:25,290 INFO L78 Accepts]: Start accepts. Automaton has 33305 states and 36980 transitions. Word has length 623 [2025-03-03 11:00:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:25,290 INFO L471 AbstractCegarLoop]: Abstraction has 33305 states and 36980 transitions. [2025-03-03 11:00:25,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 33305 states and 36980 transitions. [2025-03-03 11:00:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-03-03 11:00:25,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:25,312 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:25,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 11:00:25,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 11:00:25,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:25,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash -788193211, now seen corresponding path program 1 times [2025-03-03 11:00:25,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:25,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573863796] [2025-03-03 11:00:25,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:25,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:25,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-03 11:00:25,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-03 11:00:25,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:25,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:00:26,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573863796] [2025-03-03 11:00:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573863796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:26,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:26,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196821938] [2025-03-03 11:00:26,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:26,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:26,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:26,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:26,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:26,061 INFO L87 Difference]: Start difference. First operand 33305 states and 36980 transitions. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:27,220 INFO L93 Difference]: Finished difference Result 79380 states and 88473 transitions. [2025-03-03 11:00:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:27,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 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 667 [2025-03-03 11:00:27,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:27,279 INFO L225 Difference]: With dead ends: 79380 [2025-03-03 11:00:27,279 INFO L226 Difference]: Without dead ends: 45220 [2025-03-03 11:00:27,305 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-03 11:00:27,306 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 102 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:27,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 642 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:00:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45220 states. [2025-03-03 11:00:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45220 to 44787. [2025-03-03 11:00:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44787 states, 44786 states have (on average 1.1031795650426472) internal successors, (49407), 44786 states have internal predecessors, (49407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44787 states to 44787 states and 49407 transitions. [2025-03-03 11:00:27,777 INFO L78 Accepts]: Start accepts. Automaton has 44787 states and 49407 transitions. Word has length 667 [2025-03-03 11:00:27,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:27,778 INFO L471 AbstractCegarLoop]: Abstraction has 44787 states and 49407 transitions. [2025-03-03 11:00:27,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 44787 states and 49407 transitions. [2025-03-03 11:00:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2025-03-03 11:00:27,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:27,803 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:00:27,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 11:00:27,804 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:27,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:27,804 INFO L85 PathProgramCache]: Analyzing trace with hash 808354838, now seen corresponding path program 1 times [2025-03-03 11:00:27,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:27,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969688992] [2025-03-03 11:00:27,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:27,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 708 statements into 1 equivalence classes. [2025-03-03 11:00:27,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 708 of 708 statements. [2025-03-03 11:00:27,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:27,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 586 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2025-03-03 11:00:27,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:27,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969688992] [2025-03-03 11:00:27,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969688992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:27,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:27,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:27,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226432317] [2025-03-03 11:00:27,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:27,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:27,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:27,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:27,997 INFO L87 Difference]: Start difference. First operand 44787 states and 49407 transitions. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:29,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:29,209 INFO L93 Difference]: Finished difference Result 98504 states and 109011 transitions. [2025-03-03 11:00:29,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:29,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 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 708 [2025-03-03 11:00:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:29,270 INFO L225 Difference]: With dead ends: 98504 [2025-03-03 11:00:29,270 INFO L226 Difference]: Without dead ends: 53719 [2025-03-03 11:00:29,298 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-03 11:00:29,299 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 489 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:29,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 673 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:00:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53719 states. [2025-03-03 11:00:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53719 to 53713. [2025-03-03 11:00:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53713 states, 53712 states have (on average 1.0985440869824248) internal successors, (59005), 53712 states have internal predecessors, (59005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53713 states to 53713 states and 59005 transitions. [2025-03-03 11:00:29,878 INFO L78 Accepts]: Start accepts. Automaton has 53713 states and 59005 transitions. Word has length 708 [2025-03-03 11:00:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:29,878 INFO L471 AbstractCegarLoop]: Abstraction has 53713 states and 59005 transitions. [2025-03-03 11:00:29,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 53713 states and 59005 transitions. [2025-03-03 11:00:29,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2025-03-03 11:00:29,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:29,902 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:29,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 11:00:29,902 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:29,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:29,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1346055213, now seen corresponding path program 1 times [2025-03-03 11:00:29,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:29,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411914564] [2025-03-03 11:00:29,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:29,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:29,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 717 statements into 1 equivalence classes. [2025-03-03 11:00:29,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 717 of 717 statements. [2025-03-03 11:00:29,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:29,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-03 11:00:30,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:30,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411914564] [2025-03-03 11:00:30,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411914564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:30,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:30,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:30,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256173360] [2025-03-03 11:00:30,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:30,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:30,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:30,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:30,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:30,122 INFO L87 Difference]: Start difference. First operand 53713 states and 59005 transitions. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:31,571 INFO L93 Difference]: Finished difference Result 117221 states and 128793 transitions. [2025-03-03 11:00:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:31,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 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 717 [2025-03-03 11:00:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:31,632 INFO L225 Difference]: With dead ends: 117221 [2025-03-03 11:00:31,632 INFO L226 Difference]: Without dead ends: 63510 [2025-03-03 11:00:31,667 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-03 11:00:31,668 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 470 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:31,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 256 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:00:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63510 states. [2025-03-03 11:00:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63510 to 50722. [2025-03-03 11:00:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50722 states, 50721 states have (on average 1.1003134796238245) internal successors, (55809), 50721 states have internal predecessors, (55809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50722 states to 50722 states and 55809 transitions. [2025-03-03 11:00:32,328 INFO L78 Accepts]: Start accepts. Automaton has 50722 states and 55809 transitions. Word has length 717 [2025-03-03 11:00:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:32,329 INFO L471 AbstractCegarLoop]: Abstraction has 50722 states and 55809 transitions. [2025-03-03 11:00:32,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 50722 states and 55809 transitions. [2025-03-03 11:00:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2025-03-03 11:00:32,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:32,362 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:32,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 11:00:32,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:32,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:32,363 INFO L85 PathProgramCache]: Analyzing trace with hash -860577930, now seen corresponding path program 1 times [2025-03-03 11:00:32,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:32,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751743189] [2025-03-03 11:00:32,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:32,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:32,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 748 statements into 1 equivalence classes. [2025-03-03 11:00:32,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 748 of 748 statements. [2025-03-03 11:00:32,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:32,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 391 proven. 82 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 11:00:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:33,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751743189] [2025-03-03 11:00:33,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751743189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:00:33,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102518853] [2025-03-03 11:00:33,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:33,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:00:33,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:00:33,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:00:33,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 11:00:33,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 748 statements into 1 equivalence classes. [2025-03-03 11:00:33,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 748 of 748 statements. [2025-03-03 11:00:33,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:33,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:33,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 11:00:33,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:00:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 371 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:00:33,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:00:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:00:34,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102518853] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:00:34,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:00:34,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2025-03-03 11:00:34,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824013621] [2025-03-03 11:00:34,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:34,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:00:34,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:34,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:00:34,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:00:34,596 INFO L87 Difference]: Start difference. First operand 50722 states and 55809 transitions. Second operand has 5 states, 5 states have (on average 149.6) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:36,657 INFO L93 Difference]: Finished difference Result 112518 states and 123810 transitions. [2025-03-03 11:00:36,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:00:36,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 149.6) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 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 748 [2025-03-03 11:00:36,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:36,723 INFO L225 Difference]: With dead ends: 112518 [2025-03-03 11:00:36,723 INFO L226 Difference]: Without dead ends: 60948 [2025-03-03 11:00:36,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1497 GetRequests, 1491 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:00:36,759 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 482 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 3084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:36,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 150 Invalid, 3084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 2506 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 11:00:36,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60948 states. [2025-03-03 11:00:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60948 to 50308. [2025-03-03 11:00:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50308 states, 50307 states have (on average 1.0974218299640208) internal successors, (55208), 50307 states have internal predecessors, (55208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50308 states to 50308 states and 55208 transitions. [2025-03-03 11:00:37,329 INFO L78 Accepts]: Start accepts. Automaton has 50308 states and 55208 transitions. Word has length 748 [2025-03-03 11:00:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:37,330 INFO L471 AbstractCegarLoop]: Abstraction has 50308 states and 55208 transitions. [2025-03-03 11:00:37,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.6) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 50308 states and 55208 transitions. [2025-03-03 11:00:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-03-03 11:00:37,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:37,363 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:37,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 11:00:37,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 11:00:37,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:37,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:37,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1371063517, now seen corresponding path program 1 times [2025-03-03 11:00:37,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:37,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199710074] [2025-03-03 11:00:37,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:37,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:37,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-03-03 11:00:37,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-03-03 11:00:37,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:37,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-03 11:00:38,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:38,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199710074] [2025-03-03 11:00:38,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199710074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:38,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:38,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:38,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087770067] [2025-03-03 11:00:38,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:38,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:38,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:38,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:38,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:38,049 INFO L87 Difference]: Start difference. First operand 50308 states and 55208 transitions. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:39,259 INFO L93 Difference]: Finished difference Result 113813 states and 125096 transitions. [2025-03-03 11:00:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:39,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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 764 [2025-03-03 11:00:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:39,326 INFO L225 Difference]: With dead ends: 113813 [2025-03-03 11:00:39,326 INFO L226 Difference]: Without dead ends: 63082 [2025-03-03 11:00:39,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-03 11:00:39,360 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 322 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:39,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 751 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:00:39,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63082 states. [2025-03-03 11:00:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63082 to 60945. [2025-03-03 11:00:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60945 states, 60944 states have (on average 1.0912805198214754) internal successors, (66507), 60944 states have internal predecessors, (66507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60945 states to 60945 states and 66507 transitions. [2025-03-03 11:00:40,139 INFO L78 Accepts]: Start accepts. Automaton has 60945 states and 66507 transitions. Word has length 764 [2025-03-03 11:00:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:40,140 INFO L471 AbstractCegarLoop]: Abstraction has 60945 states and 66507 transitions. [2025-03-03 11:00:40,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 60945 states and 66507 transitions. [2025-03-03 11:00:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2025-03-03 11:00:40,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:40,178 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:00:40,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:00:40,178 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:40,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash 131518011, now seen corresponding path program 1 times [2025-03-03 11:00:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:40,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89751914] [2025-03-03 11:00:40,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:40,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 842 statements into 1 equivalence classes. [2025-03-03 11:00:40,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 842 of 842 statements. [2025-03-03 11:00:40,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:40,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-03 11:00:40,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:40,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89751914] [2025-03-03 11:00:40,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89751914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:40,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:40,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:40,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110772206] [2025-03-03 11:00:40,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:40,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:40,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:40,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:40,763 INFO L87 Difference]: Start difference. First operand 60945 states and 66507 transitions. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:42,079 INFO L93 Difference]: Finished difference Result 121881 states and 133005 transitions. [2025-03-03 11:00:42,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:42,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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 842 [2025-03-03 11:00:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:42,146 INFO L225 Difference]: With dead ends: 121881 [2025-03-03 11:00:42,146 INFO L226 Difference]: Without dead ends: 60936 [2025-03-03 11:00:42,176 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-03 11:00:42,176 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 112 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:42,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 675 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:00:42,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60936 states. [2025-03-03 11:00:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60936 to 59233. [2025-03-03 11:00:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59233 states, 59232 states have (on average 1.0702998379254458) internal successors, (63396), 59232 states have internal predecessors, (63396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59233 states to 59233 states and 63396 transitions. [2025-03-03 11:00:42,731 INFO L78 Accepts]: Start accepts. Automaton has 59233 states and 63396 transitions. Word has length 842 [2025-03-03 11:00:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:42,732 INFO L471 AbstractCegarLoop]: Abstraction has 59233 states and 63396 transitions. [2025-03-03 11:00:42,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 59233 states and 63396 transitions. [2025-03-03 11:00:42,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2025-03-03 11:00:42,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:42,762 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:42,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 11:00:42,762 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:42,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2140791424, now seen corresponding path program 1 times [2025-03-03 11:00:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:42,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4025686] [2025-03-03 11:00:42,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:42,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:42,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 871 statements into 1 equivalence classes. [2025-03-03 11:00:42,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 871 of 871 statements. [2025-03-03 11:00:42,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:42,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 651 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 11:00:43,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:43,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4025686] [2025-03-03 11:00:43,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4025686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:43,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:43,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:00:43,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663201229] [2025-03-03 11:00:43,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:43,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:00:43,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:43,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:00:43,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:00:43,591 INFO L87 Difference]: Start difference. First operand 59233 states and 63396 transitions. Second operand has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:45,662 INFO L93 Difference]: Finished difference Result 137211 states and 146743 transitions. [2025-03-03 11:00:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:00:45,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 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 871 [2025-03-03 11:00:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:45,735 INFO L225 Difference]: With dead ends: 137211 [2025-03-03 11:00:45,735 INFO L226 Difference]: Without dead ends: 77555 [2025-03-03 11:00:45,772 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-03 11:00:45,773 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 662 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:45,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 167 Invalid, 2766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 11:00:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77555 states. [2025-03-03 11:00:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77555 to 66039. [2025-03-03 11:00:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66039 states, 66038 states have (on average 1.0718828553257216) internal successors, (70785), 66038 states have internal predecessors, (70785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66039 states to 66039 states and 70785 transitions. [2025-03-03 11:00:46,426 INFO L78 Accepts]: Start accepts. Automaton has 66039 states and 70785 transitions. Word has length 871 [2025-03-03 11:00:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:46,426 INFO L471 AbstractCegarLoop]: Abstraction has 66039 states and 70785 transitions. [2025-03-03 11:00:46,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 66039 states and 70785 transitions. [2025-03-03 11:00:46,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 941 [2025-03-03 11:00:46,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:46,460 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:00:46,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 11:00:46,460 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:46,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1346896009, now seen corresponding path program 1 times [2025-03-03 11:00:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:46,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204274112] [2025-03-03 11:00:46,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:46,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:46,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 940 statements into 1 equivalence classes. [2025-03-03 11:00:46,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 940 of 940 statements. [2025-03-03 11:00:46,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:46,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 693 proven. 82 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-03-03 11:00:47,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:47,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204274112] [2025-03-03 11:00:47,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204274112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:00:47,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482294028] [2025-03-03 11:00:47,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:47,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:00:47,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:00:47,326 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:00:47,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 11:00:47,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 940 statements into 1 equivalence classes. [2025-03-03 11:00:47,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 940 of 940 statements. [2025-03-03 11:00:47,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:47,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:47,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:00:47,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:00:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 693 proven. 82 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-03-03 11:00:47,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:00:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 775 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-03-03 11:00:47,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482294028] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:00:47,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:00:47,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-03 11:00:47,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916607653] [2025-03-03 11:00:47,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:47,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:00:47,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:47,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:00:47,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:00:47,922 INFO L87 Difference]: Start difference. First operand 66039 states and 70785 transitions. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:49,918 INFO L93 Difference]: Finished difference Result 141867 states and 152162 transitions. [2025-03-03 11:00:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:00:49,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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 940 [2025-03-03 11:00:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:49,996 INFO L225 Difference]: With dead ends: 141867 [2025-03-03 11:00:49,996 INFO L226 Difference]: Without dead ends: 75830 [2025-03-03 11:00:50,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1881 GetRequests, 1877 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:00:50,040 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 773 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:50,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 168 Invalid, 2517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:00:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75830 states. [2025-03-03 11:00:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75830 to 72847. [2025-03-03 11:00:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72847 states, 72846 states have (on average 1.0666611756307827) internal successors, (77702), 72846 states have internal predecessors, (77702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72847 states to 72847 states and 77702 transitions. [2025-03-03 11:00:51,026 INFO L78 Accepts]: Start accepts. Automaton has 72847 states and 77702 transitions. Word has length 940 [2025-03-03 11:00:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:51,026 INFO L471 AbstractCegarLoop]: Abstraction has 72847 states and 77702 transitions. [2025-03-03 11:00:51,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 72847 states and 77702 transitions. [2025-03-03 11:00:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2025-03-03 11:00:51,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:51,078 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:51,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 11:00:51,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:00:51,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:51,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash -379638852, now seen corresponding path program 1 times [2025-03-03 11:00:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:51,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488571486] [2025-03-03 11:00:51,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:51,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 995 statements into 1 equivalence classes. [2025-03-03 11:00:51,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 995 of 995 statements. [2025-03-03 11:00:51,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:51,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 1118 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 11:00:52,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:52,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488571486] [2025-03-03 11:00:52,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488571486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:52,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:52,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:00:52,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970030803] [2025-03-03 11:00:52,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:52,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:00:52,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:52,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:00:52,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:00:52,200 INFO L87 Difference]: Start difference. First operand 72847 states and 77702 transitions. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:54,492 INFO L93 Difference]: Finished difference Result 169558 states and 181196 transitions. [2025-03-03 11:00:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:00:54,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 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 995 [2025-03-03 11:00:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:54,586 INFO L225 Difference]: With dead ends: 169558 [2025-03-03 11:00:54,586 INFO L226 Difference]: Without dead ends: 96713 [2025-03-03 11:00:54,613 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-03 11:00:54,613 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 736 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:54,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 128 Invalid, 2592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 11:00:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96713 states. [2025-03-03 11:00:55,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96713 to 95000. [2025-03-03 11:00:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95000 states, 94999 states have (on average 1.0654217412814873) internal successors, (101214), 94999 states have internal predecessors, (101214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95000 states to 95000 states and 101214 transitions. [2025-03-03 11:00:55,494 INFO L78 Accepts]: Start accepts. Automaton has 95000 states and 101214 transitions. Word has length 995 [2025-03-03 11:00:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:55,494 INFO L471 AbstractCegarLoop]: Abstraction has 95000 states and 101214 transitions. [2025-03-03 11:00:55,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 95000 states and 101214 transitions. [2025-03-03 11:00:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1022 [2025-03-03 11:00:55,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:55,560 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:00:55,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 11:00:55,561 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:55,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1369114617, now seen corresponding path program 1 times [2025-03-03 11:00:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:55,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86879597] [2025-03-03 11:00:55,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:55,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:55,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1021 statements into 1 equivalence classes. [2025-03-03 11:00:55,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1021 of 1021 statements. [2025-03-03 11:00:55,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:55,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1907 backedges. 1345 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-03-03 11:00:56,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:56,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86879597] [2025-03-03 11:00:56,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86879597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:56,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:56,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:56,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425069372] [2025-03-03 11:00:56,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:56,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:56,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:56,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:56,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:56,183 INFO L87 Difference]: Start difference. First operand 95000 states and 101214 transitions. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:57,665 INFO L93 Difference]: Finished difference Result 193813 states and 206578 transitions. [2025-03-03 11:00:57,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:57,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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 1021 [2025-03-03 11:00:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:57,771 INFO L225 Difference]: With dead ends: 193813 [2025-03-03 11:00:57,771 INFO L226 Difference]: Without dead ends: 98815 [2025-03-03 11:00:57,821 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-03 11:00:57,821 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 346 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:57,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 670 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:00:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98815 states. [2025-03-03 11:00:58,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98815 to 95819. [2025-03-03 11:00:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95819 states, 95818 states have (on average 1.0622430023586382) internal successors, (101782), 95818 states have internal predecessors, (101782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95819 states to 95819 states and 101782 transitions. [2025-03-03 11:00:58,992 INFO L78 Accepts]: Start accepts. Automaton has 95819 states and 101782 transitions. Word has length 1021 [2025-03-03 11:00:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:58,992 INFO L471 AbstractCegarLoop]: Abstraction has 95819 states and 101782 transitions. [2025-03-03 11:00:58,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 95819 states and 101782 transitions. [2025-03-03 11:00:59,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2025-03-03 11:00:59,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:59,048 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:00:59,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 11:00:59,048 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:59,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:59,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1875599495, now seen corresponding path program 1 times [2025-03-03 11:00:59,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:59,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350247418] [2025-03-03 11:00:59,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:59,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:59,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1031 statements into 1 equivalence classes. [2025-03-03 11:00:59,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1031 of 1031 statements. [2025-03-03 11:00:59,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:59,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 1085 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-03 11:00:59,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:59,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350247418] [2025-03-03 11:00:59,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350247418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:59,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:59,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:59,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966478882] [2025-03-03 11:00:59,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:59,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:59,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:59,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:59,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:59,861 INFO L87 Difference]: Start difference. First operand 95819 states and 101782 transitions. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:01,308 INFO L93 Difference]: Finished difference Result 198882 states and 211179 transitions. [2025-03-03 11:01:01,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:01:01,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 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 1031 [2025-03-03 11:01:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:01,430 INFO L225 Difference]: With dead ends: 198882 [2025-03-03 11:01:01,430 INFO L226 Difference]: Without dead ends: 103065 [2025-03-03 11:01:01,489 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-03 11:01:01,490 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 265 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:01,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 251 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:01:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103065 states. [2025-03-03 11:01:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103065 to 94547. [2025-03-03 11:01:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94547 states, 94546 states have (on average 1.054692953694498) internal successors, (99717), 94546 states have internal predecessors, (99717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94547 states to 94547 states and 99717 transitions. [2025-03-03 11:01:02,537 INFO L78 Accepts]: Start accepts. Automaton has 94547 states and 99717 transitions. Word has length 1031 [2025-03-03 11:01:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:02,537 INFO L471 AbstractCegarLoop]: Abstraction has 94547 states and 99717 transitions. [2025-03-03 11:01:02,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 94547 states and 99717 transitions. [2025-03-03 11:01:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2025-03-03 11:01:02,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:02,592 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:01:02,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 11:01:02,592 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:02,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:02,593 INFO L85 PathProgramCache]: Analyzing trace with hash -171166862, now seen corresponding path program 1 times [2025-03-03 11:01:02,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:02,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308147468] [2025-03-03 11:01:02,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:02,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:02,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1117 statements into 1 equivalence classes. [2025-03-03 11:01:02,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1117 of 1117 statements. [2025-03-03 11:01:02,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:02,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 1693 proven. 0 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2025-03-03 11:01:03,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:03,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308147468] [2025-03-03 11:01:03,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308147468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:03,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:03,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:01:03,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722583790] [2025-03-03 11:01:03,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:03,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:01:03,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:03,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:01:03,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:01:03,784 INFO L87 Difference]: Start difference. First operand 94547 states and 99717 transitions. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:05,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:05,936 INFO L93 Difference]: Finished difference Result 199318 states and 210065 transitions. [2025-03-03 11:01:05,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:01:05,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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 1117 [2025-03-03 11:01:05,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:06,067 INFO L225 Difference]: With dead ends: 199318 [2025-03-03 11:01:06,068 INFO L226 Difference]: Without dead ends: 104773 [2025-03-03 11:01:06,133 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-03 11:01:06,134 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 601 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2709 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 2947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:06,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 309 Invalid, 2947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2709 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:01:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104773 states. [2025-03-03 11:01:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104773 to 97531. [2025-03-03 11:01:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97531 states, 97530 states have (on average 1.0526094535014867) internal successors, (102661), 97530 states have internal predecessors, (102661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97531 states to 97531 states and 102661 transitions. [2025-03-03 11:01:07,408 INFO L78 Accepts]: Start accepts. Automaton has 97531 states and 102661 transitions. Word has length 1117 [2025-03-03 11:01:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:07,409 INFO L471 AbstractCegarLoop]: Abstraction has 97531 states and 102661 transitions. [2025-03-03 11:01:07,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 97531 states and 102661 transitions. [2025-03-03 11:01:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1151 [2025-03-03 11:01:07,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:07,469 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:07,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 11:01:07,469 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:07,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:07,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2132504561, now seen corresponding path program 1 times [2025-03-03 11:01:07,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:07,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586867615] [2025-03-03 11:01:07,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:07,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:07,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1150 statements into 1 equivalence classes. [2025-03-03 11:01:07,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1150 of 1150 statements. [2025-03-03 11:01:07,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:07,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2115 backedges. 1677 proven. 0 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2025-03-03 11:01:08,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:08,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586867615] [2025-03-03 11:01:08,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586867615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:08,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:08,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:01:08,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98947164] [2025-03-03 11:01:08,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:08,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:01:08,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:08,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:01:08,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:01:08,712 INFO L87 Difference]: Start difference. First operand 97531 states and 102661 transitions. Second operand has 4 states, 4 states have (on average 194.25) internal successors, (777), 4 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:14,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:01:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:15,030 INFO L93 Difference]: Finished difference Result 198904 states and 209316 transitions. [2025-03-03 11:01:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:01:15,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 194.25) internal successors, (777), 4 states have internal predecessors, (777), 0 states have call successors, (0), 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 1150 [2025-03-03 11:01:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:15,143 INFO L225 Difference]: With dead ends: 198904 [2025-03-03 11:01:15,143 INFO L226 Difference]: Without dead ends: 101375 [2025-03-03 11:01:15,201 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-03 11:01:15,202 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 645 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 351 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 2551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:15,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 131 Invalid, 2551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 2199 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2025-03-03 11:01:15,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101375 states. [2025-03-03 11:01:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101375 to 97531. [2025-03-03 11:01:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97531 states, 97530 states have (on average 1.0517584333025736) internal successors, (102578), 97530 states have internal predecessors, (102578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97531 states to 97531 states and 102578 transitions. [2025-03-03 11:01:16,367 INFO L78 Accepts]: Start accepts. Automaton has 97531 states and 102578 transitions. Word has length 1150 [2025-03-03 11:01:16,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:16,367 INFO L471 AbstractCegarLoop]: Abstraction has 97531 states and 102578 transitions. [2025-03-03 11:01:16,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.25) internal successors, (777), 4 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 97531 states and 102578 transitions. [2025-03-03 11:01:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1182 [2025-03-03 11:01:16,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:16,430 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:16,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 11:01:16,430 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:16,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:16,431 INFO L85 PathProgramCache]: Analyzing trace with hash -789464340, now seen corresponding path program 1 times [2025-03-03 11:01:16,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:16,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336908530] [2025-03-03 11:01:16,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:16,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:16,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1181 statements into 1 equivalence classes. [2025-03-03 11:01:16,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1181 of 1181 statements. [2025-03-03 11:01:16,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:16,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2316 backedges. 1647 proven. 0 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2025-03-03 11:01:16,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:16,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336908530] [2025-03-03 11:01:16,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336908530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:16,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:16,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:01:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898777063] [2025-03-03 11:01:16,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:16,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:01:16,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:16,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:01:16,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:01:16,992 INFO L87 Difference]: Start difference. First operand 97531 states and 102578 transitions. Second operand has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:18,993 INFO L93 Difference]: Finished difference Result 201885 states and 212251 transitions. [2025-03-03 11:01:18,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:01:18,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 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 1181 [2025-03-03 11:01:18,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:19,123 INFO L225 Difference]: With dead ends: 201885 [2025-03-03 11:01:19,123 INFO L226 Difference]: Without dead ends: 104356 [2025-03-03 11:01:19,190 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-03 11:01:19,190 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 784 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:19,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 254 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:01:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104356 states. [2025-03-03 11:01:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104356 to 94970. [2025-03-03 11:01:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94970 states, 94969 states have (on average 1.0487001021385927) internal successors, (99594), 94969 states have internal predecessors, (99594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94970 states to 94970 states and 99594 transitions. [2025-03-03 11:01:20,448 INFO L78 Accepts]: Start accepts. Automaton has 94970 states and 99594 transitions. Word has length 1181 [2025-03-03 11:01:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:01:20,448 INFO L471 AbstractCegarLoop]: Abstraction has 94970 states and 99594 transitions. [2025-03-03 11:01:20,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 94970 states and 99594 transitions. [2025-03-03 11:01:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1188 [2025-03-03 11:01:20,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:01:20,530 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:01:20,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 11:01:20,530 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:01:20,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:01:20,530 INFO L85 PathProgramCache]: Analyzing trace with hash 997951336, now seen corresponding path program 1 times [2025-03-03 11:01:20,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:01:20,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887031129] [2025-03-03 11:01:20,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:01:20,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:01:20,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1187 statements into 1 equivalence classes. [2025-03-03 11:01:20,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1187 of 1187 statements. [2025-03-03 11:01:20,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:01:20,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:01:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1663 proven. 0 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2025-03-03 11:01:21,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:01:21,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887031129] [2025-03-03 11:01:21,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887031129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:01:21,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:01:21,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:01:21,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103536633] [2025-03-03 11:01:21,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:01:21,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:01:21,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:01:21,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:01:21,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:01:21,246 INFO L87 Difference]: Start difference. First operand 94970 states and 99594 transitions. Second operand has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:01:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:01:23,074 INFO L93 Difference]: Finished difference Result 195915 states and 205358 transitions. [2025-03-03 11:01:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:01:23,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 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 1187 [2025-03-03 11:01:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:01:23,175 INFO L225 Difference]: With dead ends: 195915 [2025-03-03 11:01:23,175 INFO L226 Difference]: Without dead ends: 100947 [2025-03-03 11:01:23,229 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-03 11:01:23,230 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 798 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:01:23,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 232 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2152 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:01:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100947 states.