./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label56.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 a498fb7710a33a2d85f447c670841227251b50491988d49c611ac72650abaae2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:11:13,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:11:13,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:11:13,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:11:13,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:11:13,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:11:13,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:11:13,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:11:13,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:11:13,727 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:11:13,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:11:13,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:11:13,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:11:13,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:11:13,728 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:11:13,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:11:13,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:11:13,728 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:11:13,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:11:13,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:11:13,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:11:13,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:11:13,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:11:13,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:11:13,729 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:11:13,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:11:13,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:11:13,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:11:13,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:11:13,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:11:13,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:11:13,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:11:13,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:11:13,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:11:13,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:11:13,730 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:11:13,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:11:13,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:11:13,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:11:13,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:11:13,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:11:13,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:11:13,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:11:13,730 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 -> a498fb7710a33a2d85f447c670841227251b50491988d49c611ac72650abaae2 [2025-03-16 15:11:13,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:11:13,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:11:13,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:11:13,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:11:13,965 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:11:13,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label56.c [2025-03-16 15:11:15,134 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3038e11e/abc687e588674e6c81ba8ca2fe6ee212/FLAG14b7470bf [2025-03-16 15:11:15,492 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:11:15,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label56.c [2025-03-16 15:11:15,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3038e11e/abc687e588674e6c81ba8ca2fe6ee212/FLAG14b7470bf [2025-03-16 15:11:15,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3038e11e/abc687e588674e6c81ba8ca2fe6ee212 [2025-03-16 15:11:15,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:11:15,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:11:15,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:11:15,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:11:15,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:11:15,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:11:15" (1/1) ... [2025-03-16 15:11:15,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1574222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:15, skipping insertion in model container [2025-03-16 15:11:15,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:11:15" (1/1) ... [2025-03-16 15:11:15,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:11:15,717 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/Problem15_label56.c[4182,4195] [2025-03-16 15:11:15,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:11:15,985 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:11:15,998 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/Problem15_label56.c[4182,4195] [2025-03-16 15:11:16,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:11:16,130 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:11:16,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16 WrapperNode [2025-03-16 15:11:16,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:11:16,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:11:16,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:11:16,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:11:16,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (1/1) ... [2025-03-16 15:11:16,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (1/1) ... [2025-03-16 15:11:16,300 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-16 15:11:16,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:11:16,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:11:16,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:11:16,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:11:16,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (1/1) ... [2025-03-16 15:11:16,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (1/1) ... [2025-03-16 15:11:16,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (1/1) ... [2025-03-16 15:11:16,423 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:11:16,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (1/1) ... [2025-03-16 15:11:16,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (1/1) ... [2025-03-16 15:11:16,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (1/1) ... [2025-03-16 15:11:16,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (1/1) ... [2025-03-16 15:11:16,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (1/1) ... [2025-03-16 15:11:16,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (1/1) ... [2025-03-16 15:11:16,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:11:16,538 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:11:16,538 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:11:16,539 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:11:16,539 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (1/1) ... [2025-03-16 15:11:16,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:11:16,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:16,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:11:16,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:11:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:11:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:11:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:11:16,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:11:16,635 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:11:16,636 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:11:18,489 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-16 15:11:18,577 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-16 15:11:18,577 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:11:18,594 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:11:18,594 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:11:18,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:18 BoogieIcfgContainer [2025-03-16 15:11:18,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:11:18,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:11:18,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:11:18,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:11:18,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:11:15" (1/3) ... [2025-03-16 15:11:18,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d881cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:11:18, skipping insertion in model container [2025-03-16 15:11:18,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:16" (2/3) ... [2025-03-16 15:11:18,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d881cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:11:18, skipping insertion in model container [2025-03-16 15:11:18,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:18" (3/3) ... [2025-03-16 15:11:18,603 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label56.c [2025-03-16 15:11:18,615 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:11:18,616 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label56.c that has 1 procedures, 363 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:11:18,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:11:18,682 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;@f55c874, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:11:18,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:11:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 15:11:18,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:18,692 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] [2025-03-16 15:11:18,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:18,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash 184375899, now seen corresponding path program 1 times [2025-03-16 15:11:18,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:18,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330528653] [2025-03-16 15:11:18,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:18,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:18,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 15:11:18,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 15:11:18,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:18,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:18,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:18,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330528653] [2025-03-16 15:11:18,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330528653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:18,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:18,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:18,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967957521] [2025-03-16 15:11:18,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:18,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:11:18,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:18,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:11:18,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:11:18,833 INFO L87 Difference]: Start difference. First operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:18,873 INFO L93 Difference]: Finished difference Result 725 states and 1375 transitions. [2025-03-16 15:11:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:11:18,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-16 15:11:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:18,883 INFO L225 Difference]: With dead ends: 725 [2025-03-16 15:11:18,883 INFO L226 Difference]: Without dead ends: 360 [2025-03-16 15:11:18,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:11:18,887 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:18,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:11:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-16 15:11:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-16 15:11:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2025-03-16 15:11:18,957 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 32 [2025-03-16 15:11:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:18,957 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2025-03-16 15:11:18,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2025-03-16 15:11:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 15:11:18,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:18,958 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] [2025-03-16 15:11:18,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:11:18,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:18,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:18,959 INFO L85 PathProgramCache]: Analyzing trace with hash 307973855, now seen corresponding path program 1 times [2025-03-16 15:11:18,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:18,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873936638] [2025-03-16 15:11:18,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:18,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:18,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 15:11:18,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 15:11:18,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:18,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:19,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:19,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873936638] [2025-03-16 15:11:19,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873936638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:19,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:19,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:19,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656351279] [2025-03-16 15:11:19,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:19,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:19,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:19,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:19,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:19,112 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:20,420 INFO L93 Difference]: Finished difference Result 1023 states and 1787 transitions. [2025-03-16 15:11:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-16 15:11:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:20,423 INFO L225 Difference]: With dead ends: 1023 [2025-03-16 15:11:20,425 INFO L226 Difference]: Without dead ends: 664 [2025-03-16 15:11:20,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:20,428 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 284 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:20,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 319 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:11:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-16 15:11:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 662. [2025-03-16 15:11:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4826021180030258) internal successors, (980), 661 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 980 transitions. [2025-03-16 15:11:20,446 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 980 transitions. Word has length 32 [2025-03-16 15:11:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:20,446 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 980 transitions. [2025-03-16 15:11:20,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 980 transitions. [2025-03-16 15:11:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 15:11:20,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:20,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:11:20,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:20,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1630448771, now seen corresponding path program 1 times [2025-03-16 15:11:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014422411] [2025-03-16 15:11:20,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:20,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 15:11:20,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 15:11:20,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:20,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:20,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:20,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014422411] [2025-03-16 15:11:20,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014422411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:20,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:20,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245652828] [2025-03-16 15:11:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:20,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:20,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:20,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:20,801 INFO L87 Difference]: Start difference. First operand 662 states and 980 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:21,926 INFO L93 Difference]: Finished difference Result 1623 states and 2314 transitions. [2025-03-16 15:11:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:21,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-16 15:11:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:21,930 INFO L225 Difference]: With dead ends: 1623 [2025-03-16 15:11:21,931 INFO L226 Difference]: Without dead ends: 962 [2025-03-16 15:11:21,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:21,932 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:21,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 336 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:11:21,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-03-16 15:11:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2025-03-16 15:11:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3631633714880333) internal successors, (1310), 961 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1310 transitions. [2025-03-16 15:11:21,950 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1310 transitions. Word has length 97 [2025-03-16 15:11:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:21,950 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1310 transitions. [2025-03-16 15:11:21,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1310 transitions. [2025-03-16 15:11:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 15:11:21,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:21,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:21,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:11:21,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:21,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:21,953 INFO L85 PathProgramCache]: Analyzing trace with hash -379513690, now seen corresponding path program 1 times [2025-03-16 15:11:21,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:21,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136786449] [2025-03-16 15:11:21,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:21,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:21,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 15:11:21,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 15:11:21,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:21,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136786449] [2025-03-16 15:11:22,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136786449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:22,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:22,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:11:22,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186088406] [2025-03-16 15:11:22,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:22,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:11:22,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:22,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:11:22,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:11:22,255 INFO L87 Difference]: Start difference. First operand 962 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:23,863 INFO L93 Difference]: Finished difference Result 2239 states and 3196 transitions. [2025-03-16 15:11:23,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:11:23,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-03-16 15:11:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:23,867 INFO L225 Difference]: With dead ends: 2239 [2025-03-16 15:11:23,867 INFO L226 Difference]: Without dead ends: 1577 [2025-03-16 15:11:23,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:11:23,869 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 357 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:23,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 367 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:11:23,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2025-03-16 15:11:23,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1265. [2025-03-16 15:11:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3045886075949367) internal successors, (1649), 1264 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1649 transitions. [2025-03-16 15:11:23,887 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1649 transitions. Word has length 102 [2025-03-16 15:11:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:23,887 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1649 transitions. [2025-03-16 15:11:23,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1649 transitions. [2025-03-16 15:11:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 15:11:23,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:23,891 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:23,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:11:23,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:23,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:23,892 INFO L85 PathProgramCache]: Analyzing trace with hash -447604974, now seen corresponding path program 1 times [2025-03-16 15:11:23,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:23,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908906226] [2025-03-16 15:11:23,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:23,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:23,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 15:11:23,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 15:11:23,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:23,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:24,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:24,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908906226] [2025-03-16 15:11:24,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908906226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:24,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:24,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:24,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430091544] [2025-03-16 15:11:24,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:24,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:11:24,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:24,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:11:24,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:11:24,085 INFO L87 Difference]: Start difference. First operand 1265 states and 1649 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:25,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:25,979 INFO L93 Difference]: Finished difference Result 4669 states and 6169 transitions. [2025-03-16 15:11:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:11:25,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2025-03-16 15:11:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:25,989 INFO L225 Difference]: With dead ends: 4669 [2025-03-16 15:11:25,989 INFO L226 Difference]: Without dead ends: 3405 [2025-03-16 15:11:25,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:11:25,992 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 489 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:25,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 345 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:11:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2025-03-16 15:11:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3380. [2025-03-16 15:11:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.2367564368156259) internal successors, (4179), 3379 states have internal predecessors, (4179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4179 transitions. [2025-03-16 15:11:26,039 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4179 transitions. Word has length 198 [2025-03-16 15:11:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:26,039 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 4179 transitions. [2025-03-16 15:11:26,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4179 transitions. [2025-03-16 15:11:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-16 15:11:26,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:26,043 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:26,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:11:26,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:26,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:26,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1871805220, now seen corresponding path program 1 times [2025-03-16 15:11:26,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:26,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720438945] [2025-03-16 15:11:26,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:26,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:26,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 15:11:26,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 15:11:26,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:26,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 15:11:26,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720438945] [2025-03-16 15:11:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720438945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:26,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:26,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:26,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672125885] [2025-03-16 15:11:26,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:26,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:26,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:26,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:26,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:26,199 INFO L87 Difference]: Start difference. First operand 3380 states and 4179 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:27,368 INFO L93 Difference]: Finished difference Result 8562 states and 10753 transitions. [2025-03-16 15:11:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:27,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-16 15:11:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:27,383 INFO L225 Difference]: With dead ends: 8562 [2025-03-16 15:11:27,383 INFO L226 Difference]: Without dead ends: 5482 [2025-03-16 15:11:27,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:27,388 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:27,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:11:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2025-03-16 15:11:27,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5477. [2025-03-16 15:11:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.168736303871439) internal successors, (6400), 5476 states have internal predecessors, (6400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6400 transitions. [2025-03-16 15:11:27,476 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6400 transitions. Word has length 202 [2025-03-16 15:11:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:27,476 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6400 transitions. [2025-03-16 15:11:27,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6400 transitions. [2025-03-16 15:11:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-16 15:11:27,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:27,481 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:27,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:11:27,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:27,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash 272511872, now seen corresponding path program 1 times [2025-03-16 15:11:27,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:27,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881115604] [2025-03-16 15:11:27,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:27,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:27,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-16 15:11:27,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-16 15:11:27,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:27,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 15:11:27,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:27,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881115604] [2025-03-16 15:11:27,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881115604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:27,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:27,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:27,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947113907] [2025-03-16 15:11:27,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:27,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:27,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:27,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:27,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:27,948 INFO L87 Difference]: Start difference. First operand 5477 states and 6400 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:28,886 INFO L93 Difference]: Finished difference Result 10654 states and 12488 transitions. [2025-03-16 15:11:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:28,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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 304 [2025-03-16 15:11:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:28,899 INFO L225 Difference]: With dead ends: 10654 [2025-03-16 15:11:28,899 INFO L226 Difference]: Without dead ends: 5477 [2025-03-16 15:11:28,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:28,904 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:28,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 358 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:11:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2025-03-16 15:11:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5477. [2025-03-16 15:11:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1676406135865596) internal successors, (6394), 5476 states have internal predecessors, (6394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6394 transitions. [2025-03-16 15:11:28,968 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6394 transitions. Word has length 304 [2025-03-16 15:11:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:28,969 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6394 transitions. [2025-03-16 15:11:28,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6394 transitions. [2025-03-16 15:11:28,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-16 15:11:28,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:28,975 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:28,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:11:28,975 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:28,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash -712681903, now seen corresponding path program 1 times [2025-03-16 15:11:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324604528] [2025-03-16 15:11:28,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:29,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-16 15:11:29,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-16 15:11:29,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:29,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 15:11:29,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:29,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324604528] [2025-03-16 15:11:29,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324604528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:29,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:29,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:29,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366657456] [2025-03-16 15:11:29,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:29,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:29,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:29,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:29,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:29,127 INFO L87 Difference]: Start difference. First operand 5477 states and 6394 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:30,306 INFO L93 Difference]: Finished difference Result 11850 states and 14150 transitions. [2025-03-16 15:11:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:30,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 319 [2025-03-16 15:11:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:30,320 INFO L225 Difference]: With dead ends: 11850 [2025-03-16 15:11:30,320 INFO L226 Difference]: Without dead ends: 6673 [2025-03-16 15:11:30,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:30,325 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 281 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:30,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:11:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2025-03-16 15:11:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 4875. [2025-03-16 15:11:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.1805498563807961) internal successors, (5754), 4874 states have internal predecessors, (5754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 5754 transitions. [2025-03-16 15:11:30,390 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 5754 transitions. Word has length 319 [2025-03-16 15:11:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:30,391 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 5754 transitions. [2025-03-16 15:11:30,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 5754 transitions. [2025-03-16 15:11:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-16 15:11:30,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:30,398 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:30,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:11:30,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:30,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash -897975444, now seen corresponding path program 1 times [2025-03-16 15:11:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831482433] [2025-03-16 15:11:30,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:30,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-16 15:11:30,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-16 15:11:30,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:30,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 15:11:30,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:30,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831482433] [2025-03-16 15:11:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831482433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:30,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:30,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:30,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345923407] [2025-03-16 15:11:30,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:30,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:30,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:30,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:30,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:30,628 INFO L87 Difference]: Start difference. First operand 4875 states and 5754 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:31,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:31,638 INFO L93 Difference]: Finished difference Result 11851 states and 14243 transitions. [2025-03-16 15:11:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:31,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 378 [2025-03-16 15:11:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:31,655 INFO L225 Difference]: With dead ends: 11851 [2025-03-16 15:11:31,657 INFO L226 Difference]: Without dead ends: 7276 [2025-03-16 15:11:31,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:31,662 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 295 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:31,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 634 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:11:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7276 states. [2025-03-16 15:11:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7276 to 6379. [2025-03-16 15:11:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6379 states, 6378 states have (on average 1.1558482282847287) internal successors, (7372), 6378 states have internal predecessors, (7372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 7372 transitions. [2025-03-16 15:11:31,754 INFO L78 Accepts]: Start accepts. Automaton has 6379 states and 7372 transitions. Word has length 378 [2025-03-16 15:11:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:31,755 INFO L471 AbstractCegarLoop]: Abstraction has 6379 states and 7372 transitions. [2025-03-16 15:11:31,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 7372 transitions. [2025-03-16 15:11:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-03-16 15:11:31,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:31,765 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:31,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:11:31,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:31,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1624048282, now seen corresponding path program 1 times [2025-03-16 15:11:31,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:31,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042416511] [2025-03-16 15:11:31,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:31,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:31,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-03-16 15:11:31,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-03-16 15:11:31,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:31,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:31,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:31,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042416511] [2025-03-16 15:11:31,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042416511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:31,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:31,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:31,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955112945] [2025-03-16 15:11:31,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:31,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:32,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:32,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:32,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:32,001 INFO L87 Difference]: Start difference. First operand 6379 states and 7372 transitions. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:33,278 INFO L93 Difference]: Finished difference Result 14562 states and 17151 transitions. [2025-03-16 15:11:33,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:33,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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 384 [2025-03-16 15:11:33,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:33,289 INFO L225 Difference]: With dead ends: 14562 [2025-03-16 15:11:33,289 INFO L226 Difference]: Without dead ends: 8483 [2025-03-16 15:11:33,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:33,294 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:33,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 602 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:11:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8483 states. [2025-03-16 15:11:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8483 to 7583. [2025-03-16 15:11:33,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7583 states, 7582 states have (on average 1.1425745185966762) internal successors, (8663), 7582 states have internal predecessors, (8663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7583 states to 7583 states and 8663 transitions. [2025-03-16 15:11:33,348 INFO L78 Accepts]: Start accepts. Automaton has 7583 states and 8663 transitions. Word has length 384 [2025-03-16 15:11:33,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:33,349 INFO L471 AbstractCegarLoop]: Abstraction has 7583 states and 8663 transitions. [2025-03-16 15:11:33,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 7583 states and 8663 transitions. [2025-03-16 15:11:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-16 15:11:33,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:33,354 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:33,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:11:33,354 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:33,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:33,354 INFO L85 PathProgramCache]: Analyzing trace with hash 318757153, now seen corresponding path program 1 times [2025-03-16 15:11:33,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:33,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242909620] [2025-03-16 15:11:33,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:33,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:33,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-16 15:11:33,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-16 15:11:33,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:33,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 15:11:33,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:33,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242909620] [2025-03-16 15:11:33,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242909620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:33,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:33,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:33,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224186412] [2025-03-16 15:11:33,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:33,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:33,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:33,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:33,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:33,550 INFO L87 Difference]: Start difference. First operand 7583 states and 8663 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:34,476 INFO L93 Difference]: Finished difference Result 16660 states and 19397 transitions. [2025-03-16 15:11:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:34,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 401 [2025-03-16 15:11:34,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:34,499 INFO L225 Difference]: With dead ends: 16660 [2025-03-16 15:11:34,499 INFO L226 Difference]: Without dead ends: 9377 [2025-03-16 15:11:34,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:34,506 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 246 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:34,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 617 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:11:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2025-03-16 15:11:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 9074. [2025-03-16 15:11:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9074 states, 9073 states have (on average 1.132040119034498) internal successors, (10271), 9073 states have internal predecessors, (10271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 10271 transitions. [2025-03-16 15:11:34,576 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 10271 transitions. Word has length 401 [2025-03-16 15:11:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:34,577 INFO L471 AbstractCegarLoop]: Abstraction has 9074 states and 10271 transitions. [2025-03-16 15:11:34,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 10271 transitions. [2025-03-16 15:11:34,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-16 15:11:34,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:34,583 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:34,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:11:34,583 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:34,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:34,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1807415537, now seen corresponding path program 1 times [2025-03-16 15:11:34,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:34,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3198709] [2025-03-16 15:11:34,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:34,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:34,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-16 15:11:34,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-16 15:11:34,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:34,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 471 proven. 39 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-16 15:11:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:35,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3198709] [2025-03-16 15:11:35,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3198709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:35,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496967487] [2025-03-16 15:11:35,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:35,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:35,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:35,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:11:35,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:11:35,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-16 15:11:35,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-16 15:11:35,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:35,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:35,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:11:35,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-16 15:11:35,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:11:35,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496967487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:35,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:11:35,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:11:35,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667753549] [2025-03-16 15:11:35,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:35,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:35,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:35,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:35,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:11:35,248 INFO L87 Difference]: Start difference. First operand 9074 states and 10271 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:36,236 INFO L93 Difference]: Finished difference Result 20239 states and 23192 transitions. [2025-03-16 15:11:36,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:36,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 516 [2025-03-16 15:11:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:36,250 INFO L225 Difference]: With dead ends: 20239 [2025-03-16 15:11:36,250 INFO L226 Difference]: Without dead ends: 11465 [2025-03-16 15:11:36,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:11:36,258 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 384 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:36,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 444 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:11:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11465 states. [2025-03-16 15:11:36,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11465 to 11465. [2025-03-16 15:11:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11465 states, 11464 states have (on average 1.13668876482903) internal successors, (13031), 11464 states have internal predecessors, (13031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11465 states to 11465 states and 13031 transitions. [2025-03-16 15:11:36,360 INFO L78 Accepts]: Start accepts. Automaton has 11465 states and 13031 transitions. Word has length 516 [2025-03-16 15:11:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:36,360 INFO L471 AbstractCegarLoop]: Abstraction has 11465 states and 13031 transitions. [2025-03-16 15:11:36,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 11465 states and 13031 transitions. [2025-03-16 15:11:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-16 15:11:36,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:36,365 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:36,372 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-16 15:11:36,565 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,SelfDestructingSolverStorable11 [2025-03-16 15:11:36,565 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:36,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1405145511, now seen corresponding path program 1 times [2025-03-16 15:11:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:36,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666643967] [2025-03-16 15:11:36,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:36,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:36,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-16 15:11:36,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-16 15:11:36,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:36,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-16 15:11:36,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:36,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666643967] [2025-03-16 15:11:36,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666643967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:36,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:36,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:36,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838572610] [2025-03-16 15:11:36,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:36,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:36,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:36,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:36,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:36,851 INFO L87 Difference]: Start difference. First operand 11465 states and 13031 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:38,100 INFO L93 Difference]: Finished difference Result 27129 states and 31139 transitions. [2025-03-16 15:11:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 520 [2025-03-16 15:11:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:38,119 INFO L225 Difference]: With dead ends: 27129 [2025-03-16 15:11:38,119 INFO L226 Difference]: Without dead ends: 15964 [2025-03-16 15:11:38,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:38,129 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:38,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:11:38,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15964 states. [2025-03-16 15:11:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15964 to 15355. [2025-03-16 15:11:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15355 states, 15354 states have (on average 1.1286309756415267) internal successors, (17329), 15354 states have internal predecessors, (17329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15355 states to 15355 states and 17329 transitions. [2025-03-16 15:11:38,260 INFO L78 Accepts]: Start accepts. Automaton has 15355 states and 17329 transitions. Word has length 520 [2025-03-16 15:11:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:38,261 INFO L471 AbstractCegarLoop]: Abstraction has 15355 states and 17329 transitions. [2025-03-16 15:11:38,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 15355 states and 17329 transitions. [2025-03-16 15:11:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-03-16 15:11:38,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:38,268 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:38,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:11:38,269 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:38,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash 845509491, now seen corresponding path program 1 times [2025-03-16 15:11:38,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:38,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257697624] [2025-03-16 15:11:38,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:38,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:38,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-03-16 15:11:38,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-03-16 15:11:38,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:38,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 628 proven. 39 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-16 15:11:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257697624] [2025-03-16 15:11:38,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257697624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321511220] [2025-03-16 15:11:38,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:38,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:38,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:38,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:11:38,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:11:38,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-03-16 15:11:38,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-03-16 15:11:38,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:38,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:38,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:11:38,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-16 15:11:39,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:11:39,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321511220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:39,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:11:39,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:11:39,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326683628] [2025-03-16 15:11:39,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:39,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:39,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:39,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:39,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:11:39,012 INFO L87 Difference]: Start difference. First operand 15355 states and 17329 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:40,044 INFO L93 Difference]: Finished difference Result 30107 states and 34017 transitions. [2025-03-16 15:11:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:40,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 595 [2025-03-16 15:11:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:40,058 INFO L225 Difference]: With dead ends: 30107 [2025-03-16 15:11:40,059 INFO L226 Difference]: Without dead ends: 15052 [2025-03-16 15:11:40,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:11:40,070 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 252 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:40,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 602 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:11:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15052 states. [2025-03-16 15:11:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15052 to 15051. [2025-03-16 15:11:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15051 states, 15050 states have (on average 1.0795348837209302) internal successors, (16247), 15050 states have internal predecessors, (16247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15051 states to 15051 states and 16247 transitions. [2025-03-16 15:11:40,177 INFO L78 Accepts]: Start accepts. Automaton has 15051 states and 16247 transitions. Word has length 595 [2025-03-16 15:11:40,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:40,178 INFO L471 AbstractCegarLoop]: Abstraction has 15051 states and 16247 transitions. [2025-03-16 15:11:40,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 15051 states and 16247 transitions. [2025-03-16 15:11:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-03-16 15:11:40,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:40,184 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:40,191 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-16 15:11:40,389 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,SelfDestructingSolverStorable13 [2025-03-16 15:11:40,389 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:40,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1162106399, now seen corresponding path program 1 times [2025-03-16 15:11:40,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:40,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216270187] [2025-03-16 15:11:40,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:40,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:40,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-03-16 15:11:40,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-03-16 15:11:40,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:40,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 555 proven. 39 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-16 15:11:40,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:40,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216270187] [2025-03-16 15:11:40,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216270187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:40,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144931355] [2025-03-16 15:11:40,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:40,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:40,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:40,804 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:11:40,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:11:40,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-03-16 15:11:40,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-03-16 15:11:40,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:40,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:40,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:11:40,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 555 proven. 39 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-16 15:11:41,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:11:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 555 proven. 39 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-16 15:11:42,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144931355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:11:42,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:11:42,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-16 15:11:42,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270599799] [2025-03-16 15:11:42,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:11:42,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:11:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:42,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:11:42,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:11:42,080 INFO L87 Difference]: Start difference. First operand 15051 states and 16247 transitions. Second operand has 9 states, 9 states have (on average 86.0) internal successors, (774), 8 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:45,675 INFO L93 Difference]: Finished difference Result 38433 states and 41453 transitions. [2025-03-16 15:11:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 15:11:45,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.0) internal successors, (774), 8 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 596 [2025-03-16 15:11:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:45,690 INFO L225 Difference]: With dead ends: 38433 [2025-03-16 15:11:45,690 INFO L226 Difference]: Without dead ends: 16545 [2025-03-16 15:11:45,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1201 GetRequests, 1187 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-16 15:11:45,701 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 3309 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4984 mSolverCounterSat, 698 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3309 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 5682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 698 IncrementalHoareTripleChecker+Valid, 4984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:45,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3309 Valid, 225 Invalid, 5682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [698 Valid, 4984 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-16 15:11:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16545 states. [2025-03-16 15:11:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16545 to 12356. [2025-03-16 15:11:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12356 states, 12355 states have (on average 1.0386078510724404) internal successors, (12832), 12355 states have internal predecessors, (12832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12356 states to 12356 states and 12832 transitions. [2025-03-16 15:11:45,854 INFO L78 Accepts]: Start accepts. Automaton has 12356 states and 12832 transitions. Word has length 596 [2025-03-16 15:11:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:45,855 INFO L471 AbstractCegarLoop]: Abstraction has 12356 states and 12832 transitions. [2025-03-16 15:11:45,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.0) internal successors, (774), 8 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 12356 states and 12832 transitions. [2025-03-16 15:11:45,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-16 15:11:45,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:45,861 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:45,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:11:46,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:46,062 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:46,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:46,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1679486384, now seen corresponding path program 1 times [2025-03-16 15:11:46,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:46,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899749361] [2025-03-16 15:11:46,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:46,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:46,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-16 15:11:46,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-16 15:11:46,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:46,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-16 15:11:46,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:46,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899749361] [2025-03-16 15:11:46,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899749361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:46,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:46,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:46,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598711479] [2025-03-16 15:11:46,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:46,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:46,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:46,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:46,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:46,275 INFO L87 Difference]: Start difference. First operand 12356 states and 12832 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:46,963 INFO L93 Difference]: Finished difference Result 28294 states and 29435 transitions. [2025-03-16 15:11:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:46,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 633 [2025-03-16 15:11:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:46,981 INFO L225 Difference]: With dead ends: 28294 [2025-03-16 15:11:46,981 INFO L226 Difference]: Without dead ends: 15939 [2025-03-16 15:11:46,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:46,990 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 281 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:46,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 533 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:11:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15939 states. [2025-03-16 15:11:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15939 to 15042. [2025-03-16 15:11:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15042 states, 15041 states have (on average 1.0329765308157701) internal successors, (15537), 15041 states have internal predecessors, (15537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15042 states to 15042 states and 15537 transitions. [2025-03-16 15:11:47,158 INFO L78 Accepts]: Start accepts. Automaton has 15042 states and 15537 transitions. Word has length 633 [2025-03-16 15:11:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:47,159 INFO L471 AbstractCegarLoop]: Abstraction has 15042 states and 15537 transitions. [2025-03-16 15:11:47,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 15042 states and 15537 transitions. [2025-03-16 15:11:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2025-03-16 15:11:47,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:47,168 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:47,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:11:47,168 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:47,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1401583757, now seen corresponding path program 1 times [2025-03-16 15:11:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:47,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180974609] [2025-03-16 15:11:47,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:47,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:47,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-03-16 15:11:47,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-03-16 15:11:47,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:47,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-03-16 15:11:47,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180974609] [2025-03-16 15:11:47,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180974609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:47,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:47,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:11:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083718781] [2025-03-16 15:11:47,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:47,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:11:47,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:47,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:11:47,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:11:47,525 INFO L87 Difference]: Start difference. First operand 15042 states and 15537 transitions. Second operand has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:48,534 INFO L93 Difference]: Finished difference Result 33972 states and 35168 transitions. [2025-03-16 15:11:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:11:48,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 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 657 [2025-03-16 15:11:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:48,551 INFO L225 Difference]: With dead ends: 33972 [2025-03-16 15:11:48,551 INFO L226 Difference]: Without dead ends: 18931 [2025-03-16 15:11:48,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:11:48,616 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 700 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:48,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 421 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:11:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18931 states. [2025-03-16 15:11:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18931 to 18034. [2025-03-16 15:11:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18034 states, 18033 states have (on average 1.031165086230799) internal successors, (18595), 18033 states have internal predecessors, (18595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18034 states to 18034 states and 18595 transitions. [2025-03-16 15:11:48,734 INFO L78 Accepts]: Start accepts. Automaton has 18034 states and 18595 transitions. Word has length 657 [2025-03-16 15:11:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:48,735 INFO L471 AbstractCegarLoop]: Abstraction has 18034 states and 18595 transitions. [2025-03-16 15:11:48,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 18034 states and 18595 transitions. [2025-03-16 15:11:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-16 15:11:48,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:48,742 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:48,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:11:48,742 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:48,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:48,742 INFO L85 PathProgramCache]: Analyzing trace with hash 312718635, now seen corresponding path program 1 times [2025-03-16 15:11:48,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:48,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064948783] [2025-03-16 15:11:48,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:48,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-16 15:11:48,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-16 15:11:48,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:48,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-16 15:11:48,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:48,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064948783] [2025-03-16 15:11:48,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064948783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:48,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:48,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132317334] [2025-03-16 15:11:48,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:48,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:48,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:48,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:48,954 INFO L87 Difference]: Start difference. First operand 18034 states and 18595 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:49,530 INFO L93 Difference]: Finished difference Result 36064 states and 37195 transitions. [2025-03-16 15:11:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:49,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 688 [2025-03-16 15:11:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:49,547 INFO L225 Difference]: With dead ends: 36064 [2025-03-16 15:11:49,547 INFO L226 Difference]: Without dead ends: 18330 [2025-03-16 15:11:49,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:49,558 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 434 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:49,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 66 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:11:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18330 states. [2025-03-16 15:11:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18330 to 18030. [2025-03-16 15:11:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18030 states, 18029 states have (on average 1.031005602085529) internal successors, (18588), 18029 states have internal predecessors, (18588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18030 states to 18030 states and 18588 transitions. [2025-03-16 15:11:49,756 INFO L78 Accepts]: Start accepts. Automaton has 18030 states and 18588 transitions. Word has length 688 [2025-03-16 15:11:49,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:49,756 INFO L471 AbstractCegarLoop]: Abstraction has 18030 states and 18588 transitions. [2025-03-16 15:11:49,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 18030 states and 18588 transitions. [2025-03-16 15:11:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2025-03-16 15:11:49,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:49,766 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:49,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:11:49,766 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:49,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:49,767 INFO L85 PathProgramCache]: Analyzing trace with hash 192800632, now seen corresponding path program 1 times [2025-03-16 15:11:49,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:49,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947786604] [2025-03-16 15:11:49,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:49,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:49,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 759 statements into 1 equivalence classes. [2025-03-16 15:11:49,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 759 of 759 statements. [2025-03-16 15:11:49,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:49,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2025-03-16 15:11:50,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:50,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947786604] [2025-03-16 15:11:50,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947786604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:50,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:50,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780834709] [2025-03-16 15:11:50,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:50,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:50,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:50,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:50,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:50,019 INFO L87 Difference]: Start difference. First operand 18030 states and 18588 transitions. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:50,700 INFO L93 Difference]: Finished difference Result 38448 states and 39674 transitions. [2025-03-16 15:11:50,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:50,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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 759 [2025-03-16 15:11:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:50,720 INFO L225 Difference]: With dead ends: 38448 [2025-03-16 15:11:50,720 INFO L226 Difference]: Without dead ends: 20718 [2025-03-16 15:11:50,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:50,731 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 183 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:50,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 161 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:11:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20718 states. [2025-03-16 15:11:50,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20718 to 19522. [2025-03-16 15:11:50,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19522 states, 19521 states have (on average 1.0284821474309718) internal successors, (20077), 19521 states have internal predecessors, (20077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19522 states to 19522 states and 20077 transitions. [2025-03-16 15:11:50,953 INFO L78 Accepts]: Start accepts. Automaton has 19522 states and 20077 transitions. Word has length 759 [2025-03-16 15:11:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:50,954 INFO L471 AbstractCegarLoop]: Abstraction has 19522 states and 20077 transitions. [2025-03-16 15:11:50,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 19522 states and 20077 transitions. [2025-03-16 15:11:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-03-16 15:11:50,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:50,964 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:50,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:11:50,964 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:50,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:50,965 INFO L85 PathProgramCache]: Analyzing trace with hash 950643321, now seen corresponding path program 1 times [2025-03-16 15:11:50,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:50,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048130433] [2025-03-16 15:11:50,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:50,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:51,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-03-16 15:11:51,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-03-16 15:11:51,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:51,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-03-16 15:11:51,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:51,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048130433] [2025-03-16 15:11:51,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048130433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:51,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:51,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:51,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678362396] [2025-03-16 15:11:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:51,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:51,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:51,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:51,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:51,190 INFO L87 Difference]: Start difference. First operand 19522 states and 20077 transitions. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:51,808 INFO L93 Difference]: Finished difference Result 41432 states and 42654 transitions. [2025-03-16 15:11:51,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:51,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 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 780 [2025-03-16 15:11:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:51,828 INFO L225 Difference]: With dead ends: 41432 [2025-03-16 15:11:51,828 INFO L226 Difference]: Without dead ends: 21911 [2025-03-16 15:11:51,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:51,839 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 163 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:51,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 458 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:11:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21911 states. [2025-03-16 15:11:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21911 to 17123. [2025-03-16 15:11:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17123 states, 17122 states have (on average 1.0263987851886462) internal successors, (17574), 17122 states have internal predecessors, (17574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:51,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17123 states to 17123 states and 17574 transitions. [2025-03-16 15:11:51,984 INFO L78 Accepts]: Start accepts. Automaton has 17123 states and 17574 transitions. Word has length 780 [2025-03-16 15:11:51,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:51,984 INFO L471 AbstractCegarLoop]: Abstraction has 17123 states and 17574 transitions. [2025-03-16 15:11:51,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 17123 states and 17574 transitions. [2025-03-16 15:11:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-03-16 15:11:51,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:51,994 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:11:51,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:51,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash -833998268, now seen corresponding path program 1 times [2025-03-16 15:11:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:51,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070370438] [2025-03-16 15:11:51,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:52,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-03-16 15:11:52,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-03-16 15:11:52,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:52,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2025-03-16 15:11:52,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:52,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070370438] [2025-03-16 15:11:52,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070370438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:52,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:52,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929426941] [2025-03-16 15:11:52,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:52,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:52,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:52,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:52,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:52,456 INFO L87 Difference]: Start difference. First operand 17123 states and 17574 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:53,122 INFO L93 Difference]: Finished difference Result 36038 states and 37015 transitions. [2025-03-16 15:11:53,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:53,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 817 [2025-03-16 15:11:53,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:53,140 INFO L225 Difference]: With dead ends: 36038 [2025-03-16 15:11:53,140 INFO L226 Difference]: Without dead ends: 19215 [2025-03-16 15:11:53,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:53,152 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 310 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:53,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 502 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:11:53,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19215 states. [2025-03-16 15:11:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19215 to 18019. [2025-03-16 15:11:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18019 states, 18018 states have (on average 1.0254190254190254) internal successors, (18476), 18018 states have internal predecessors, (18476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18019 states to 18019 states and 18476 transitions. [2025-03-16 15:11:53,337 INFO L78 Accepts]: Start accepts. Automaton has 18019 states and 18476 transitions. Word has length 817 [2025-03-16 15:11:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:53,337 INFO L471 AbstractCegarLoop]: Abstraction has 18019 states and 18476 transitions. [2025-03-16 15:11:53,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 18019 states and 18476 transitions. [2025-03-16 15:11:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-03-16 15:11:53,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:53,346 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:53,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:11:53,346 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:53,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:53,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1398279709, now seen corresponding path program 1 times [2025-03-16 15:11:53,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:53,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348316821] [2025-03-16 15:11:53,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:53,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-03-16 15:11:53,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-03-16 15:11:53,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:53,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 581 proven. 269 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-16 15:11:54,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:54,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348316821] [2025-03-16 15:11:54,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348316821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:54,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961036240] [2025-03-16 15:11:54,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:54,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:54,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:54,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:11:54,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:11:54,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-03-16 15:11:54,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-03-16 15:11:54,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:54,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:54,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:11:54,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2025-03-16 15:11:54,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:11:54,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961036240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:54,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:11:54,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:11:54,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674233777] [2025-03-16 15:11:54,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:54,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:54,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:54,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:54,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:11:54,479 INFO L87 Difference]: Start difference. First operand 18019 states and 18476 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-16 15:11:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:55,303 INFO L93 Difference]: Finished difference Result 39938 states and 40942 transitions. [2025-03-16 15:11:55,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:55,304 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 838 [2025-03-16 15:11:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:55,323 INFO L225 Difference]: With dead ends: 39938 [2025-03-16 15:11:55,323 INFO L226 Difference]: Without dead ends: 21920 [2025-03-16 15:11:55,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:11:55,330 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 295 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:55,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 491 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:11:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21920 states. [2025-03-16 15:11:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21920 to 19817. [2025-03-16 15:11:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19817 states, 19816 states have (on average 1.0251312071053693) internal successors, (20314), 19816 states have internal predecessors, (20314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19817 states to 19817 states and 20314 transitions. [2025-03-16 15:11:55,479 INFO L78 Accepts]: Start accepts. Automaton has 19817 states and 20314 transitions. Word has length 838 [2025-03-16 15:11:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:55,480 INFO L471 AbstractCegarLoop]: Abstraction has 19817 states and 20314 transitions. [2025-03-16 15:11:55,480 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-16 15:11:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 19817 states and 20314 transitions. [2025-03-16 15:11:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2025-03-16 15:11:55,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:55,488 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:55,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:11:55,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:55,689 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:55,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1957676086, now seen corresponding path program 1 times [2025-03-16 15:11:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:55,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813829284] [2025-03-16 15:11:55,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:55,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:55,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 875 statements into 1 equivalence classes. [2025-03-16 15:11:55,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 875 of 875 statements. [2025-03-16 15:11:55,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:55,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 655 proven. 269 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-16 15:11:56,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813829284] [2025-03-16 15:11:56,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813829284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758251469] [2025-03-16 15:11:56,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:56,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:56,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:56,634 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:11:56,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:11:56,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 875 statements into 1 equivalence classes. [2025-03-16 15:11:56,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 875 of 875 statements. [2025-03-16 15:11:56,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:56,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:56,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:11:56,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-03-16 15:11:56,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:11:56,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758251469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:56,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:11:56,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:11:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757493521] [2025-03-16 15:11:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:56,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:56,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:56,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:56,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:11:56,966 INFO L87 Difference]: Start difference. First operand 19817 states and 20314 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-16 15:11:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:57,715 INFO L93 Difference]: Finished difference Result 35114 states and 35921 transitions. [2025-03-16 15:11:57,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:57,715 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 875 [2025-03-16 15:11:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:57,716 INFO L225 Difference]: With dead ends: 35114 [2025-03-16 15:11:57,716 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:11:57,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:11:57,729 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 290 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:57,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 391 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:11:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:11:57,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:11:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:57,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:11:57,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 875 [2025-03-16 15:11:57,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:57,730 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:11:57,730 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-16 15:11:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:11:57,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:11:57,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:11:57,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:11:57,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 15:11:57,937 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:57,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:11:59,807 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:11:59,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:11:59 BoogieIcfgContainer [2025-03-16 15:11:59,832 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:11:59,833 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:11:59,833 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:11:59,833 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:11:59,834 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:18" (3/4) ... [2025-03-16 15:11:59,835 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:11:59,862 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-16 15:11:59,863 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:11:59,865 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:11:59,866 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:11:59,992 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:11:59,992 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:11:59,992 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:11:59,993 INFO L158 Benchmark]: Toolchain (without parser) took 44467.82ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 129.2MB in the beginning and 130.1MB in the end (delta: -886.0kB). Peak memory consumption was 301.7MB. Max. memory is 16.1GB. [2025-03-16 15:11:59,993 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:11:59,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.84ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 56.3MB in the end (delta: 73.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-16 15:11:59,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 167.99ms. Allocated memory is still 167.8MB. Free memory was 56.3MB in the beginning and 97.3MB in the end (delta: -41.0MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2025-03-16 15:11:59,996 INFO L158 Benchmark]: Boogie Preprocessor took 235.94ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 100.4MB in the end (delta: -3.1MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2025-03-16 15:11:59,996 INFO L158 Benchmark]: IcfgBuilder took 2056.47ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 99.5MB in the beginning and 104.9MB in the end (delta: -5.3MB). Peak memory consumption was 155.6MB. Max. memory is 16.1GB. [2025-03-16 15:11:59,996 INFO L158 Benchmark]: TraceAbstraction took 41235.58ms. Allocated memory was 310.4MB in the beginning and 478.2MB in the end (delta: 167.8MB). Free memory was 104.9MB in the beginning and 151.0MB in the end (delta: -46.1MB). Peak memory consumption was 211.1MB. Max. memory is 16.1GB. [2025-03-16 15:11:59,996 INFO L158 Benchmark]: Witness Printer took 159.45ms. Allocated memory is still 478.2MB. Free memory was 151.0MB in the beginning and 130.1MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:11:59,997 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.84ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 56.3MB in the end (delta: 73.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 167.99ms. Allocated memory is still 167.8MB. Free memory was 56.3MB in the beginning and 97.3MB in the end (delta: -41.0MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 235.94ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 100.4MB in the end (delta: -3.1MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * IcfgBuilder took 2056.47ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 99.5MB in the beginning and 104.9MB in the end (delta: -5.3MB). Peak memory consumption was 155.6MB. Max. memory is 16.1GB. * TraceAbstraction took 41235.58ms. Allocated memory was 310.4MB in the beginning and 478.2MB in the end (delta: 167.8MB). Free memory was 104.9MB in the beginning and 151.0MB in the end (delta: -46.1MB). Peak memory consumption was 211.1MB. Max. memory is 16.1GB. * Witness Printer took 159.45ms. Allocated memory is still 478.2MB. Free memory was 151.0MB in the beginning and 130.1MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 116]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 363 locations, 688 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.3s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9646 SdHoareTripleChecker+Valid, 23.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9646 mSDsluCounter, 9781 SdHoareTripleChecker+Invalid, 19.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 919 mSDsCounter, 4131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25259 IncrementalHoareTripleChecker+Invalid, 29390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4131 mSolverCounterUnsat, 8862 mSDtfsCounter, 25259 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4088 GetRequests, 4037 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19817occurred in iteration=22, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 20418 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 14143 NumberOfCodeBlocks, 14143 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 14710 ConstructedInterpolants, 0 QuantifiedInterpolants, 49396 SizeOfPredicates, 5 NumberOfNonLiveVariables, 4127 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 29 InterpolantComputations, 22 PerfectInterpolantSequences, 16168/16901 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (3 == a2)) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || (((((((long long) a0 + 105) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (5 <= a2)) && (0 <= ((long long) a29 + 13)))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || ((((long long) 42 + a4) <= 0) && ((((0 <= ((long long) a4 + 85)) && (a2 == 1)) && (a29 <= 401234)) || (((a2 == 1) && (a29 <= 401234)) && (((long long) a0 + 61) <= 0))))) || (((((long long) 98 + a0) <= 0) && (0 <= ((long long) 146 + a0))) && ((((((long long) a0 + 105) <= 0) && (((long long) 42 + a4) <= 0)) && (5 <= a2)) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (5 <= a2))))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) a29 + 13)))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || (((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 1))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((long long) 89 + a4) <= 0) && (3 == a2))) || (((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (a2 == 4))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (5 <= a2)) && (0 <= ((long long) a29 + 13))) && (((long long) a0 + 61) <= 0))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (((long long) a29 + 127) == 0))) || (((((long long) a0 + 105) <= 0) && (2 == a2)) && (44 <= a29))) || ((((long long) 89 + a4) <= 0) && (a2 == 4))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:12:00,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE