./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label54.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/Problem18_label54.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 a6fe2492e6625b8197ec02c92b2531b1f71f91a1bb5aa875b34eccb40967800d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:26:34,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:26:34,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:26:34,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:26:34,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:26:34,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:26:34,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:26:34,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:26:34,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:26:34,572 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:26:34,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:26:34,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:26:34,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:26:34,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:26:34,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:26:34,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:26:34,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:26:34,573 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:26:34,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:26:34,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:26:34,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:26:34,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:26:34,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:26:34,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:26:34,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:26:34,574 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 -> a6fe2492e6625b8197ec02c92b2531b1f71f91a1bb5aa875b34eccb40967800d [2025-03-16 15:26:34,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:26:34,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:26:34,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:26:34,814 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:26:34,814 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:26:34,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label54.c [2025-03-16 15:26:35,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b3acc1b/da899e990bec4f5b8589f542a3c258cd/FLAGb13ea924e [2025-03-16 15:26:36,347 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:26:36,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label54.c [2025-03-16 15:26:36,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b3acc1b/da899e990bec4f5b8589f542a3c258cd/FLAGb13ea924e [2025-03-16 15:26:36,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b3acc1b/da899e990bec4f5b8589f542a3c258cd [2025-03-16 15:26:36,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:26:36,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:26:36,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:26:36,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:26:36,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:26:36,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:26:36" (1/1) ... [2025-03-16 15:26:36,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58044d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:36, skipping insertion in model container [2025-03-16 15:26:36,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:26:36" (1/1) ... [2025-03-16 15:26:36,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:26:36,616 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/Problem18_label54.c[3783,3796] [2025-03-16 15:26:36,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:26:36,972 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:26:37,000 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/Problem18_label54.c[3783,3796] [2025-03-16 15:26:37,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:26:37,175 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:26:37,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:37 WrapperNode [2025-03-16 15:26:37,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:26:37,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:26:37,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:26:37,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:26:37,181 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:26:37" (1/1) ... [2025-03-16 15:26:37,218 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:26:37" (1/1) ... [2025-03-16 15:26:37,389 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-16 15:26:37,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:26:37,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:26:37,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:26:37,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:26:37,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:37" (1/1) ... [2025-03-16 15:26:37,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:37" (1/1) ... [2025-03-16 15:26:37,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:37" (1/1) ... [2025-03-16 15:26:37,512 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:26:37,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:37" (1/1) ... [2025-03-16 15:26:37,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:37" (1/1) ... [2025-03-16 15:26:37,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:37" (1/1) ... [2025-03-16 15:26:37,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:37" (1/1) ... [2025-03-16 15:26:37,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:37" (1/1) ... [2025-03-16 15:26:37,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:37" (1/1) ... [2025-03-16 15:26:37,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:26:37,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:26:37,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:26:37,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:26:37,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:37" (1/1) ... [2025-03-16 15:26:37,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:26:37,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:26:37,659 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:26:37,662 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:26:37,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:26:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:26:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:26:37,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:26:37,726 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:26:37,727 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:26:40,331 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-16 15:26:40,331 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-16 15:26:40,435 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-16 15:26:40,436 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:26:40,466 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:26:40,467 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:26:40,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:26:40 BoogieIcfgContainer [2025-03-16 15:26:40,468 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:26:40,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:26:40,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:26:40,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:26:40,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:26:36" (1/3) ... [2025-03-16 15:26:40,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66249d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:26:40, skipping insertion in model container [2025-03-16 15:26:40,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:26:37" (2/3) ... [2025-03-16 15:26:40,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66249d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:26:40, skipping insertion in model container [2025-03-16 15:26:40,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:26:40" (3/3) ... [2025-03-16 15:26:40,476 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label54.c [2025-03-16 15:26:40,487 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:26:40,488 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label54.c that has 1 procedures, 696 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:26:40,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:26:40,560 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;@65e4ec5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:26:40,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:26:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states 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:26:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 15:26:40,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:40,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:26:40,571 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:40,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:40,575 INFO L85 PathProgramCache]: Analyzing trace with hash 816150662, now seen corresponding path program 1 times [2025-03-16 15:26:40,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:40,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238561094] [2025-03-16 15:26:40,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:40,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:40,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 15:26:40,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 15:26:40,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:40,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:40,682 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:26:40,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:40,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238561094] [2025-03-16 15:26:40,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238561094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:40,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:40,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:26:40,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715589550] [2025-03-16 15:26:40,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:40,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:26:40,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:40,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:26:40,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:26:40,707 INFO L87 Difference]: Start difference. First operand has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 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.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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:26:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:40,773 INFO L93 Difference]: Finished difference Result 1391 states and 2763 transitions. [2025-03-16 15:26:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:26:40,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-16 15:26:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:40,786 INFO L225 Difference]: With dead ends: 1391 [2025-03-16 15:26:40,786 INFO L226 Difference]: Without dead ends: 693 [2025-03-16 15:26:40,790 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:26:40,791 INFO L435 NwaCegarLoop]: 1320 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, 1320 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:26:40,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:26:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-16 15:26:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2025-03-16 15:26:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states 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:26:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2025-03-16 15:26:40,855 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 33 [2025-03-16 15:26:40,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:40,855 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2025-03-16 15:26:40,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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:26:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2025-03-16 15:26:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 15:26:40,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:40,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:26:40,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:26:40,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:40,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash 352720963, now seen corresponding path program 1 times [2025-03-16 15:26:40,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:40,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851597311] [2025-03-16 15:26:40,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:40,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:40,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 15:26:40,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 15:26:40,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:40,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:40,982 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:26:40,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:40,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851597311] [2025-03-16 15:26:40,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851597311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:40,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:40,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:26:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564460004] [2025-03-16 15:26:40,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:40,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:26:40,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:40,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:26:40,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:26:40,984 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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:26:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:43,185 INFO L93 Difference]: Finished difference Result 2075 states and 3948 transitions. [2025-03-16 15:26:43,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:26:43,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-16 15:26:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:43,190 INFO L225 Difference]: With dead ends: 2075 [2025-03-16 15:26:43,190 INFO L226 Difference]: Without dead ends: 1383 [2025-03-16 15:26:43,192 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:26:43,192 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 681 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 2642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:43,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 364 Invalid, 2642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:26:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-03-16 15:26:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2025-03-16 15:26:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.6519536903039074) internal successors, (2283), 1382 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states 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:26:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2283 transitions. [2025-03-16 15:26:43,232 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2283 transitions. Word has length 33 [2025-03-16 15:26:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:43,233 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2283 transitions. [2025-03-16 15:26:43,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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:26:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2283 transitions. [2025-03-16 15:26:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 15:26:43,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:43,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:43,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:26:43,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:43,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 985192853, now seen corresponding path program 1 times [2025-03-16 15:26:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:43,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544078030] [2025-03-16 15:26:43,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:43,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 15:26:43,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 15:26:43,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:43,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:26:43,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:43,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544078030] [2025-03-16 15:26:43,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544078030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:43,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:43,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:26:43,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949170899] [2025-03-16 15:26:43,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:43,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:26:43,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:43,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:26:43,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:26:43,388 INFO L87 Difference]: Start difference. First operand 1383 states and 2283 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:26:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:45,450 INFO L93 Difference]: Finished difference Result 4145 states and 6846 transitions. [2025-03-16 15:26:45,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:26:45,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-16 15:26:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:45,460 INFO L225 Difference]: With dead ends: 4145 [2025-03-16 15:26:45,460 INFO L226 Difference]: Without dead ends: 2763 [2025-03-16 15:26:45,462 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:26:45,462 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 712 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:45,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 530 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:26:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-16 15:26:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2025-03-16 15:26:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.4047791455467054) internal successors, (3880), 2762 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states 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:26:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3880 transitions. [2025-03-16 15:26:45,512 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 3880 transitions. Word has length 99 [2025-03-16 15:26:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:45,513 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 3880 transitions. [2025-03-16 15:26:45,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:26:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3880 transitions. [2025-03-16 15:26:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 15:26:45,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:45,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:45,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:26:45,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:45,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:45,515 INFO L85 PathProgramCache]: Analyzing trace with hash -163634927, now seen corresponding path program 1 times [2025-03-16 15:26:45,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:45,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766160434] [2025-03-16 15:26:45,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:45,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 15:26:45,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 15:26:45,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:45,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:26:45,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:45,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766160434] [2025-03-16 15:26:45,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766160434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:45,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:45,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:26:45,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797388128] [2025-03-16 15:26:45,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:45,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:26:45,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:45,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:26:45,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:26:45,647 INFO L87 Difference]: Start difference. First operand 2763 states and 3880 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:26:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:47,598 INFO L93 Difference]: Finished difference Result 8285 states and 11637 transitions. [2025-03-16 15:26:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:26:47,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-16 15:26:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:47,616 INFO L225 Difference]: With dead ends: 8285 [2025-03-16 15:26:47,616 INFO L226 Difference]: Without dead ends: 5523 [2025-03-16 15:26:47,621 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:26:47,621 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 707 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:47,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 434 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:26:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2025-03-16 15:26:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 4833. [2025-03-16 15:26:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4833 states, 4832 states have (on average 1.2971854304635762) internal successors, (6268), 4832 states have internal predecessors, (6268), 0 states have call successors, (0), 0 states 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:26:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4833 states to 4833 states and 6268 transitions. [2025-03-16 15:26:47,691 INFO L78 Accepts]: Start accepts. Automaton has 4833 states and 6268 transitions. Word has length 100 [2025-03-16 15:26:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:47,691 INFO L471 AbstractCegarLoop]: Abstraction has 4833 states and 6268 transitions. [2025-03-16 15:26:47,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:26:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4833 states and 6268 transitions. [2025-03-16 15:26:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-16 15:26:47,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:47,694 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:26:47,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:26:47,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:47,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:47,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1243942372, now seen corresponding path program 1 times [2025-03-16 15:26:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:47,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461921365] [2025-03-16 15:26:47,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:47,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-16 15:26:47,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-16 15:26:47,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:47,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-16 15:26:48,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:48,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461921365] [2025-03-16 15:26:48,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461921365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:48,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:48,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:26:48,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622614125] [2025-03-16 15:26:48,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:48,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:26:48,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:48,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:26:48,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:26:48,192 INFO L87 Difference]: Start difference. First operand 4833 states and 6268 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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:26:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:50,681 INFO L93 Difference]: Finished difference Result 12425 states and 15643 transitions. [2025-03-16 15:26:50,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:26:50,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 220 [2025-03-16 15:26:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:50,697 INFO L225 Difference]: With dead ends: 12425 [2025-03-16 15:26:50,697 INFO L226 Difference]: Without dead ends: 7593 [2025-03-16 15:26:50,702 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:26:50,704 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 1872 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:50,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1872 Valid, 640 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:26:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7593 states. [2025-03-16 15:26:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7593 to 6903. [2025-03-16 15:26:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6903 states, 6902 states have (on average 1.2358736598087512) internal successors, (8530), 6902 states have internal predecessors, (8530), 0 states have call successors, (0), 0 states 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:26:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 8530 transitions. [2025-03-16 15:26:50,799 INFO L78 Accepts]: Start accepts. Automaton has 6903 states and 8530 transitions. Word has length 220 [2025-03-16 15:26:50,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:50,800 INFO L471 AbstractCegarLoop]: Abstraction has 6903 states and 8530 transitions. [2025-03-16 15:26:50,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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:26:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 6903 states and 8530 transitions. [2025-03-16 15:26:50,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-16 15:26:50,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:50,804 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:50,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:26:50,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:50,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash -501519636, now seen corresponding path program 1 times [2025-03-16 15:26:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480636321] [2025-03-16 15:26:50,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:50,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-16 15:26:50,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-16 15:26:50,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:50,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-16 15:26:51,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:51,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480636321] [2025-03-16 15:26:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480636321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:51,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:26:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586171882] [2025-03-16 15:26:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:51,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:26:51,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:51,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:26:51,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:26:51,242 INFO L87 Difference]: Start difference. First operand 6903 states and 8530 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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:26:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:53,096 INFO L93 Difference]: Finished difference Result 15238 states and 18534 transitions. [2025-03-16 15:26:53,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:26:53,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 402 [2025-03-16 15:26:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:53,115 INFO L225 Difference]: With dead ends: 15238 [2025-03-16 15:26:53,115 INFO L226 Difference]: Without dead ends: 8283 [2025-03-16 15:26:53,119 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:26:53,120 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:53,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 638 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:26:53,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8283 states. [2025-03-16 15:26:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 8283. [2025-03-16 15:26:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8283 states, 8282 states have (on average 1.15431055300652) internal successors, (9560), 8282 states have internal predecessors, (9560), 0 states have call successors, (0), 0 states 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:26:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 9560 transitions. [2025-03-16 15:26:53,224 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 9560 transitions. Word has length 402 [2025-03-16 15:26:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:53,224 INFO L471 AbstractCegarLoop]: Abstraction has 8283 states and 9560 transitions. [2025-03-16 15:26:53,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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:26:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 9560 transitions. [2025-03-16 15:26:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-16 15:26:53,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:53,232 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:26:53,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:26:53,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:53,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1031289650, now seen corresponding path program 1 times [2025-03-16 15:26:53,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:53,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357111930] [2025-03-16 15:26:53,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:53,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-16 15:26:53,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-16 15:26:53,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:53,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 15:26:53,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:53,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357111930] [2025-03-16 15:26:53,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357111930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:53,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:53,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:26:53,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000420740] [2025-03-16 15:26:53,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:53,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:26:53,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:53,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:26:53,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:26:53,523 INFO L87 Difference]: Start difference. First operand 8283 states and 9560 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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:26:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:55,078 INFO L93 Difference]: Finished difference Result 20015 states and 22948 transitions. [2025-03-16 15:26:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:26:55,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 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 417 [2025-03-16 15:26:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:55,098 INFO L225 Difference]: With dead ends: 20015 [2025-03-16 15:26:55,098 INFO L226 Difference]: Without dead ends: 11733 [2025-03-16 15:26:55,105 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:26:55,106 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:55,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 76 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:26:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11733 states. [2025-03-16 15:26:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11733 to 11733. [2025-03-16 15:26:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11733 states, 11732 states have (on average 1.1191612683259462) internal successors, (13130), 11732 states have internal predecessors, (13130), 0 states have call successors, (0), 0 states 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:26:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11733 states to 11733 states and 13130 transitions. [2025-03-16 15:26:55,219 INFO L78 Accepts]: Start accepts. Automaton has 11733 states and 13130 transitions. Word has length 417 [2025-03-16 15:26:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:55,220 INFO L471 AbstractCegarLoop]: Abstraction has 11733 states and 13130 transitions. [2025-03-16 15:26:55,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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:26:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 11733 states and 13130 transitions. [2025-03-16 15:26:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-03-16 15:26:55,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:55,225 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:26:55,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:26:55,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:55,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:55,226 INFO L85 PathProgramCache]: Analyzing trace with hash -660814278, now seen corresponding path program 1 times [2025-03-16 15:26:55,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:55,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849366660] [2025-03-16 15:26:55,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:55,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:55,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-16 15:26:55,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-16 15:26:55,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:55,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:26:55,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:55,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849366660] [2025-03-16 15:26:55,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849366660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:55,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:55,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:26:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575436975] [2025-03-16 15:26:55,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:55,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:26:55,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:55,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:26:55,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:26:55,672 INFO L87 Difference]: Start difference. First operand 11733 states and 13130 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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:26:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:57,264 INFO L93 Difference]: Finished difference Result 32435 states and 36565 transitions. [2025-03-16 15:26:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:26:57,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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 425 [2025-03-16 15:26:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:57,293 INFO L225 Difference]: With dead ends: 32435 [2025-03-16 15:26:57,293 INFO L226 Difference]: Without dead ends: 20703 [2025-03-16 15:26:57,300 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:26:57,301 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 600 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:57,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 977 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:26:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20703 states. [2025-03-16 15:26:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20703 to 20013. [2025-03-16 15:26:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20013 states, 20012 states have (on average 1.0955426743953627) internal successors, (21924), 20012 states have internal predecessors, (21924), 0 states have call successors, (0), 0 states 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:26:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20013 states to 20013 states and 21924 transitions. [2025-03-16 15:26:57,462 INFO L78 Accepts]: Start accepts. Automaton has 20013 states and 21924 transitions. Word has length 425 [2025-03-16 15:26:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:57,463 INFO L471 AbstractCegarLoop]: Abstraction has 20013 states and 21924 transitions. [2025-03-16 15:26:57,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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:26:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 20013 states and 21924 transitions. [2025-03-16 15:26:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-16 15:26:57,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:57,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:26:57,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:26:57,469 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:57,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:57,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1478027001, now seen corresponding path program 1 times [2025-03-16 15:26:57,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:57,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122128903] [2025-03-16 15:26:57,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:57,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-16 15:26:57,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-16 15:26:57,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:57,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-16 15:26:57,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122128903] [2025-03-16 15:26:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122128903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:57,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:57,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:26:57,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901072620] [2025-03-16 15:26:57,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:57,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:26:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:57,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:26:57,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:26:57,686 INFO L87 Difference]: Start difference. First operand 20013 states and 21924 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:26:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:59,286 INFO L93 Difference]: Finished difference Result 46235 states and 50983 transitions. [2025-03-16 15:26:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:26:59,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 432 [2025-03-16 15:26:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:59,322 INFO L225 Difference]: With dead ends: 46235 [2025-03-16 15:26:59,322 INFO L226 Difference]: Without dead ends: 22773 [2025-03-16 15:26:59,340 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:26:59,343 INFO L435 NwaCegarLoop]: 1112 mSDtfsCounter, 670 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:59,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1118 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:26:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22773 states. [2025-03-16 15:26:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22773 to 20703. [2025-03-16 15:26:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20703 states, 20702 states have (on average 1.0554052748526712) internal successors, (21849), 20702 states have internal predecessors, (21849), 0 states have call successors, (0), 0 states 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:26:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20703 states to 20703 states and 21849 transitions. [2025-03-16 15:26:59,638 INFO L78 Accepts]: Start accepts. Automaton has 20703 states and 21849 transitions. Word has length 432 [2025-03-16 15:26:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:59,638 INFO L471 AbstractCegarLoop]: Abstraction has 20703 states and 21849 transitions. [2025-03-16 15:26:59,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:26:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 20703 states and 21849 transitions. [2025-03-16 15:26:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-16 15:26:59,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:59,645 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:59,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:26:59,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:59,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash 573174574, now seen corresponding path program 1 times [2025-03-16 15:26:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:59,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653084601] [2025-03-16 15:26:59,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:59,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:59,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-16 15:26:59,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-16 15:26:59,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:59,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-03-16 15:27:00,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:00,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653084601] [2025-03-16 15:27:00,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653084601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:00,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:00,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:00,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540256788] [2025-03-16 15:27:00,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:00,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:00,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:00,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:00,241 INFO L87 Difference]: Start difference. First operand 20703 states and 21849 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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:27:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:01,455 INFO L93 Difference]: Finished difference Result 41405 states and 43697 transitions. [2025-03-16 15:27:01,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:01,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 503 [2025-03-16 15:27:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:01,484 INFO L225 Difference]: With dead ends: 41405 [2025-03-16 15:27:01,484 INFO L226 Difference]: Without dead ends: 20703 [2025-03-16 15:27:01,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:27:01,498 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 763 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:01,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 744 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:27:01,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20703 states. [2025-03-16 15:27:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20703 to 20703. [2025-03-16 15:27:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20703 states, 20702 states have (on average 1.0483528161530287) internal successors, (21703), 20702 states have internal predecessors, (21703), 0 states have call successors, (0), 0 states 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:27:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20703 states to 20703 states and 21703 transitions. [2025-03-16 15:27:01,658 INFO L78 Accepts]: Start accepts. Automaton has 20703 states and 21703 transitions. Word has length 503 [2025-03-16 15:27:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:01,659 INFO L471 AbstractCegarLoop]: Abstraction has 20703 states and 21703 transitions. [2025-03-16 15:27:01,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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:27:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 20703 states and 21703 transitions. [2025-03-16 15:27:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-16 15:27:01,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:01,664 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:01,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:27:01,664 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:01,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1170678545, now seen corresponding path program 1 times [2025-03-16 15:27:01,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:01,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402572358] [2025-03-16 15:27:01,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:01,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:01,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-16 15:27:01,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-16 15:27:01,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:01,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-16 15:27:01,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402572358] [2025-03-16 15:27:01,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402572358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:01,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:01,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:01,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174825370] [2025-03-16 15:27:01,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:01,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:01,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:01,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:01,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:01,923 INFO L87 Difference]: Start difference. First operand 20703 states and 21703 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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:27:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:03,343 INFO L93 Difference]: Finished difference Result 47615 states and 50173 transitions. [2025-03-16 15:27:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:03,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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 575 [2025-03-16 15:27:03,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:03,367 INFO L225 Difference]: With dead ends: 47615 [2025-03-16 15:27:03,367 INFO L226 Difference]: Without dead ends: 26913 [2025-03-16 15:27:03,379 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:27:03,381 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 602 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1814 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:03,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 290 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1814 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:27:03,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26913 states. [2025-03-16 15:27:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26913 to 26223. [2025-03-16 15:27:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26223 states, 26222 states have (on average 1.0464495461825947) internal successors, (27440), 26222 states have internal predecessors, (27440), 0 states have call successors, (0), 0 states 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:27:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26223 states to 26223 states and 27440 transitions. [2025-03-16 15:27:03,648 INFO L78 Accepts]: Start accepts. Automaton has 26223 states and 27440 transitions. Word has length 575 [2025-03-16 15:27:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:03,649 INFO L471 AbstractCegarLoop]: Abstraction has 26223 states and 27440 transitions. [2025-03-16 15:27:03,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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:27:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 26223 states and 27440 transitions. [2025-03-16 15:27:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1092 [2025-03-16 15:27:03,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:03,658 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:03,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:27:03,659 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:03,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:03,659 INFO L85 PathProgramCache]: Analyzing trace with hash 954377214, now seen corresponding path program 1 times [2025-03-16 15:27:03,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:03,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062668133] [2025-03-16 15:27:03,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:03,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:03,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1091 statements into 1 equivalence classes. [2025-03-16 15:27:03,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1091 of 1091 statements. [2025-03-16 15:27:03,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:03,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2025-03-16 15:27:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:04,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062668133] [2025-03-16 15:27:04,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062668133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:04,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:04,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:04,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798905587] [2025-03-16 15:27:04,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:04,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:04,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:04,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:04,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:04,219 INFO L87 Difference]: Start difference. First operand 26223 states and 27440 transitions. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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:27:05,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:05,697 INFO L93 Difference]: Finished difference Result 60725 states and 63787 transitions. [2025-03-16 15:27:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:05,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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 1091 [2025-03-16 15:27:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:05,739 INFO L225 Difference]: With dead ends: 60725 [2025-03-16 15:27:05,739 INFO L226 Difference]: Without dead ends: 34503 [2025-03-16 15:27:05,760 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:27:05,761 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 603 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:05,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 969 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:27:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34503 states. [2025-03-16 15:27:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34503 to 33813. [2025-03-16 15:27:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33813 states, 33812 states have (on average 1.0443629480657755) internal successors, (35312), 33812 states have internal predecessors, (35312), 0 states have call successors, (0), 0 states 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:27:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33813 states to 33813 states and 35312 transitions. [2025-03-16 15:27:06,047 INFO L78 Accepts]: Start accepts. Automaton has 33813 states and 35312 transitions. Word has length 1091 [2025-03-16 15:27:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:06,048 INFO L471 AbstractCegarLoop]: Abstraction has 33813 states and 35312 transitions. [2025-03-16 15:27:06,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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:27:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 33813 states and 35312 transitions. [2025-03-16 15:27:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2025-03-16 15:27:06,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:06,058 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:06,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:27:06,058 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:06,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1549781969, now seen corresponding path program 1 times [2025-03-16 15:27:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:06,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94671951] [2025-03-16 15:27:06,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:06,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:06,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1102 statements into 1 equivalence classes. [2025-03-16 15:27:06,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1102 of 1102 statements. [2025-03-16 15:27:06,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:06,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 520 proven. 612 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-16 15:27:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94671951] [2025-03-16 15:27:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94671951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:27:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794909548] [2025-03-16 15:27:07,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:07,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:27:07,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:27:07,187 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:27:07,189 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:27:07,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1102 statements into 1 equivalence classes. [2025-03-16 15:27:07,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1102 of 1102 statements. [2025-03-16 15:27:07,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:07,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:07,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:27:07,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:27:07,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-16 15:27:07,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:27:07,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794909548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:07,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:27:07,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-16 15:27:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953510504] [2025-03-16 15:27:07,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:07,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:07,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:07,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:07,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:27:07,570 INFO L87 Difference]: Start difference. First operand 33813 states and 35312 transitions. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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:27:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:08,937 INFO L93 Difference]: Finished difference Result 77975 states and 81912 transitions. [2025-03-16 15:27:08,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:08,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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 1102 [2025-03-16 15:27:08,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:08,977 INFO L225 Difference]: With dead ends: 77975 [2025-03-16 15:27:08,977 INFO L226 Difference]: Without dead ends: 44163 [2025-03-16 15:27:08,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:27:08,996 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 664 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:08,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 117 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:27:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44163 states. [2025-03-16 15:27:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44163 to 44163. [2025-03-16 15:27:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44163 states, 44162 states have (on average 1.043476291834609) internal successors, (46082), 44162 states have internal predecessors, (46082), 0 states have call successors, (0), 0 states 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:27:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44163 states to 44163 states and 46082 transitions. [2025-03-16 15:27:09,308 INFO L78 Accepts]: Start accepts. Automaton has 44163 states and 46082 transitions. Word has length 1102 [2025-03-16 15:27:09,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:09,309 INFO L471 AbstractCegarLoop]: Abstraction has 44163 states and 46082 transitions. [2025-03-16 15:27:09,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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:27:09,309 INFO L276 IsEmpty]: Start isEmpty. Operand 44163 states and 46082 transitions. [2025-03-16 15:27:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2025-03-16 15:27:09,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:09,318 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:09,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:27:09,518 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,SelfDestructingSolverStorable12 [2025-03-16 15:27:09,518 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:09,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash -323220862, now seen corresponding path program 1 times [2025-03-16 15:27:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792619575] [2025-03-16 15:27:09,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:09,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1108 statements into 1 equivalence classes. [2025-03-16 15:27:09,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1108 of 1108 statements. [2025-03-16 15:27:09,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:09,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 420 proven. 555 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2025-03-16 15:27:10,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:10,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792619575] [2025-03-16 15:27:10,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792619575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:27:10,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266309726] [2025-03-16 15:27:10,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:10,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:27:10,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:27:10,747 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:27:10,749 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:27:10,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1108 statements into 1 equivalence classes. [2025-03-16 15:27:10,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1108 of 1108 statements. [2025-03-16 15:27:10,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:10,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:10,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:27:10,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:27:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-16 15:27:11,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:27:11,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266309726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:11,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:27:11,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:27:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216472475] [2025-03-16 15:27:11,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:11,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:11,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:11,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:11,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:27:11,070 INFO L87 Difference]: Start difference. First operand 44163 states and 46082 transitions. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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:27:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:12,440 INFO L93 Difference]: Finished difference Result 100055 states and 104890 transitions. [2025-03-16 15:27:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:12,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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 1108 [2025-03-16 15:27:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:12,495 INFO L225 Difference]: With dead ends: 100055 [2025-03-16 15:27:12,495 INFO L226 Difference]: Without dead ends: 52443 [2025-03-16 15:27:12,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 1108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:27:12,524 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 625 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:12,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 871 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:27:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52443 states. [2025-03-16 15:27:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52443 to 52443. [2025-03-16 15:27:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52443 states, 52442 states have (on average 1.0451546470386333) internal successors, (54810), 52442 states have internal predecessors, (54810), 0 states have call successors, (0), 0 states 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:27:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52443 states to 52443 states and 54810 transitions. [2025-03-16 15:27:12,977 INFO L78 Accepts]: Start accepts. Automaton has 52443 states and 54810 transitions. Word has length 1108 [2025-03-16 15:27:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:12,978 INFO L471 AbstractCegarLoop]: Abstraction has 52443 states and 54810 transitions. [2025-03-16 15:27:12,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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:27:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 52443 states and 54810 transitions. [2025-03-16 15:27:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1225 [2025-03-16 15:27:12,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:12,991 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:27:12,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:27:13,192 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:27:13,192 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:13,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1891585605, now seen corresponding path program 1 times [2025-03-16 15:27:13,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:13,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579848697] [2025-03-16 15:27:13,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:13,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:13,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1224 statements into 1 equivalence classes. [2025-03-16 15:27:13,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1224 of 1224 statements. [2025-03-16 15:27:13,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:13,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 1516 trivial. 0 not checked. [2025-03-16 15:27:13,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:13,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579848697] [2025-03-16 15:27:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579848697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:13,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:13,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:13,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930539285] [2025-03-16 15:27:13,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:13,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:13,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:13,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:13,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:13,783 INFO L87 Difference]: Start difference. First operand 52443 states and 54810 transitions. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states 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:27:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:14,587 INFO L93 Difference]: Finished difference Result 104217 states and 108950 transitions. [2025-03-16 15:27:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:14,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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 1224 [2025-03-16 15:27:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:14,639 INFO L225 Difference]: With dead ends: 104217 [2025-03-16 15:27:14,639 INFO L226 Difference]: Without dead ends: 52443 [2025-03-16 15:27:14,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:14,667 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:14,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 984 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:27:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52443 states. [2025-03-16 15:27:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52443 to 52443. [2025-03-16 15:27:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52443 states, 52442 states have (on average 1.0450783722970138) internal successors, (54806), 52442 states have internal predecessors, (54806), 0 states have call successors, (0), 0 states 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:27:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52443 states to 52443 states and 54806 transitions. [2025-03-16 15:27:15,086 INFO L78 Accepts]: Start accepts. Automaton has 52443 states and 54806 transitions. Word has length 1224 [2025-03-16 15:27:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:15,087 INFO L471 AbstractCegarLoop]: Abstraction has 52443 states and 54806 transitions. [2025-03-16 15:27:15,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states 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:27:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 52443 states and 54806 transitions. [2025-03-16 15:27:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1342 [2025-03-16 15:27:15,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:15,109 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:15,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:27:15,110 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -323499201, now seen corresponding path program 1 times [2025-03-16 15:27:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017360708] [2025-03-16 15:27:15,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:15,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1341 statements into 1 equivalence classes. [2025-03-16 15:27:15,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1341 of 1341 statements. [2025-03-16 15:27:15,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:15,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 1226 proven. 0 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2025-03-16 15:27:15,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:15,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017360708] [2025-03-16 15:27:15,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017360708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:15,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:15,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:15,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041605477] [2025-03-16 15:27:15,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:15,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:15,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:15,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:15,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:15,668 INFO L87 Difference]: Start difference. First operand 52443 states and 54806 transitions. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states 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:27:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:17,109 INFO L93 Difference]: Finished difference Result 113855 states and 119445 transitions. [2025-03-16 15:27:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:17,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 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 1341 [2025-03-16 15:27:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:17,177 INFO L225 Difference]: With dead ends: 113855 [2025-03-16 15:27:17,177 INFO L226 Difference]: Without dead ends: 62103 [2025-03-16 15:27:17,210 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:27:17,210 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 455 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:17,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 951 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:27:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62103 states. [2025-03-16 15:27:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62103 to 62103. [2025-03-16 15:27:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62103 states, 62102 states have (on average 1.042655631058581) internal successors, (64751), 62102 states have internal predecessors, (64751), 0 states have call successors, (0), 0 states 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:27:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62103 states to 62103 states and 64751 transitions. [2025-03-16 15:27:17,889 INFO L78 Accepts]: Start accepts. Automaton has 62103 states and 64751 transitions. Word has length 1341 [2025-03-16 15:27:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:17,890 INFO L471 AbstractCegarLoop]: Abstraction has 62103 states and 64751 transitions. [2025-03-16 15:27:17,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states 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:27:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 62103 states and 64751 transitions. [2025-03-16 15:27:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1371 [2025-03-16 15:27:17,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:17,928 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:17,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:27:17,928 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:17,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:17,929 INFO L85 PathProgramCache]: Analyzing trace with hash 51020901, now seen corresponding path program 1 times [2025-03-16 15:27:17,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:17,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129428101] [2025-03-16 15:27:17,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:17,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:18,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1370 statements into 1 equivalence classes. [2025-03-16 15:27:18,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1370 of 1370 statements. [2025-03-16 15:27:18,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:18,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 1444 proven. 0 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2025-03-16 15:27:18,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:18,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129428101] [2025-03-16 15:27:18,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129428101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:18,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:18,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:18,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927718663] [2025-03-16 15:27:18,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:18,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:27:18,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:18,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:27:18,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:27:18,942 INFO L87 Difference]: Start difference. First operand 62103 states and 64751 transitions. Second operand has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states 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:27:20,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:20,902 INFO L93 Difference]: Finished difference Result 123515 states and 128810 transitions. [2025-03-16 15:27:20,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:27:20,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 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 1370 [2025-03-16 15:27:20,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:20,962 INFO L225 Difference]: With dead ends: 123515 [2025-03-16 15:27:20,963 INFO L226 Difference]: Without dead ends: 62103 [2025-03-16 15:27:20,998 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:27:20,998 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 981 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2666 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 2666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:20,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 80 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 2666 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:27:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62103 states. [2025-03-16 15:27:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62103 to 62103. [2025-03-16 15:27:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62103 states, 62102 states have (on average 1.0425107081897524) internal successors, (64742), 62102 states have internal predecessors, (64742), 0 states have call successors, (0), 0 states 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:27:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62103 states to 62103 states and 64742 transitions. [2025-03-16 15:27:21,484 INFO L78 Accepts]: Start accepts. Automaton has 62103 states and 64742 transitions. Word has length 1370 [2025-03-16 15:27:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:21,485 INFO L471 AbstractCegarLoop]: Abstraction has 62103 states and 64742 transitions. [2025-03-16 15:27:21,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states 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:27:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 62103 states and 64742 transitions. [2025-03-16 15:27:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1386 [2025-03-16 15:27:21,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:21,505 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:27:21,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:27:21,506 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:21,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:21,506 INFO L85 PathProgramCache]: Analyzing trace with hash -40413235, now seen corresponding path program 1 times [2025-03-16 15:27:21,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:21,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135043259] [2025-03-16 15:27:21,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:21,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:21,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1385 statements into 1 equivalence classes. [2025-03-16 15:27:21,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1385 of 1385 statements. [2025-03-16 15:27:21,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:21,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2504 backedges. 1600 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2025-03-16 15:27:22,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:22,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135043259] [2025-03-16 15:27:22,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135043259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:22,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:22,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:22,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421808798] [2025-03-16 15:27:22,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:22,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:22,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:22,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:22,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:22,102 INFO L87 Difference]: Start difference. First operand 62103 states and 64742 transitions. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 states 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:27:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:23,388 INFO L93 Difference]: Finished difference Result 123515 states and 128792 transitions. [2025-03-16 15:27:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:23,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 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 1385 [2025-03-16 15:27:23,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:23,452 INFO L225 Difference]: With dead ends: 123515 [2025-03-16 15:27:23,452 INFO L226 Difference]: Without dead ends: 62103 [2025-03-16 15:27:23,487 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:27:23,487 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 553 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:23,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 922 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:27:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62103 states. [2025-03-16 15:27:23,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62103 to 61413. [2025-03-16 15:27:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61413 states, 61412 states have (on average 1.0378101999609197) internal successors, (63734), 61412 states have internal predecessors, (63734), 0 states have call successors, (0), 0 states 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:27:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61413 states to 61413 states and 63734 transitions. [2025-03-16 15:27:23,966 INFO L78 Accepts]: Start accepts. Automaton has 61413 states and 63734 transitions. Word has length 1385 [2025-03-16 15:27:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:23,967 INFO L471 AbstractCegarLoop]: Abstraction has 61413 states and 63734 transitions. [2025-03-16 15:27:23,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 states 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:27:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 61413 states and 63734 transitions. [2025-03-16 15:27:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1450 [2025-03-16 15:27:23,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:23,985 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:23,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:27:23,985 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:23,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:23,986 INFO L85 PathProgramCache]: Analyzing trace with hash -608815896, now seen corresponding path program 1 times [2025-03-16 15:27:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:23,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284636557] [2025-03-16 15:27:23,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:23,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:24,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1449 statements into 1 equivalence classes. [2025-03-16 15:27:24,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1449 of 1449 statements. [2025-03-16 15:27:24,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:24,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2683 backedges. 726 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-03-16 15:27:26,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:26,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284636557] [2025-03-16 15:27:26,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284636557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:26,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:26,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:26,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302794668] [2025-03-16 15:27:26,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:26,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:26,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:26,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:26,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:26,579 INFO L87 Difference]: Start difference. First operand 61413 states and 63734 transitions. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states 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:27:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:27,957 INFO L93 Difference]: Finished difference Result 122825 states and 127474 transitions. [2025-03-16 15:27:27,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:27,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 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 1449 [2025-03-16 15:27:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:28,017 INFO L225 Difference]: With dead ends: 122825 [2025-03-16 15:27:28,017 INFO L226 Difference]: Without dead ends: 61413 [2025-03-16 15:27:28,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:27:28,041 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 645 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:28,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 756 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:27:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61413 states. [2025-03-16 15:27:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61413 to 60723. [2025-03-16 15:27:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60723 states, 60722 states have (on average 1.0331346134844044) internal successors, (62734), 60722 states have internal predecessors, (62734), 0 states have call successors, (0), 0 states 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:27:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60723 states to 60723 states and 62734 transitions. [2025-03-16 15:27:28,467 INFO L78 Accepts]: Start accepts. Automaton has 60723 states and 62734 transitions. Word has length 1449 [2025-03-16 15:27:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:28,468 INFO L471 AbstractCegarLoop]: Abstraction has 60723 states and 62734 transitions. [2025-03-16 15:27:28,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states 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:27:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 60723 states and 62734 transitions. [2025-03-16 15:27:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1504 [2025-03-16 15:27:28,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:28,488 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:27:28,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:27:28,488 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:28,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash 952091805, now seen corresponding path program 1 times [2025-03-16 15:27:28,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:28,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154516628] [2025-03-16 15:27:28,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:28,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:28,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1503 statements into 1 equivalence classes. [2025-03-16 15:27:28,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1503 of 1503 statements. [2025-03-16 15:27:28,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:28,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3141 backedges. 1624 proven. 0 refuted. 0 times theorem prover too weak. 1517 trivial. 0 not checked. [2025-03-16 15:27:29,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:29,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154516628] [2025-03-16 15:27:29,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154516628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:29,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:29,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:29,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670409808] [2025-03-16 15:27:29,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:29,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:29,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:29,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:29,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:29,161 INFO L87 Difference]: Start difference. First operand 60723 states and 62734 transitions. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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:27:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:30,528 INFO L93 Difference]: Finished difference Result 121445 states and 125468 transitions. [2025-03-16 15:27:30,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:30,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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 1503 [2025-03-16 15:27:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:30,596 INFO L225 Difference]: With dead ends: 121445 [2025-03-16 15:27:30,596 INFO L226 Difference]: Without dead ends: 60723 [2025-03-16 15:27:30,633 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:27:30,633 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 625 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:30,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 945 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:27:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60723 states. [2025-03-16 15:27:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60723 to 59343. [2025-03-16 15:27:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59343 states, 59342 states have (on average 1.0264231067372183) internal successors, (60910), 59342 states have internal predecessors, (60910), 0 states have call successors, (0), 0 states 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:27:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59343 states to 59343 states and 60910 transitions. [2025-03-16 15:27:31,264 INFO L78 Accepts]: Start accepts. Automaton has 59343 states and 60910 transitions. Word has length 1503 [2025-03-16 15:27:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:31,265 INFO L471 AbstractCegarLoop]: Abstraction has 59343 states and 60910 transitions. [2025-03-16 15:27:31,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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:27:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 59343 states and 60910 transitions. [2025-03-16 15:27:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1578 [2025-03-16 15:27:31,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:31,298 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:31,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:27:31,298 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:31,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2111858541, now seen corresponding path program 1 times [2025-03-16 15:27:31,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:31,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238592388] [2025-03-16 15:27:31,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:31,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:31,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1577 statements into 1 equivalence classes. [2025-03-16 15:27:31,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1577 of 1577 statements. [2025-03-16 15:27:31,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:31,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 1219 proven. 0 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2025-03-16 15:27:31,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:31,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238592388] [2025-03-16 15:27:31,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238592388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:31,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:31,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:31,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963399091] [2025-03-16 15:27:31,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:31,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:31,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:31,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:31,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:31,876 INFO L87 Difference]: Start difference. First operand 59343 states and 60910 transitions. Second operand has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states 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:27:33,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:33,284 INFO L93 Difference]: Finished difference Result 140073 states and 144004 transitions. [2025-03-16 15:27:33,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:33,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 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 1577 [2025-03-16 15:27:33,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:33,286 INFO L225 Difference]: With dead ends: 140073 [2025-03-16 15:27:33,286 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:27:33,329 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:27:33,329 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 292 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:33,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 103 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:27:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:27:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:27:33,330 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:27:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:27:33,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1577 [2025-03-16 15:27:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:33,331 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:27:33,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states 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:27:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:27:33,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:27:33,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:27:33,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:27:33,336 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] [2025-03-16 15:27:33,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:27:34,754 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:27:34,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:27:34 BoogieIcfgContainer [2025-03-16 15:27:34,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:27:34,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:27:34,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:27:34,768 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:27:34,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:26:40" (3/4) ... [2025-03-16 15:27:34,770 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:27:34,800 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-16 15:27:34,803 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:27:34,806 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:27:34,809 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:27:34,996 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:27:34,996 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:27:34,997 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:27:34,997 INFO L158 Benchmark]: Toolchain (without parser) took 58600.13ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 95.0MB in the beginning and 520.3MB in the end (delta: -425.3MB). Peak memory consumption was 520.7MB. Max. memory is 16.1GB. [2025-03-16 15:27:34,998 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:27:34,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 777.60ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 49.7MB in the end (delta: 45.3MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2025-03-16 15:27:34,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 212.94ms. Allocated memory is still 142.6MB. Free memory was 49.7MB in the beginning and 68.7MB in the end (delta: -19.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2025-03-16 15:27:34,999 INFO L158 Benchmark]: Boogie Preprocessor took 242.64ms. Allocated memory is still 142.6MB. Free memory was 68.7MB in the beginning and 52.4MB in the end (delta: 16.3MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2025-03-16 15:27:34,999 INFO L158 Benchmark]: IcfgBuilder took 2834.22ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 52.4MB in the beginning and 220.5MB in the end (delta: -168.1MB). Peak memory consumption was 208.2MB. Max. memory is 16.1GB. [2025-03-16 15:27:35,000 INFO L158 Benchmark]: TraceAbstraction took 54298.02ms. Allocated memory was 385.9MB in the beginning and 1.1GB in the end (delta: 704.6MB). Free memory was 220.5MB in the beginning and 566.3MB in the end (delta: -345.8MB). Peak memory consumption was 777.4MB. Max. memory is 16.1GB. [2025-03-16 15:27:35,000 INFO L158 Benchmark]: Witness Printer took 228.89ms. Allocated memory is still 1.1GB. Free memory was 566.3MB in the beginning and 520.3MB in the end (delta: 46.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 15:27:35,001 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.28ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 777.60ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 49.7MB in the end (delta: 45.3MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 212.94ms. Allocated memory is still 142.6MB. Free memory was 49.7MB in the beginning and 68.7MB in the end (delta: -19.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 242.64ms. Allocated memory is still 142.6MB. Free memory was 68.7MB in the beginning and 52.4MB in the end (delta: 16.3MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * IcfgBuilder took 2834.22ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 52.4MB in the beginning and 220.5MB in the end (delta: -168.1MB). Peak memory consumption was 208.2MB. Max. memory is 16.1GB. * TraceAbstraction took 54298.02ms. Allocated memory was 385.9MB in the beginning and 1.1GB in the end (delta: 704.6MB). Free memory was 220.5MB in the beginning and 566.3MB in the end (delta: -345.8MB). Peak memory consumption was 777.4MB. Max. memory is 16.1GB. * Witness Printer took 228.89ms. Allocated memory is still 1.1GB. Free memory was 566.3MB in the beginning and 520.3MB in the end (delta: 46.0MB). Peak memory consumption was 41.9MB. 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: 121]: 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, 696 locations, 1382 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.8s, OverallIterations: 21, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 33.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13029 SdHoareTripleChecker+Valid, 28.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13029 mSDsluCounter, 13829 SdHoareTripleChecker+Invalid, 23.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 6340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39558 IncrementalHoareTripleChecker+Invalid, 45898 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6340 mSolverCounterUnsat, 13691 mSDtfsCounter, 39558 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2287 GetRequests, 2253 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62103occurred in iteration=16, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 8280 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 18599 NumberOfCodeBlocks, 18599 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 18576 ConstructedInterpolants, 0 QuantifiedInterpolants, 42017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2590 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 23373/24540 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: 4269]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((a15 <= 4) && (a18 == 11)) && (a24 != 3)) || ((a24 == 0) && (a18 == 11))) || (((a15 != 4) && (a18 == 10)) && (a15 <= 5))) || (((a18 == 11) && (a3 <= 417)) && (a15 <= 5))) || (((a24 == 3) && (a15 != 4)) && (a18 == 9))) || (((3 <= a24) && (a18 == 8)) && (a15 <= 4))) || (((a18 == 8) && (a3 <= 417)) && (a15 <= 5))) || (((a15 <= 4) && (a18 == 9)) && (a24 != 3))) || ((a24 == 1) && (a18 == 11))) || (((a24 == 3) && (a18 == 8)) && (a3 <= 417))) || (((a24 == 3) && (a18 == 8)) && (a15 <= 5))) || ((a15 <= 4) && (a24 <= 1))) || ((((a18 == 8) && (a15 != 4)) && (a24 <= 3)) && (a24 != 3))) || (((a24 <= 3) && (a3 <= 417)) && (a18 == 9))) || (((a24 == 3) && (a18 == 12)) && (a3 <= 417))) || (((a18 == 11) && (a24 <= 3)) && (a3 <= 417))) || (((a15 <= 4) && (a18 == 10)) && (a3 <= 417))) || (((a24 <= 3) && (a18 == 9)) && (a24 != 3))) || ((((a15 <= 4) && (a24 <= 3)) && (a3 <= 417)) && (a24 != 3))) || ((((a24 == 3) && (a15 != 4)) && (a18 == 12)) && (a15 <= 5))) || (((a18 == 12) && (a15 <= 5)) && (a3 <= 99))) || (((a15 <= 4) && (a18 == 12)) && (a3 <= 417))) || (((a24 == 3) && (a15 != 4)) && (a18 == 11))) || ((((a15 != 4) && (a24 <= 3)) && (a18 == 12)) && (a24 != 3))) || ((a18 == 10) && (a24 <= 3))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:27:35,019 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