./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_label32.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 758b6bdd5f0153469513ef6931f2486fab3d5fd3aa9f01cac0e5fdb67f3e5b48 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:10:19,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:10:19,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:10:19,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:10:19,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:10:19,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:10:19,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:10:19,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:10:19,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:10:19,443 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:10:19,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:10:19,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:10:19,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:10:19,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:10:19,444 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:10:19,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:10:19,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:10:19,444 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:10:19,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:10:19,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:10:19,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:10:19,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:10:19,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:10:19,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:10:19,445 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:10:19,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:10:19,445 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:10:19,445 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:10:19,445 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:10:19,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:10:19,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:10:19,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:10:19,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:10:19,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:10:19,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:10:19,446 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:10:19,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:10:19,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:10:19,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:10:19,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:10:19,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:10:19,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:10:19,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:10:19,446 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 -> 758b6bdd5f0153469513ef6931f2486fab3d5fd3aa9f01cac0e5fdb67f3e5b48 [2025-03-08 02:10:19,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:10:19,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:10:19,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:10:19,660 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:10:19,660 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:10:19,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label32.c [2025-03-08 02:10:20,798 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc413664/3dc76d5ea46646088c0bfa2aad11bc5e/FLAG90026477c [2025-03-08 02:10:21,155 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:10:21,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label32.c [2025-03-08 02:10:21,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc413664/3dc76d5ea46646088c0bfa2aad11bc5e/FLAG90026477c [2025-03-08 02:10:21,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc413664/3dc76d5ea46646088c0bfa2aad11bc5e [2025-03-08 02:10:21,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:10:21,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:10:21,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:10:21,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:10:21,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:10:21,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:10:21" (1/1) ... [2025-03-08 02:10:21,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d8ec99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:21, skipping insertion in model container [2025-03-08 02:10:21,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:10:21" (1/1) ... [2025-03-08 02:10:21,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:10:21,570 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_label32.c[7145,7158] [2025-03-08 02:10:21,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:10:21,877 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:10:21,894 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_label32.c[7145,7158] [2025-03-08 02:10:22,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:10:22,089 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:10:22,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22 WrapperNode [2025-03-08 02:10:22,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:10:22,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:10:22,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:10:22,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:10:22,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,367 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-08 02:10:22,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:10:22,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:10:22,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:10:22,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:10:22,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,533 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-08 02:10:22,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,616 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:10:22,699 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:10:22,699 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:10:22,699 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:10:22,700 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:10:22,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:10:22,728 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-08 02:10:22,731 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-08 02:10:22,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:10:22,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:10:22,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:10:22,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:10:22,796 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:10:22,797 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:10:25,390 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-08 02:10:25,492 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-08 02:10:25,492 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:10:25,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:10:25,512 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:10:25,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:10:25 BoogieIcfgContainer [2025-03-08 02:10:25,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:10:25,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:10:25,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:10:25,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:10:25,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:10:21" (1/3) ... [2025-03-08 02:10:25,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b188284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:10:25, skipping insertion in model container [2025-03-08 02:10:25,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (2/3) ... [2025-03-08 02:10:25,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b188284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:10:25, skipping insertion in model container [2025-03-08 02:10:25,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:10:25" (3/3) ... [2025-03-08 02:10:25,519 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label32.c [2025-03-08 02:10:25,528 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:10:25,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label32.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:10:25,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:10:25,595 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;@253759c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:10:25,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:10:25,602 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-08 02:10:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 02:10:25,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:25,608 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] [2025-03-08 02:10:25,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:25,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:25,613 INFO L85 PathProgramCache]: Analyzing trace with hash -69342529, now seen corresponding path program 1 times [2025-03-08 02:10:25,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:25,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306916179] [2025-03-08 02:10:25,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:25,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 02:10:25,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 02:10:25,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:25,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:25,912 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-08 02:10:25,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306916179] [2025-03-08 02:10:25,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306916179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:25,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:25,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:10:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88089760] [2025-03-08 02:10:25,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:25,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:25,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:25,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:25,939 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 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-08 02:10:28,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:28,042 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-03-08 02:10:28,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:28,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-08 02:10:28,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:28,055 INFO L225 Difference]: With dead ends: 1644 [2025-03-08 02:10:28,055 INFO L226 Difference]: Without dead ends: 977 [2025-03-08 02:10:28,059 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-08 02:10:28,061 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 440 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:28,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:10:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-08 02:10:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-03-08 02:10:28,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-03-08 02:10:28,123 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 48 [2025-03-08 02:10:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:28,125 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-03-08 02:10:28,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-08 02:10:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-03-08 02:10:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 02:10:28,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:28,130 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, 1, 1, 1, 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-08 02:10:28,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:10:28,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:28,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:28,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1000132033, now seen corresponding path program 1 times [2025-03-08 02:10:28,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:28,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032532073] [2025-03-08 02:10:28,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:28,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:28,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 02:10:28,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 02:10:28,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:28,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:28,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:28,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032532073] [2025-03-08 02:10:28,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032532073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:28,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:28,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:10:28,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126375698] [2025-03-08 02:10:28,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:28,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:28,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:28,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:28,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:28,393 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-08 02:10:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:30,130 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2025-03-08 02:10:30,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:30,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-03-08 02:10:30,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:30,136 INFO L225 Difference]: With dead ends: 2813 [2025-03-08 02:10:30,136 INFO L226 Difference]: Without dead ends: 1844 [2025-03-08 02:10:30,138 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-08 02:10:30,139 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:30,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:10:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-08 02:10:30,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2025-03-08 02:10:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2025-03-08 02:10:30,174 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 115 [2025-03-08 02:10:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:30,175 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2025-03-08 02:10:30,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-08 02:10:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2025-03-08 02:10:30,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 02:10:30,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:30,176 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, 1, 1, 1, 1, 1, 1, 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-08 02:10:30,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:10:30,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:30,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:30,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2125598745, now seen corresponding path program 1 times [2025-03-08 02:10:30,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:30,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832148831] [2025-03-08 02:10:30,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:30,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:30,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 02:10:30,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 02:10:30,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:30,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:30,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832148831] [2025-03-08 02:10:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832148831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:30,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:30,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:30,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15011829] [2025-03-08 02:10:30,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:30,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:30,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:30,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:30,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:30,515 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-08 02:10:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:33,088 INFO L93 Difference]: Finished difference Result 6767 states and 9259 transitions. [2025-03-08 02:10:33,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:33,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-08 02:10:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:33,102 INFO L225 Difference]: With dead ends: 6767 [2025-03-08 02:10:33,102 INFO L226 Difference]: Without dead ends: 4928 [2025-03-08 02:10:33,105 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-08 02:10:33,105 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 866 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:33,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 327 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 02:10:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2025-03-08 02:10:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4875. [2025-03-08 02:10:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.2866228970045137) internal successors, (6271), 4874 states have internal predecessors, (6271), 0 states have call successors, (0), 0 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-08 02:10:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6271 transitions. [2025-03-08 02:10:33,168 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6271 transitions. Word has length 118 [2025-03-08 02:10:33,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:33,169 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6271 transitions. [2025-03-08 02:10:33,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-08 02:10:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6271 transitions. [2025-03-08 02:10:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 02:10:33,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:33,171 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, 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] [2025-03-08 02:10:33,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:10:33,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:33,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1283081396, now seen corresponding path program 1 times [2025-03-08 02:10:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537793710] [2025-03-08 02:10:33,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:33,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 02:10:33,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 02:10:33,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:33,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 02:10:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:33,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537793710] [2025-03-08 02:10:33,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537793710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:33,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:33,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:10:33,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790717675] [2025-03-08 02:10:33,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:33,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:33,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:33,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:33,394 INFO L87 Difference]: Start difference. First operand 4875 states and 6271 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-08 02:10:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:34,821 INFO L93 Difference]: Finished difference Result 14436 states and 18544 transitions. [2025-03-08 02:10:34,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:34,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 187 [2025-03-08 02:10:34,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:34,842 INFO L225 Difference]: With dead ends: 14436 [2025-03-08 02:10:34,842 INFO L226 Difference]: Without dead ends: 8277 [2025-03-08 02:10:34,849 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-08 02:10:34,851 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:34,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:10:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2025-03-08 02:10:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6576. [2025-03-08 02:10:34,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6576 states, 6575 states have (on average 1.1793155893536122) internal successors, (7754), 6575 states have internal predecessors, (7754), 0 states have call successors, (0), 0 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-08 02:10:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6576 states to 6576 states and 7754 transitions. [2025-03-08 02:10:34,948 INFO L78 Accepts]: Start accepts. Automaton has 6576 states and 7754 transitions. Word has length 187 [2025-03-08 02:10:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:34,949 INFO L471 AbstractCegarLoop]: Abstraction has 6576 states and 7754 transitions. [2025-03-08 02:10:34,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-08 02:10:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 6576 states and 7754 transitions. [2025-03-08 02:10:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 02:10:34,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:34,951 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, 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] [2025-03-08 02:10:34,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:10:34,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:34,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:34,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1263684772, now seen corresponding path program 1 times [2025-03-08 02:10:34,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:34,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914113952] [2025-03-08 02:10:34,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:34,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:34,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 02:10:34,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 02:10:34,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:34,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:35,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:35,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914113952] [2025-03-08 02:10:35,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914113952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:35,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:35,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:35,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846934089] [2025-03-08 02:10:35,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:35,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:35,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:35,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:35,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:35,159 INFO L87 Difference]: Start difference. First operand 6576 states and 7754 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 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-08 02:10:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:36,503 INFO L93 Difference]: Finished difference Result 16560 states and 19931 transitions. [2025-03-08 02:10:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:36,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-03-08 02:10:36,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:36,524 INFO L225 Difference]: With dead ends: 16560 [2025-03-08 02:10:36,524 INFO L226 Difference]: Without dead ends: 9986 [2025-03-08 02:10:36,530 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-08 02:10:36,531 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:36,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 801 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:10:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9986 states. [2025-03-08 02:10:36,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9986 to 9986. [2025-03-08 02:10:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9986 states, 9985 states have (on average 1.1696544817225838) internal successors, (11679), 9985 states have internal predecessors, (11679), 0 states have call successors, (0), 0 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-08 02:10:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9986 states to 9986 states and 11679 transitions. [2025-03-08 02:10:36,648 INFO L78 Accepts]: Start accepts. Automaton has 9986 states and 11679 transitions. Word has length 200 [2025-03-08 02:10:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:36,648 INFO L471 AbstractCegarLoop]: Abstraction has 9986 states and 11679 transitions. [2025-03-08 02:10:36,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 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-08 02:10:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 9986 states and 11679 transitions. [2025-03-08 02:10:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 02:10:36,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:36,652 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, 2, 2, 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] [2025-03-08 02:10:36,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:10:36,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:36,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1567019455, now seen corresponding path program 1 times [2025-03-08 02:10:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:36,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229922826] [2025-03-08 02:10:36,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:36,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:36,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 02:10:36,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 02:10:36,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:36,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 02:10:36,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:36,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229922826] [2025-03-08 02:10:36,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229922826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:36,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:36,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:36,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850039077] [2025-03-08 02:10:36,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:36,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:36,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:36,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:36,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:36,760 INFO L87 Difference]: Start difference. First operand 9986 states and 11679 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:38,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:38,176 INFO L93 Difference]: Finished difference Result 25067 states and 29587 transitions. [2025-03-08 02:10:38,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:38,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2025-03-08 02:10:38,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:38,200 INFO L225 Difference]: With dead ends: 25067 [2025-03-08 02:10:38,201 INFO L226 Difference]: Without dead ends: 15083 [2025-03-08 02:10:38,209 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-08 02:10:38,210 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 406 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:38,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 487 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:10:38,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15083 states. [2025-03-08 02:10:38,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15083 to 10384. [2025-03-08 02:10:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10384 states, 10383 states have (on average 1.1651738418568813) internal successors, (12098), 10383 states have internal predecessors, (12098), 0 states have call successors, (0), 0 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-08 02:10:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 12098 transitions. [2025-03-08 02:10:38,331 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 12098 transitions. Word has length 202 [2025-03-08 02:10:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:38,331 INFO L471 AbstractCegarLoop]: Abstraction has 10384 states and 12098 transitions. [2025-03-08 02:10:38,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 12098 transitions. [2025-03-08 02:10:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 02:10:38,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:38,334 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:10:38,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:10:38,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:38,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:38,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1026659161, now seen corresponding path program 1 times [2025-03-08 02:10:38,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:38,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409308324] [2025-03-08 02:10:38,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:38,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 02:10:38,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 02:10:38,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:38,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:10:38,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:38,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409308324] [2025-03-08 02:10:38,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409308324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:38,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:38,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:38,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263189039] [2025-03-08 02:10:38,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:38,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:38,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:38,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:38,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:38,462 INFO L87 Difference]: Start difference. First operand 10384 states and 12098 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-08 02:10:39,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:39,932 INFO L93 Difference]: Finished difference Result 25874 states and 30417 transitions. [2025-03-08 02:10:39,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:39,933 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 215 [2025-03-08 02:10:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:39,957 INFO L225 Difference]: With dead ends: 25874 [2025-03-08 02:10:39,957 INFO L226 Difference]: Without dead ends: 15492 [2025-03-08 02:10:39,966 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-08 02:10:39,967 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 430 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:39,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 448 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:10:39,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15492 states. [2025-03-08 02:10:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15492 to 13778. [2025-03-08 02:10:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13778 states, 13777 states have (on average 1.166509399724178) internal successors, (16071), 13777 states have internal predecessors, (16071), 0 states have call successors, (0), 0 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-08 02:10:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13778 states to 13778 states and 16071 transitions. [2025-03-08 02:10:40,109 INFO L78 Accepts]: Start accepts. Automaton has 13778 states and 16071 transitions. Word has length 215 [2025-03-08 02:10:40,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:40,110 INFO L471 AbstractCegarLoop]: Abstraction has 13778 states and 16071 transitions. [2025-03-08 02:10:40,110 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-08 02:10:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 13778 states and 16071 transitions. [2025-03-08 02:10:40,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-08 02:10:40,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:40,113 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:10:40,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:10:40,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:40,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 133779585, now seen corresponding path program 1 times [2025-03-08 02:10:40,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:40,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273958689] [2025-03-08 02:10:40,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:40,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:40,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-08 02:10:40,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-08 02:10:40,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:40,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:10:40,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:40,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273958689] [2025-03-08 02:10:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273958689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:40,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:40,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:40,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847809947] [2025-03-08 02:10:40,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:40,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:40,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:40,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:40,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:40,223 INFO L87 Difference]: Start difference. First operand 13778 states and 16071 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-08 02:10:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:41,769 INFO L93 Difference]: Finished difference Result 32234 states and 37932 transitions. [2025-03-08 02:10:41,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:41,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 247 [2025-03-08 02:10:41,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:41,792 INFO L225 Difference]: With dead ends: 32234 [2025-03-08 02:10:41,792 INFO L226 Difference]: Without dead ends: 18458 [2025-03-08 02:10:41,804 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-08 02:10:41,804 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 444 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:41,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 416 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:10:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18458 states. [2025-03-08 02:10:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18458 to 17176. [2025-03-08 02:10:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17176 states, 17175 states have (on average 1.1833478893740903) internal successors, (20324), 17175 states have internal predecessors, (20324), 0 states have call successors, (0), 0 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-08 02:10:41,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17176 states to 17176 states and 20324 transitions. [2025-03-08 02:10:41,950 INFO L78 Accepts]: Start accepts. Automaton has 17176 states and 20324 transitions. Word has length 247 [2025-03-08 02:10:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:41,951 INFO L471 AbstractCegarLoop]: Abstraction has 17176 states and 20324 transitions. [2025-03-08 02:10:41,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-08 02:10:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 17176 states and 20324 transitions. [2025-03-08 02:10:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-08 02:10:41,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:41,954 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:41,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:10:41,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:41,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash -786147823, now seen corresponding path program 1 times [2025-03-08 02:10:41,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:41,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088976561] [2025-03-08 02:10:41,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:41,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:41,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-08 02:10:41,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-08 02:10:41,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:41,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:42,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:42,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088976561] [2025-03-08 02:10:42,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088976561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:42,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:42,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:42,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264408749] [2025-03-08 02:10:42,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:42,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:42,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:42,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:42,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:42,205 INFO L87 Difference]: Start difference. First operand 17176 states and 20324 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-08 02:10:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:43,722 INFO L93 Difference]: Finished difference Result 39057 states and 46415 transitions. [2025-03-08 02:10:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:43,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2025-03-08 02:10:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:43,749 INFO L225 Difference]: With dead ends: 39057 [2025-03-08 02:10:43,750 INFO L226 Difference]: Without dead ends: 21458 [2025-03-08 02:10:43,764 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-08 02:10:43,765 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 356 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:43,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 864 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:10:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21458 states. [2025-03-08 02:10:43,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21458 to 21025. [2025-03-08 02:10:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21025 states, 21024 states have (on average 1.1667142313546424) internal successors, (24529), 21024 states have internal predecessors, (24529), 0 states have call successors, (0), 0 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-08 02:10:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21025 states to 21025 states and 24529 transitions. [2025-03-08 02:10:43,934 INFO L78 Accepts]: Start accepts. Automaton has 21025 states and 24529 transitions. Word has length 264 [2025-03-08 02:10:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:43,934 INFO L471 AbstractCegarLoop]: Abstraction has 21025 states and 24529 transitions. [2025-03-08 02:10:43,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-08 02:10:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 21025 states and 24529 transitions. [2025-03-08 02:10:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 02:10:43,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:43,937 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:43,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:10:43,937 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:43,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:43,938 INFO L85 PathProgramCache]: Analyzing trace with hash -879388953, now seen corresponding path program 1 times [2025-03-08 02:10:43,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:43,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448528327] [2025-03-08 02:10:43,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:43,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:43,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 02:10:43,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 02:10:43,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:43,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 230 proven. 70 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 02:10:44,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:44,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448528327] [2025-03-08 02:10:44,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448528327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:10:44,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504786382] [2025-03-08 02:10:44,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:44,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:10:44,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:10:44,215 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-08 02:10:44,217 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-08 02:10:44,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 02:10:44,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 02:10:44,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:44,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:44,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:10:44,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:10:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 230 proven. 70 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 02:10:44,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:10:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 02:10:44,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504786382] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:10:44,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:10:44,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:10:44,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921026027] [2025-03-08 02:10:44,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:44,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:44,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:44,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:44,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:10:44,755 INFO L87 Difference]: Start difference. First operand 21025 states and 24529 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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-08 02:10:47,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:47,156 INFO L93 Difference]: Finished difference Result 59100 states and 69388 transitions. [2025-03-08 02:10:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:47,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 272 [2025-03-08 02:10:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:47,204 INFO L225 Difference]: With dead ends: 59100 [2025-03-08 02:10:47,204 INFO L226 Difference]: Without dead ends: 37213 [2025-03-08 02:10:47,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 541 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-08 02:10:47,220 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 878 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 3015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:47,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 157 Invalid, 3015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 02:10:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37213 states. [2025-03-08 02:10:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37213 to 35506. [2025-03-08 02:10:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35506 states, 35505 states have (on average 1.1591043514997887) internal successors, (41154), 35505 states have internal predecessors, (41154), 0 states have call successors, (0), 0 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-08 02:10:47,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35506 states to 35506 states and 41154 transitions. [2025-03-08 02:10:47,572 INFO L78 Accepts]: Start accepts. Automaton has 35506 states and 41154 transitions. Word has length 272 [2025-03-08 02:10:47,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:47,572 INFO L471 AbstractCegarLoop]: Abstraction has 35506 states and 41154 transitions. [2025-03-08 02:10:47,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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-08 02:10:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 35506 states and 41154 transitions. [2025-03-08 02:10:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-08 02:10:47,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:47,574 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:47,581 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-08 02:10:47,775 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,SelfDestructingSolverStorable9 [2025-03-08 02:10:47,775 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:47,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:47,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1295257950, now seen corresponding path program 1 times [2025-03-08 02:10:47,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:47,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896425413] [2025-03-08 02:10:47,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:47,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:47,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-08 02:10:47,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-08 02:10:47,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:47,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-08 02:10:47,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:47,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896425413] [2025-03-08 02:10:47,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896425413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:47,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:47,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:47,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281947613] [2025-03-08 02:10:47,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:47,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:47,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:47,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:47,904 INFO L87 Difference]: Start difference. First operand 35506 states and 41154 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-08 02:10:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:49,270 INFO L93 Difference]: Finished difference Result 78654 states and 91329 transitions. [2025-03-08 02:10:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:49,270 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 280 [2025-03-08 02:10:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:49,317 INFO L225 Difference]: With dead ends: 78654 [2025-03-08 02:10:49,317 INFO L226 Difference]: Without dead ends: 42723 [2025-03-08 02:10:49,345 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-08 02:10:49,346 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 380 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:49,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 850 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:10:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42723 states. [2025-03-08 02:10:49,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42723 to 42723. [2025-03-08 02:10:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42723 states, 42722 states have (on average 1.1170825335892514) internal successors, (47724), 42722 states have internal predecessors, (47724), 0 states have call successors, (0), 0 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-08 02:10:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42723 states to 42723 states and 47724 transitions. [2025-03-08 02:10:49,850 INFO L78 Accepts]: Start accepts. Automaton has 42723 states and 47724 transitions. Word has length 280 [2025-03-08 02:10:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:49,850 INFO L471 AbstractCegarLoop]: Abstraction has 42723 states and 47724 transitions. [2025-03-08 02:10:49,850 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-08 02:10:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 42723 states and 47724 transitions. [2025-03-08 02:10:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-08 02:10:49,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:49,856 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:49,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:10:49,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:49,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:49,856 INFO L85 PathProgramCache]: Analyzing trace with hash -760730359, now seen corresponding path program 1 times [2025-03-08 02:10:49,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:49,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809365768] [2025-03-08 02:10:49,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:49,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:49,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-08 02:10:49,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-08 02:10:49,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:49,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 371 proven. 73 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-08 02:10:50,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:50,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809365768] [2025-03-08 02:10:50,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809365768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:10:50,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922812117] [2025-03-08 02:10:50,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:50,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:10:50,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:10:50,162 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-08 02:10:50,164 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-08 02:10:50,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-08 02:10:50,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-08 02:10:50,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:50,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:50,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:10:50,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:10:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 371 proven. 73 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-08 02:10:50,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:10:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-08 02:10:50,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922812117] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:10:50,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:10:50,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:10:50,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371108283] [2025-03-08 02:10:50,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:50,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:50,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:50,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:50,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:10:50,602 INFO L87 Difference]: Start difference. First operand 42723 states and 47724 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-08 02:10:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:52,872 INFO L93 Difference]: Finished difference Result 101643 states and 113664 transitions. [2025-03-08 02:10:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 346 [2025-03-08 02:10:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:52,939 INFO L225 Difference]: With dead ends: 101643 [2025-03-08 02:10:52,939 INFO L226 Difference]: Without dead ends: 58493 [2025-03-08 02:10:52,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 689 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-08 02:10:52,970 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 879 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:52,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 172 Invalid, 2871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:10:53,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58493 states. [2025-03-08 02:10:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58493 to 55940. [2025-03-08 02:10:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55940 states, 55939 states have (on average 1.1210604408373406) internal successors, (62711), 55939 states have internal predecessors, (62711), 0 states have call successors, (0), 0 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-08 02:10:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55940 states to 55940 states and 62711 transitions. [2025-03-08 02:10:53,534 INFO L78 Accepts]: Start accepts. Automaton has 55940 states and 62711 transitions. Word has length 346 [2025-03-08 02:10:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:53,535 INFO L471 AbstractCegarLoop]: Abstraction has 55940 states and 62711 transitions. [2025-03-08 02:10:53,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-08 02:10:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 55940 states and 62711 transitions. [2025-03-08 02:10:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-08 02:10:53,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:53,542 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:53,547 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-08 02:10:53,746 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,SelfDestructingSolverStorable11 [2025-03-08 02:10:53,746 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:53,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:53,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1473370361, now seen corresponding path program 1 times [2025-03-08 02:10:53,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:53,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445567627] [2025-03-08 02:10:53,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:53,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:53,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 02:10:53,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 02:10:53,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:53,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-08 02:10:53,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:53,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445567627] [2025-03-08 02:10:53,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445567627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:53,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:53,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:53,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694265188] [2025-03-08 02:10:53,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:53,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:53,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:53,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:53,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:53,914 INFO L87 Difference]: Start difference. First operand 55940 states and 62711 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 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-08 02:10:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:55,415 INFO L93 Difference]: Finished difference Result 121241 states and 135987 transitions. [2025-03-08 02:10:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:55,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 443 [2025-03-08 02:10:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:55,486 INFO L225 Difference]: With dead ends: 121241 [2025-03-08 02:10:55,486 INFO L226 Difference]: Without dead ends: 64878 [2025-03-08 02:10:55,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-08 02:10:55,523 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 339 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:55,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 774 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:10:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64878 states. [2025-03-08 02:10:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64878 to 53350. [2025-03-08 02:10:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53350 states, 53349 states have (on average 1.1076871169094078) internal successors, (59094), 53349 states have internal predecessors, (59094), 0 states have call successors, (0), 0 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-08 02:10:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53350 states to 53350 states and 59094 transitions. [2025-03-08 02:10:56,222 INFO L78 Accepts]: Start accepts. Automaton has 53350 states and 59094 transitions. Word has length 443 [2025-03-08 02:10:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:56,222 INFO L471 AbstractCegarLoop]: Abstraction has 53350 states and 59094 transitions. [2025-03-08 02:10:56,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 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-08 02:10:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 53350 states and 59094 transitions. [2025-03-08 02:10:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-08 02:10:56,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:56,231 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:56,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:10:56,232 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:56,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2076857552, now seen corresponding path program 1 times [2025-03-08 02:10:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:56,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640296323] [2025-03-08 02:10:56,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:56,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 02:10:56,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 02:10:56,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:56,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-08 02:10:56,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:56,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640296323] [2025-03-08 02:10:56,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640296323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:56,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:56,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:56,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727571816] [2025-03-08 02:10:56,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:56,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:56,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:56,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:56,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:56,569 INFO L87 Difference]: Start difference. First operand 53350 states and 59094 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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-08 02:10:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:58,227 INFO L93 Difference]: Finished difference Result 119901 states and 132834 transitions. [2025-03-08 02:10:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:58,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 444 [2025-03-08 02:10:58,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:58,299 INFO L225 Difference]: With dead ends: 119901 [2025-03-08 02:10:58,299 INFO L226 Difference]: Without dead ends: 63990 [2025-03-08 02:10:58,334 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-08 02:10:58,334 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 437 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:58,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 659 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:10:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63990 states. [2025-03-08 02:10:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63990 to 61851. [2025-03-08 02:10:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61851 states, 61850 states have (on average 1.0961196443007275) internal successors, (67795), 61850 states have internal predecessors, (67795), 0 states have call successors, (0), 0 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-08 02:10:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61851 states to 61851 states and 67795 transitions. [2025-03-08 02:10:58,893 INFO L78 Accepts]: Start accepts. Automaton has 61851 states and 67795 transitions. Word has length 444 [2025-03-08 02:10:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:58,894 INFO L471 AbstractCegarLoop]: Abstraction has 61851 states and 67795 transitions. [2025-03-08 02:10:58,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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-08 02:10:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 61851 states and 67795 transitions. [2025-03-08 02:10:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 02:10:58,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:58,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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:58,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:10:58,903 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:58,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1970309845, now seen corresponding path program 1 times [2025-03-08 02:10:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:58,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487603249] [2025-03-08 02:10:58,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:58,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:58,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 02:10:58,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 02:10:58,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:58,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 02:10:59,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:59,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487603249] [2025-03-08 02:10:59,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487603249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:59,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:59,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:10:59,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083896597] [2025-03-08 02:10:59,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:59,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:59,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:59,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:59,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:59,289 INFO L87 Difference]: Start difference. First operand 61851 states and 67795 transitions. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 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-08 02:11:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:01,295 INFO L93 Difference]: Finished difference Result 145471 states and 159571 transitions. [2025-03-08 02:11:01,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:01,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 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 448 [2025-03-08 02:11:01,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:01,377 INFO L225 Difference]: With dead ends: 145471 [2025-03-08 02:11:01,377 INFO L226 Difference]: Without dead ends: 83622 [2025-03-08 02:11:01,414 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-08 02:11:01,415 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 828 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2316 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 2316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:01,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 207 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 2316 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:11:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83622 states. [2025-03-08 02:11:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83622 to 78925. [2025-03-08 02:11:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78925 states, 78924 states have (on average 1.097967665095535) internal successors, (86656), 78924 states have internal predecessors, (86656), 0 states have call successors, (0), 0 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-08 02:11:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78925 states to 78925 states and 86656 transitions. [2025-03-08 02:11:02,245 INFO L78 Accepts]: Start accepts. Automaton has 78925 states and 86656 transitions. Word has length 448 [2025-03-08 02:11:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:02,245 INFO L471 AbstractCegarLoop]: Abstraction has 78925 states and 86656 transitions. [2025-03-08 02:11:02,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 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-08 02:11:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 78925 states and 86656 transitions. [2025-03-08 02:11:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-08 02:11:02,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:02,250 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:02,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:11:02,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:02,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1113319179, now seen corresponding path program 1 times [2025-03-08 02:11:02,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:02,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568295134] [2025-03-08 02:11:02,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:02,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-08 02:11:02,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-08 02:11:02,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:02,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 02:11:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568295134] [2025-03-08 02:11:02,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568295134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:02,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:02,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:02,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268080818] [2025-03-08 02:11:02,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:02,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:02,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:02,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:02,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:02,596 INFO L87 Difference]: Start difference. First operand 78925 states and 86656 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:04,119 INFO L93 Difference]: Finished difference Result 167641 states and 184227 transitions. [2025-03-08 02:11:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:04,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 467 [2025-03-08 02:11:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:04,217 INFO L225 Difference]: With dead ends: 167641 [2025-03-08 02:11:04,217 INFO L226 Difference]: Without dead ends: 88718 [2025-03-08 02:11:04,266 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-08 02:11:04,267 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 386 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:04,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 326 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:11:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88718 states. [2025-03-08 02:11:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88718 to 88286. [2025-03-08 02:11:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88286 states, 88285 states have (on average 1.0953389590530667) internal successors, (96702), 88285 states have internal predecessors, (96702), 0 states have call successors, (0), 0 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-08 02:11:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88286 states to 88286 states and 96702 transitions. [2025-03-08 02:11:05,380 INFO L78 Accepts]: Start accepts. Automaton has 88286 states and 96702 transitions. Word has length 467 [2025-03-08 02:11:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:05,381 INFO L471 AbstractCegarLoop]: Abstraction has 88286 states and 96702 transitions. [2025-03-08 02:11:05,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 88286 states and 96702 transitions. [2025-03-08 02:11:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-08 02:11:05,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:05,388 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:05,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:11:05,388 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:05,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:05,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1400596364, now seen corresponding path program 1 times [2025-03-08 02:11:05,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:05,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142329800] [2025-03-08 02:11:05,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:05,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:05,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-08 02:11:05,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-08 02:11:05,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:05,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-03-08 02:11:05,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:05,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142329800] [2025-03-08 02:11:05,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142329800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:05,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:05,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083020074] [2025-03-08 02:11:05,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:05,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:05,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:05,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:05,555 INFO L87 Difference]: Start difference. First operand 88286 states and 96702 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:07,076 INFO L93 Difference]: Finished difference Result 190190 states and 208577 transitions. [2025-03-08 02:11:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:07,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 491 [2025-03-08 02:11:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:07,192 INFO L225 Difference]: With dead ends: 190190 [2025-03-08 02:11:07,192 INFO L226 Difference]: Without dead ends: 101906 [2025-03-08 02:11:07,246 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-08 02:11:07,247 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 475 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:07,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 264 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101906 states. [2025-03-08 02:11:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101906 to 101449. [2025-03-08 02:11:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101449 states, 101448 states have (on average 1.0927963094393187) internal successors, (110862), 101448 states have internal predecessors, (110862), 0 states have call successors, (0), 0 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-08 02:11:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101449 states to 101449 states and 110862 transitions. [2025-03-08 02:11:08,669 INFO L78 Accepts]: Start accepts. Automaton has 101449 states and 110862 transitions. Word has length 491 [2025-03-08 02:11:08,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:08,669 INFO L471 AbstractCegarLoop]: Abstraction has 101449 states and 110862 transitions. [2025-03-08 02:11:08,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 101449 states and 110862 transitions. [2025-03-08 02:11:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 02:11:08,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:08,676 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:08,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:11:08,677 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:08,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:08,677 INFO L85 PathProgramCache]: Analyzing trace with hash 641263300, now seen corresponding path program 1 times [2025-03-08 02:11:08,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:08,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742326219] [2025-03-08 02:11:08,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:08,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:08,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 02:11:08,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 02:11:08,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:08,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 02:11:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742326219] [2025-03-08 02:11:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742326219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:08,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:08,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:08,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842658790] [2025-03-08 02:11:08,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:08,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:08,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:08,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:08,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:08,811 INFO L87 Difference]: Start difference. First operand 101449 states and 110862 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 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-08 02:11:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:10,431 INFO L93 Difference]: Finished difference Result 208447 states and 227581 transitions. [2025-03-08 02:11:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:10,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 494 [2025-03-08 02:11:10,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:10,728 INFO L225 Difference]: With dead ends: 208447 [2025-03-08 02:11:10,728 INFO L226 Difference]: Without dead ends: 105293 [2025-03-08 02:11:10,769 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-08 02:11:10,769 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 401 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:10,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 807 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105293 states. [2025-03-08 02:11:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105293 to 102292. [2025-03-08 02:11:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102292 states, 102291 states have (on average 1.0912103704138194) internal successors, (111621), 102291 states have internal predecessors, (111621), 0 states have call successors, (0), 0 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-08 02:11:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102292 states to 102292 states and 111621 transitions. [2025-03-08 02:11:11,952 INFO L78 Accepts]: Start accepts. Automaton has 102292 states and 111621 transitions. Word has length 494 [2025-03-08 02:11:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:11,952 INFO L471 AbstractCegarLoop]: Abstraction has 102292 states and 111621 transitions. [2025-03-08 02:11:11,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 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-08 02:11:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 102292 states and 111621 transitions. [2025-03-08 02:11:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-08 02:11:11,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:11,965 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-08 02:11:11,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:11:11,965 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:11,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:11,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1310193056, now seen corresponding path program 1 times [2025-03-08 02:11:11,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:11,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456201259] [2025-03-08 02:11:11,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:11,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:12,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 02:11:12,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 02:11:12,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:12,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 651 proven. 29 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 02:11:12,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:12,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456201259] [2025-03-08 02:11:12,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456201259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:12,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571227918] [2025-03-08 02:11:12,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:12,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:12,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:11:12,839 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-08 02:11:12,841 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-08 02:11:12,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 02:11:12,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 02:11:12,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:12,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:12,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:11:12,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:11:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-08 02:11:13,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:11:13,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571227918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:13,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:11:13,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-08 02:11:13,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242956714] [2025-03-08 02:11:13,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:13,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:13,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:13,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:13,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:11:13,268 INFO L87 Difference]: Start difference. First operand 102292 states and 111621 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-08 02:11:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:15,902 INFO L93 Difference]: Finished difference Result 209694 states and 228650 transitions. [2025-03-08 02:11:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:15,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 532 [2025-03-08 02:11:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:16,013 INFO L225 Difference]: With dead ends: 209694 [2025-03-08 02:11:16,013 INFO L226 Difference]: Without dead ends: 107402 [2025-03-08 02:11:16,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:11:16,070 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 411 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:16,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 785 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 02:11:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107402 states. [2025-03-08 02:11:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107402 to 104421. [2025-03-08 02:11:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104421 states, 104420 states have (on average 1.0889580540126413) internal successors, (113709), 104420 states have internal predecessors, (113709), 0 states have call successors, (0), 0 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-08 02:11:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104421 states to 104421 states and 113709 transitions. [2025-03-08 02:11:17,191 INFO L78 Accepts]: Start accepts. Automaton has 104421 states and 113709 transitions. Word has length 532 [2025-03-08 02:11:17,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:17,191 INFO L471 AbstractCegarLoop]: Abstraction has 104421 states and 113709 transitions. [2025-03-08 02:11:17,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-08 02:11:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 104421 states and 113709 transitions. [2025-03-08 02:11:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-08 02:11:17,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:17,200 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:17,206 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-08 02:11:17,401 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-08 02:11:17,401 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:17,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:17,401 INFO L85 PathProgramCache]: Analyzing trace with hash -452521784, now seen corresponding path program 1 times [2025-03-08 02:11:17,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:17,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077007059] [2025-03-08 02:11:17,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:17,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:17,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-08 02:11:17,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-08 02:11:17,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:17,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 02:11:17,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:17,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077007059] [2025-03-08 02:11:17,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077007059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:17,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:17,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:17,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038107252] [2025-03-08 02:11:17,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:17,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:17,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:17,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:17,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:17,940 INFO L87 Difference]: Start difference. First operand 104421 states and 113709 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 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-08 02:11:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:19,672 INFO L93 Difference]: Finished difference Result 215230 states and 234145 transitions. [2025-03-08 02:11:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:19,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 539 [2025-03-08 02:11:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:19,797 INFO L225 Difference]: With dead ends: 215230 [2025-03-08 02:11:19,797 INFO L226 Difference]: Without dead ends: 110800 [2025-03-08 02:11:19,839 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-08 02:11:19,839 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 446 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:19,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 660 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:11:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110800 states. [2025-03-08 02:11:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110800 to 107377. [2025-03-08 02:11:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107377 states, 107376 states have (on average 1.0782670242884815) internal successors, (115780), 107376 states have internal predecessors, (115780), 0 states have call successors, (0), 0 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-08 02:11:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107377 states to 107377 states and 115780 transitions. [2025-03-08 02:11:21,153 INFO L78 Accepts]: Start accepts. Automaton has 107377 states and 115780 transitions. Word has length 539 [2025-03-08 02:11:21,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:21,153 INFO L471 AbstractCegarLoop]: Abstraction has 107377 states and 115780 transitions. [2025-03-08 02:11:21,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 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-08 02:11:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 107377 states and 115780 transitions. [2025-03-08 02:11:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-03-08 02:11:21,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:21,164 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:21,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:11:21,165 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:21,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:21,165 INFO L85 PathProgramCache]: Analyzing trace with hash -959599247, now seen corresponding path program 1 times [2025-03-08 02:11:21,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:21,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177842726] [2025-03-08 02:11:21,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:21,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-08 02:11:21,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-08 02:11:21,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:21,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 485 proven. 46 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-08 02:11:22,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:22,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177842726] [2025-03-08 02:11:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177842726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:22,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054659222] [2025-03-08 02:11:22,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:22,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:22,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:11:22,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:11:22,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:11:22,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-08 02:11:22,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-08 02:11:22,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:22,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:22,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:11:22,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:11:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 485 proven. 46 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-08 02:11:23,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:11:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-08 02:11:24,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054659222] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:24,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:11:24,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 8 [2025-03-08 02:11:24,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301696027] [2025-03-08 02:11:24,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:24,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:24,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:24,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:24,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:11:24,687 INFO L87 Difference]: Start difference. First operand 107377 states and 115780 transitions. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-08 02:11:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:27,028 INFO L93 Difference]: Finished difference Result 224993 states and 242507 transitions. [2025-03-08 02:11:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:27,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 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 580 [2025-03-08 02:11:27,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:27,158 INFO L225 Difference]: With dead ends: 224993 [2025-03-08 02:11:27,158 INFO L226 Difference]: Without dead ends: 117192 [2025-03-08 02:11:27,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1163 GetRequests, 1157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:11:27,226 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 733 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:27,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 110 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:11:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117192 states. [2025-03-08 02:11:28,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117192 to 107801. [2025-03-08 02:11:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107801 states, 107800 states have (on average 1.0776345083487942) internal successors, (116169), 107800 states have internal predecessors, (116169), 0 states have call successors, (0), 0 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-08 02:11:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107801 states to 107801 states and 116169 transitions. [2025-03-08 02:11:28,777 INFO L78 Accepts]: Start accepts. Automaton has 107801 states and 116169 transitions. Word has length 580 [2025-03-08 02:11:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:28,777 INFO L471 AbstractCegarLoop]: Abstraction has 107801 states and 116169 transitions. [2025-03-08 02:11:28,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-08 02:11:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 107801 states and 116169 transitions. [2025-03-08 02:11:28,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-03-08 02:11:28,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:28,790 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:28,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 02:11:28,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:28,994 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:28,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash 116042801, now seen corresponding path program 1 times [2025-03-08 02:11:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:28,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232894848] [2025-03-08 02:11:28,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:28,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:29,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-08 02:11:29,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-08 02:11:29,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:29,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-08 02:11:29,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:29,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232894848] [2025-03-08 02:11:29,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232894848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:29,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:29,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:29,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115788778] [2025-03-08 02:11:29,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:29,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:29,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:29,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:29,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:29,485 INFO L87 Difference]: Start difference. First operand 107801 states and 116169 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:31,624 INFO L93 Difference]: Finished difference Result 234375 states and 252432 transitions. [2025-03-08 02:11:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:31,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 623 [2025-03-08 02:11:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:31,770 INFO L225 Difference]: With dead ends: 234375 [2025-03-08 02:11:31,771 INFO L226 Difference]: Without dead ends: 126576 [2025-03-08 02:11:31,827 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-08 02:11:31,828 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 655 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 2618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:31,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 312 Invalid, 2618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:11:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126576 states. [2025-03-08 02:11:32,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126576 to 112915. [2025-03-08 02:11:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112915 states, 112914 states have (on average 1.0782808154878933) internal successors, (121753), 112914 states have internal predecessors, (121753), 0 states have call successors, (0), 0 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-08 02:11:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112915 states to 112915 states and 121753 transitions. [2025-03-08 02:11:33,273 INFO L78 Accepts]: Start accepts. Automaton has 112915 states and 121753 transitions. Word has length 623 [2025-03-08 02:11:33,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:33,274 INFO L471 AbstractCegarLoop]: Abstraction has 112915 states and 121753 transitions. [2025-03-08 02:11:33,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 112915 states and 121753 transitions. [2025-03-08 02:11:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2025-03-08 02:11:33,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:33,297 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:33,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 02:11:33,297 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:33,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash 344081553, now seen corresponding path program 1 times [2025-03-08 02:11:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:33,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009697676] [2025-03-08 02:11:33,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:33,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 634 statements into 1 equivalence classes. [2025-03-08 02:11:33,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 634 of 634 statements. [2025-03-08 02:11:33,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:33,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2025-03-08 02:11:33,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:33,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009697676] [2025-03-08 02:11:33,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009697676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:33,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:33,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:33,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407738456] [2025-03-08 02:11:33,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:33,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:33,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:33,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:33,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:33,569 INFO L87 Difference]: Start difference. First operand 112915 states and 121753 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-08 02:11:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:35,156 INFO L93 Difference]: Finished difference Result 226261 states and 244019 transitions. [2025-03-08 02:11:35,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:35,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 634 [2025-03-08 02:11:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:35,288 INFO L225 Difference]: With dead ends: 226261 [2025-03-08 02:11:35,288 INFO L226 Difference]: Without dead ends: 113773 [2025-03-08 02:11:35,353 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-08 02:11:35,354 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 491 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:35,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 643 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:11:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113773 states. [2025-03-08 02:11:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113773 to 113343. [2025-03-08 02:11:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113343 states, 113342 states have (on average 1.071632757495015) internal successors, (121461), 113342 states have internal predecessors, (121461), 0 states have call successors, (0), 0 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-08 02:11:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113343 states to 113343 states and 121461 transitions. [2025-03-08 02:11:36,780 INFO L78 Accepts]: Start accepts. Automaton has 113343 states and 121461 transitions. Word has length 634 [2025-03-08 02:11:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:36,780 INFO L471 AbstractCegarLoop]: Abstraction has 113343 states and 121461 transitions. [2025-03-08 02:11:36,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-08 02:11:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 113343 states and 121461 transitions. [2025-03-08 02:11:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-03-08 02:11:36,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:36,794 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:11:36,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 02:11:36,794 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:36,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:36,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1445811271, now seen corresponding path program 1 times [2025-03-08 02:11:36,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:36,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216416917] [2025-03-08 02:11:36,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:36,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:36,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-03-08 02:11:36,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-03-08 02:11:36,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:36,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 578 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 02:11:37,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:37,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216416917] [2025-03-08 02:11:37,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216416917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:37,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:37,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:37,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45669356] [2025-03-08 02:11:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:37,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:37,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:37,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:37,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:37,517 INFO L87 Difference]: Start difference. First operand 113343 states and 121461 transitions. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 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-08 02:11:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:39,687 INFO L93 Difference]: Finished difference Result 239061 states and 255986 transitions. [2025-03-08 02:11:39,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:39,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 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 645 [2025-03-08 02:11:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:39,826 INFO L225 Difference]: With dead ends: 239061 [2025-03-08 02:11:39,826 INFO L226 Difference]: Without dead ends: 125720 [2025-03-08 02:11:39,898 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-08 02:11:39,898 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 679 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:39,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 249 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 2296 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:11:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125720 states. [2025-03-08 02:11:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125720 to 117168. [2025-03-08 02:11:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117168 states, 117167 states have (on average 1.0699172975325817) internal successors, (125359), 117167 states have internal predecessors, (125359), 0 states have call successors, (0), 0 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-08 02:11:41,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117168 states to 117168 states and 125359 transitions. [2025-03-08 02:11:41,427 INFO L78 Accepts]: Start accepts. Automaton has 117168 states and 125359 transitions. Word has length 645 [2025-03-08 02:11:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:41,427 INFO L471 AbstractCegarLoop]: Abstraction has 117168 states and 125359 transitions. [2025-03-08 02:11:41,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 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-08 02:11:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 117168 states and 125359 transitions. [2025-03-08 02:11:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-03-08 02:11:41,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:41,447 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:41,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 02:11:41,447 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:41,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:41,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1718494812, now seen corresponding path program 1 times [2025-03-08 02:11:41,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:41,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395132928] [2025-03-08 02:11:41,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:41,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-03-08 02:11:41,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-03-08 02:11:41,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:41,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-08 02:11:41,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:41,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395132928] [2025-03-08 02:11:41,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395132928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:41,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:41,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 02:11:41,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505299474] [2025-03-08 02:11:41,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:41,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:11:41,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:41,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:11:41,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:11:41,956 INFO L87 Difference]: Start difference. First operand 117168 states and 125359 transitions. Second operand has 5 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)