./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label22.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_label22.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 8328e3b00fffe34fe4036e6200cb72104f847b0ee3df41fd01aea5e06a24af7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:23:35,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:23:35,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:23:35,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:23:35,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:23:35,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:23:35,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:23:35,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:23:35,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:23:35,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:23:35,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:23:35,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:23:35,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:23:35,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:23:35,348 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:23:35,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:23:35,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:23:35,349 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:23:35,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:23:35,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:23:35,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:23:35,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:23:35,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:23:35,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:23:35,350 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:23:35,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:23:35,350 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:23:35,350 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:23:35,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:23:35,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:23:35,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:23:35,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:23:35,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:23:35,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:23:35,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:23:35,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:23:35,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:23:35,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:23:35,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:23:35,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:23:35,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:23:35,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:23:35,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:23:35,351 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 -> 8328e3b00fffe34fe4036e6200cb72104f847b0ee3df41fd01aea5e06a24af7e [2025-03-16 15:23:35,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:23:35,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:23:35,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:23:35,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:23:35,591 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:23:35,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label22.c [2025-03-16 15:23:36,729 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1ad250d/a85882978579448d9cae642195b37366/FLAGb24af6fc4 [2025-03-16 15:23:37,068 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:23:37,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label22.c [2025-03-16 15:23:37,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1ad250d/a85882978579448d9cae642195b37366/FLAGb24af6fc4 [2025-03-16 15:23:37,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1ad250d/a85882978579448d9cae642195b37366 [2025-03-16 15:23:37,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:23:37,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:23:37,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:23:37,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:23:37,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:23:37,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:23:37" (1/1) ... [2025-03-16 15:23:37,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51457774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:37, skipping insertion in model container [2025-03-16 15:23:37,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:23:37" (1/1) ... [2025-03-16 15:23:37,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:23:37,548 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_label22.c[4444,4457] [2025-03-16 15:23:37,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:23:37,897 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:23:37,909 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_label22.c[4444,4457] [2025-03-16 15:23:38,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:23:38,123 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:23:38,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:38 WrapperNode [2025-03-16 15:23:38,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:23:38,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:23:38,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:23:38,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:23:38,129 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:23:38" (1/1) ... [2025-03-16 15:23:38,167 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:23:38" (1/1) ... [2025-03-16 15:23:38,293 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-16 15:23:38,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:23:38,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:23:38,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:23:38,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:23:38,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:38" (1/1) ... [2025-03-16 15:23:38,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:38" (1/1) ... [2025-03-16 15:23:38,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:38" (1/1) ... [2025-03-16 15:23:38,438 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:23:38,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:38" (1/1) ... [2025-03-16 15:23:38,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:38" (1/1) ... [2025-03-16 15:23:38,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:38" (1/1) ... [2025-03-16 15:23:38,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:38" (1/1) ... [2025-03-16 15:23:38,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:38" (1/1) ... [2025-03-16 15:23:38,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:38" (1/1) ... [2025-03-16 15:23:38,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:23:38,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:23:38,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:23:38,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:23:38,576 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:38" (1/1) ... [2025-03-16 15:23:38,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:23:38,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:23:38,603 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:23:38,605 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:23:38,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:23:38,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:23:38,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:23:38,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:23:38,674 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:23:38,675 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:23:41,236 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-16 15:23:41,236 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-16 15:23:41,321 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-16 15:23:41,321 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:23:41,346 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:23:41,346 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:23:41,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:23:41 BoogieIcfgContainer [2025-03-16 15:23:41,347 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:23:41,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:23:41,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:23:41,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:23:41,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:23:37" (1/3) ... [2025-03-16 15:23:41,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ba2f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:23:41, skipping insertion in model container [2025-03-16 15:23:41,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:38" (2/3) ... [2025-03-16 15:23:41,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ba2f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:23:41, skipping insertion in model container [2025-03-16 15:23:41,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:23:41" (3/3) ... [2025-03-16 15:23:41,358 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label22.c [2025-03-16 15:23:41,369 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:23:41,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label22.c that has 1 procedures, 696 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:23:41,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:23:41,445 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;@276c13be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:23:41,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:23:41,450 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:23:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 15:23:41,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:41,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:41,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:41,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:41,459 INFO L85 PathProgramCache]: Analyzing trace with hash -830546766, now seen corresponding path program 1 times [2025-03-16 15:23:41,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:41,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750060629] [2025-03-16 15:23:41,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:41,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 15:23:41,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 15:23:41,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:41,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:41,587 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:23:41,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:41,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750060629] [2025-03-16 15:23:41,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750060629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:41,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:41,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:41,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297003668] [2025-03-16 15:23:41,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:41,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:23:41,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:41,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:23:41,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:23:41,611 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:23:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:41,665 INFO L93 Difference]: Finished difference Result 1391 states and 2763 transitions. [2025-03-16 15:23:41,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:23:41,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-03-16 15:23:41,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:41,676 INFO L225 Difference]: With dead ends: 1391 [2025-03-16 15:23:41,676 INFO L226 Difference]: Without dead ends: 693 [2025-03-16 15:23:41,680 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:23:41,682 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:23:41,683 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:23:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-16 15:23:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2025-03-16 15:23:41,730 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:23:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2025-03-16 15:23:41,736 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 40 [2025-03-16 15:23:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:41,736 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2025-03-16 15:23:41,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:23:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2025-03-16 15:23:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 15:23:41,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:41,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:41,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:23:41,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1792438057, now seen corresponding path program 1 times [2025-03-16 15:23:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134290871] [2025-03-16 15:23:41,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:41,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 15:23:41,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 15:23:41,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:41,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:41,964 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:23:41,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:41,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134290871] [2025-03-16 15:23:41,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134290871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:41,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:41,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:41,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859179545] [2025-03-16 15:23:41,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:41,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:41,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:41,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:41,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:41,966 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:23:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:45,584 INFO L93 Difference]: Finished difference Result 2771 states and 5269 transitions. [2025-03-16 15:23:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:23:45,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-03-16 15:23:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:45,591 INFO L225 Difference]: With dead ends: 2771 [2025-03-16 15:23:45,591 INFO L226 Difference]: Without dead ends: 2079 [2025-03-16 15:23:45,592 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:23:45,593 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 2093 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3268 mSolverCounterSat, 1655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 4923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1655 IncrementalHoareTripleChecker+Valid, 3268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:45,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 136 Invalid, 4923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1655 Valid, 3268 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-16 15:23:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2025-03-16 15:23:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 2073. [2025-03-16 15:23:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 2072 states have (on average 1.5564671814671815) internal successors, (3225), 2072 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states 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:23:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3225 transitions. [2025-03-16 15:23:45,662 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3225 transitions. Word has length 40 [2025-03-16 15:23:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:45,662 INFO L471 AbstractCegarLoop]: Abstraction has 2073 states and 3225 transitions. [2025-03-16 15:23:45,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:23:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3225 transitions. [2025-03-16 15:23:45,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 15:23:45,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:45,670 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-16 15:23:45,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:23:45,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:45,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1028441290, now seen corresponding path program 1 times [2025-03-16 15:23:45,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:45,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517484001] [2025-03-16 15:23:45,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:45,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 15:23:45,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 15:23:45,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:45,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 15:23:46,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:46,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517484001] [2025-03-16 15:23:46,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517484001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:46,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:46,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:46,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494219128] [2025-03-16 15:23:46,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:46,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:46,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:46,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:46,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:46,187 INFO L87 Difference]: Start difference. First operand 2073 states and 3225 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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:23:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:49,309 INFO L93 Difference]: Finished difference Result 6907 states and 10879 transitions. [2025-03-16 15:23:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:49,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-03-16 15:23:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:49,328 INFO L225 Difference]: With dead ends: 6907 [2025-03-16 15:23:49,328 INFO L226 Difference]: Without dead ends: 4835 [2025-03-16 15:23:49,331 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:23:49,334 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 1924 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4332 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1924 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 4959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 4332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:49,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1924 Valid, 621 Invalid, 4959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 4332 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-16 15:23:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4835 states. [2025-03-16 15:23:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4835 to 4143. [2025-03-16 15:23:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 1.3408981168517624) internal successors, (5554), 4142 states have internal predecessors, (5554), 0 states have call successors, (0), 0 states 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:23:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5554 transitions. [2025-03-16 15:23:49,394 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5554 transitions. Word has length 200 [2025-03-16 15:23:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:49,395 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5554 transitions. [2025-03-16 15:23:49,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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:23:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5554 transitions. [2025-03-16 15:23:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-16 15:23:49,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:49,400 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-16 15:23:49,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:23:49,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:49,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:49,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1981917059, now seen corresponding path program 1 times [2025-03-16 15:23:49,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:49,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343107377] [2025-03-16 15:23:49,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:49,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:49,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-16 15:23:49,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-16 15:23:49,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:49,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:49,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:49,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343107377] [2025-03-16 15:23:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343107377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:49,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487877090] [2025-03-16 15:23:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:49,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:49,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:49,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:49,735 INFO L87 Difference]: Start difference. First operand 4143 states and 5554 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:51,922 INFO L93 Difference]: Finished difference Result 10408 states and 13872 transitions. [2025-03-16 15:23:51,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:51,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2025-03-16 15:23:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:51,936 INFO L225 Difference]: With dead ends: 10408 [2025-03-16 15:23:51,936 INFO L226 Difference]: Without dead ends: 6213 [2025-03-16 15:23:51,939 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:23:51,943 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 513 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:51,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 635 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:23:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6213 states. [2025-03-16 15:23:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6213 to 5523. [2025-03-16 15:23:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5523 states, 5522 states have (on average 1.196305686345527) internal successors, (6606), 5522 states have internal predecessors, (6606), 0 states have call successors, (0), 0 states 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:23:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 6606 transitions. [2025-03-16 15:23:52,015 INFO L78 Accepts]: Start accepts. Automaton has 5523 states and 6606 transitions. Word has length 289 [2025-03-16 15:23:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:52,016 INFO L471 AbstractCegarLoop]: Abstraction has 5523 states and 6606 transitions. [2025-03-16 15:23:52,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 5523 states and 6606 transitions. [2025-03-16 15:23:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2025-03-16 15:23:52,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:52,029 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:23:52,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:23:52,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:52,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash -579985725, now seen corresponding path program 1 times [2025-03-16 15:23:52,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:52,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292925271] [2025-03-16 15:23:52,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:52,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:52,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-03-16 15:23:52,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-03-16 15:23:52,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:52,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-16 15:23:52,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:52,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292925271] [2025-03-16 15:23:52,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292925271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:52,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:52,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:52,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505916762] [2025-03-16 15:23:52,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:52,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:52,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:52,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:52,777 INFO L87 Difference]: Start difference. First operand 5523 states and 6606 transitions. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states 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:23:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:54,304 INFO L93 Difference]: Finished difference Result 15185 states and 18422 transitions. [2025-03-16 15:23:54,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:54,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 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 921 [2025-03-16 15:23:54,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:54,325 INFO L225 Difference]: With dead ends: 15185 [2025-03-16 15:23:54,325 INFO L226 Difference]: Without dead ends: 9663 [2025-03-16 15:23:54,330 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:23:54,331 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 643 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:54,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 104 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:23:54,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9663 states. [2025-03-16 15:23:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9663 to 8973. [2025-03-16 15:23:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8973 states, 8972 states have (on average 1.2179001337494426) internal successors, (10927), 8972 states have internal predecessors, (10927), 0 states have call successors, (0), 0 states 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:23:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8973 states to 8973 states and 10927 transitions. [2025-03-16 15:23:54,431 INFO L78 Accepts]: Start accepts. Automaton has 8973 states and 10927 transitions. Word has length 921 [2025-03-16 15:23:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:54,432 INFO L471 AbstractCegarLoop]: Abstraction has 8973 states and 10927 transitions. [2025-03-16 15:23:54,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states 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:23:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 8973 states and 10927 transitions. [2025-03-16 15:23:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2025-03-16 15:23:54,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:54,449 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:23:54,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:23:54,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:54,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash 439661872, now seen corresponding path program 1 times [2025-03-16 15:23:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:54,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381694977] [2025-03-16 15:23:54,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:54,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:54,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 939 statements into 1 equivalence classes. [2025-03-16 15:23:54,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 939 of 939 statements. [2025-03-16 15:23:54,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:54,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2025-03-16 15:23:55,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381694977] [2025-03-16 15:23:55,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381694977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:55,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:55,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:55,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534197834] [2025-03-16 15:23:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:55,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:55,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:55,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:55,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:55,071 INFO L87 Difference]: Start difference. First operand 8973 states and 10927 transitions. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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:23:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:56,609 INFO L93 Difference]: Finished difference Result 20015 states and 24611 transitions. [2025-03-16 15:23:56,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:56,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 0 states have call successors, (0), 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 939 [2025-03-16 15:23:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:56,636 INFO L225 Difference]: With dead ends: 20015 [2025-03-16 15:23:56,636 INFO L226 Difference]: Without dead ends: 11043 [2025-03-16 15:23:56,644 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:23:56,645 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:56,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 76 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:23:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11043 states. [2025-03-16 15:23:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11043 to 11043. [2025-03-16 15:23:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11043 states, 11042 states have (on average 1.2193443216808548) internal successors, (13464), 11042 states have internal predecessors, (13464), 0 states have call successors, (0), 0 states 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:23:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11043 states to 11043 states and 13464 transitions. [2025-03-16 15:23:56,755 INFO L78 Accepts]: Start accepts. Automaton has 11043 states and 13464 transitions. Word has length 939 [2025-03-16 15:23:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:56,756 INFO L471 AbstractCegarLoop]: Abstraction has 11043 states and 13464 transitions. [2025-03-16 15:23:56,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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:23:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 11043 states and 13464 transitions. [2025-03-16 15:23:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1001 [2025-03-16 15:23:56,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:56,769 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:56,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:23:56,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:56,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1890455725, now seen corresponding path program 1 times [2025-03-16 15:23:56,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:56,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177710913] [2025-03-16 15:23:56,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:56,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:56,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1000 statements into 1 equivalence classes. [2025-03-16 15:23:56,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1000 of 1000 statements. [2025-03-16 15:23:56,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:56,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2025-03-16 15:23:57,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:57,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177710913] [2025-03-16 15:23:57,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177710913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:57,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:57,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:57,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414543079] [2025-03-16 15:23:57,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:57,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:57,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:57,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:57,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:57,253 INFO L87 Difference]: Start difference. First operand 11043 states and 13464 transitions. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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:23:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:58,757 INFO L93 Difference]: Finished difference Result 26915 states and 33820 transitions. [2025-03-16 15:23:58,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:58,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 0 states have call successors, (0), 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 1000 [2025-03-16 15:23:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:58,780 INFO L225 Difference]: With dead ends: 26915 [2025-03-16 15:23:58,780 INFO L226 Difference]: Without dead ends: 15873 [2025-03-16 15:23:58,791 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:23:58,793 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 226 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:58,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 388 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:23:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15873 states. [2025-03-16 15:23:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15873 to 14493. [2025-03-16 15:23:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14493 states, 14492 states have (on average 1.1837565553408778) internal successors, (17155), 14492 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states 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:23:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14493 states to 14493 states and 17155 transitions. [2025-03-16 15:23:58,923 INFO L78 Accepts]: Start accepts. Automaton has 14493 states and 17155 transitions. Word has length 1000 [2025-03-16 15:23:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:58,924 INFO L471 AbstractCegarLoop]: Abstraction has 14493 states and 17155 transitions. [2025-03-16 15:23:58,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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:23:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 14493 states and 17155 transitions. [2025-03-16 15:23:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1026 [2025-03-16 15:23:58,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:58,931 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:23:58,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:23:58,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:58,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:58,933 INFO L85 PathProgramCache]: Analyzing trace with hash -398300782, now seen corresponding path program 1 times [2025-03-16 15:23:58,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:58,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495018483] [2025-03-16 15:23:58,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:58,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:59,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1025 statements into 1 equivalence classes. [2025-03-16 15:23:59,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1025 of 1025 statements. [2025-03-16 15:23:59,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:59,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 878 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-16 15:23:59,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:59,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495018483] [2025-03-16 15:23:59,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495018483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:59,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:59,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:59,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681891011] [2025-03-16 15:23:59,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:59,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:59,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:59,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:59,416 INFO L87 Difference]: Start difference. First operand 14493 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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:24:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:00,957 INFO L93 Difference]: Finished difference Result 35195 states and 41985 transitions. [2025-03-16 15:24:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:00,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 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 1025 [2025-03-16 15:24:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:00,991 INFO L225 Difference]: With dead ends: 35195 [2025-03-16 15:24:00,992 INFO L226 Difference]: Without dead ends: 20703 [2025-03-16 15:24:01,005 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:24:01,005 INFO L435 NwaCegarLoop]: 1116 mSDtfsCounter, 653 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:01,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1122 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:24:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20703 states. [2025-03-16 15:24:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20703 to 20013. [2025-03-16 15:24:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20013 states, 20012 states have (on average 1.1647511493104137) internal successors, (23309), 20012 states have internal predecessors, (23309), 0 states have call successors, (0), 0 states 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:24:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20013 states to 20013 states and 23309 transitions. [2025-03-16 15:24:01,252 INFO L78 Accepts]: Start accepts. Automaton has 20013 states and 23309 transitions. Word has length 1025 [2025-03-16 15:24:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:01,253 INFO L471 AbstractCegarLoop]: Abstraction has 20013 states and 23309 transitions. [2025-03-16 15:24:01,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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:24:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 20013 states and 23309 transitions. [2025-03-16 15:24:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1133 [2025-03-16 15:24:01,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:01,272 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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, 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:24:01,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:24:01,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:01,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:01,273 INFO L85 PathProgramCache]: Analyzing trace with hash 678579115, now seen corresponding path program 1 times [2025-03-16 15:24:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:01,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76372824] [2025-03-16 15:24:01,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:01,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:01,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1132 statements into 1 equivalence classes. [2025-03-16 15:24:01,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1132 of 1132 statements. [2025-03-16 15:24:01,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:01,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 830 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-16 15:24:01,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:01,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76372824] [2025-03-16 15:24:01,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76372824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:01,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:01,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:01,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247652485] [2025-03-16 15:24:01,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:01,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:01,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:01,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:01,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:01,980 INFO L87 Difference]: Start difference. First operand 20013 states and 23309 transitions. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 states 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:24:03,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:03,453 INFO L93 Difference]: Finished difference Result 45545 states and 53215 transitions. [2025-03-16 15:24:03,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:03,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 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 1132 [2025-03-16 15:24:03,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:03,487 INFO L225 Difference]: With dead ends: 45545 [2025-03-16 15:24:03,488 INFO L226 Difference]: Without dead ends: 25533 [2025-03-16 15:24:03,504 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:24:03,504 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 574 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:03,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1015 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:24:03,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25533 states. [2025-03-16 15:24:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25533 to 25533. [2025-03-16 15:24:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25533 states, 25532 states have (on average 1.1497336675544414) internal successors, (29355), 25532 states have internal predecessors, (29355), 0 states have call successors, (0), 0 states 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:24:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25533 states to 25533 states and 29355 transitions. [2025-03-16 15:24:03,709 INFO L78 Accepts]: Start accepts. Automaton has 25533 states and 29355 transitions. Word has length 1132 [2025-03-16 15:24:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:03,710 INFO L471 AbstractCegarLoop]: Abstraction has 25533 states and 29355 transitions. [2025-03-16 15:24:03,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 states 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:24:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 25533 states and 29355 transitions. [2025-03-16 15:24:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1140 [2025-03-16 15:24:03,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:03,720 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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, 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] [2025-03-16 15:24:03,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:24:03,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:03,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash -547961554, now seen corresponding path program 1 times [2025-03-16 15:24:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:03,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145760143] [2025-03-16 15:24:03,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:03,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1139 statements into 1 equivalence classes. [2025-03-16 15:24:03,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1139 of 1139 statements. [2025-03-16 15:24:03,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:03,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 703 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-16 15:24:04,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:04,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145760143] [2025-03-16 15:24:04,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145760143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:04,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:04,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:04,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858547569] [2025-03-16 15:24:04,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:04,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:04,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:04,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:04,141 INFO L87 Difference]: Start difference. First operand 25533 states and 29355 transitions. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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:24:05,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:05,671 INFO L93 Difference]: Finished difference Result 57965 states and 66651 transitions. [2025-03-16 15:24:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:05,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 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 1139 [2025-03-16 15:24:05,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:05,711 INFO L225 Difference]: With dead ends: 57965 [2025-03-16 15:24:05,711 INFO L226 Difference]: Without dead ends: 28293 [2025-03-16 15:24:05,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:05,731 INFO L435 NwaCegarLoop]: 1106 mSDtfsCounter, 633 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:05,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1112 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:24:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28293 states. [2025-03-16 15:24:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28293 to 27603. [2025-03-16 15:24:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27603 states, 27602 states have (on average 1.0893413520759365) internal successors, (30068), 27602 states have internal predecessors, (30068), 0 states have call successors, (0), 0 states 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:24:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27603 states to 27603 states and 30068 transitions. [2025-03-16 15:24:06,004 INFO L78 Accepts]: Start accepts. Automaton has 27603 states and 30068 transitions. Word has length 1139 [2025-03-16 15:24:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:06,004 INFO L471 AbstractCegarLoop]: Abstraction has 27603 states and 30068 transitions. [2025-03-16 15:24:06,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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:24:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 27603 states and 30068 transitions. [2025-03-16 15:24:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2025-03-16 15:24:06,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:06,015 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:06,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:24:06,015 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:06,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash -259967469, now seen corresponding path program 1 times [2025-03-16 15:24:06,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:06,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943057086] [2025-03-16 15:24:06,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:06,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:06,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1143 statements into 1 equivalence classes. [2025-03-16 15:24:06,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1143 of 1143 statements. [2025-03-16 15:24:06,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:06,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1320 backedges. 853 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2025-03-16 15:24:06,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943057086] [2025-03-16 15:24:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943057086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:06,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:06,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:06,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021637935] [2025-03-16 15:24:06,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:06,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:06,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:06,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:06,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:06,659 INFO L87 Difference]: Start difference. First operand 27603 states and 30068 transitions. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:24:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:07,997 INFO L93 Difference]: Finished difference Result 58655 states and 64037 transitions. [2025-03-16 15:24:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:07,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 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 1143 [2025-03-16 15:24:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:08,031 INFO L225 Difference]: With dead ends: 58655 [2025-03-16 15:24:08,031 INFO L226 Difference]: Without dead ends: 31053 [2025-03-16 15:24:08,047 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:24:08,048 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 586 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:08,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 226 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:24:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31053 states. [2025-03-16 15:24:08,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31053 to 31053. [2025-03-16 15:24:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31053 states, 31052 states have (on average 1.0856305551977328) internal successors, (33711), 31052 states have internal predecessors, (33711), 0 states have call successors, (0), 0 states 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:24:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31053 states to 31053 states and 33711 transitions. [2025-03-16 15:24:08,278 INFO L78 Accepts]: Start accepts. Automaton has 31053 states and 33711 transitions. Word has length 1143 [2025-03-16 15:24:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:08,279 INFO L471 AbstractCegarLoop]: Abstraction has 31053 states and 33711 transitions. [2025-03-16 15:24:08,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:24:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 31053 states and 33711 transitions. [2025-03-16 15:24:08,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2025-03-16 15:24:08,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:08,289 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:24:08,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:24:08,289 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:08,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:08,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2118973904, now seen corresponding path program 1 times [2025-03-16 15:24:08,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:08,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929272291] [2025-03-16 15:24:08,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:08,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:08,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1198 statements into 1 equivalence classes. [2025-03-16 15:24:08,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1198 of 1198 statements. [2025-03-16 15:24:08,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:08,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2025-03-16 15:24:08,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:08,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929272291] [2025-03-16 15:24:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929272291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448752544] [2025-03-16 15:24:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:08,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:08,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:08,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:08,697 INFO L87 Difference]: Start difference. First operand 31053 states and 33711 transitions. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:24:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:10,080 INFO L93 Difference]: Finished difference Result 80045 states and 87331 transitions. [2025-03-16 15:24:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:10,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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 1198 [2025-03-16 15:24:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:10,130 INFO L225 Difference]: With dead ends: 80045 [2025-03-16 15:24:10,130 INFO L226 Difference]: Without dead ends: 48993 [2025-03-16 15:24:10,154 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:24:10,155 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 678 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:10,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 920 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:24:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48993 states. [2025-03-16 15:24:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48993 to 47613. [2025-03-16 15:24:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47613 states, 47612 states have (on average 1.0757162059984877) internal successors, (51217), 47612 states have internal predecessors, (51217), 0 states have call successors, (0), 0 states 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:24:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47613 states to 47613 states and 51217 transitions. [2025-03-16 15:24:10,671 INFO L78 Accepts]: Start accepts. Automaton has 47613 states and 51217 transitions. Word has length 1198 [2025-03-16 15:24:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:10,672 INFO L471 AbstractCegarLoop]: Abstraction has 47613 states and 51217 transitions. [2025-03-16 15:24:10,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:24:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 47613 states and 51217 transitions. [2025-03-16 15:24:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2025-03-16 15:24:10,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:10,692 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:10,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:24:10,693 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:10,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash 977739502, now seen corresponding path program 1 times [2025-03-16 15:24:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:10,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086735759] [2025-03-16 15:24:10,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:10,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1222 statements into 1 equivalence classes. [2025-03-16 15:24:10,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1222 of 1222 statements. [2025-03-16 15:24:10,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:10,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1780 backedges. 1148 proven. 0 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2025-03-16 15:24:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086735759] [2025-03-16 15:24:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086735759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:11,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:11,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 15:24:11,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165813687] [2025-03-16 15:24:11,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:11,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:24:11,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:11,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:24:11,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:24:11,623 INFO L87 Difference]: Start difference. First operand 47613 states and 51217 transitions. Second operand has 5 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:24:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:13,208 INFO L93 Difference]: Finished difference Result 94651 states and 101855 transitions. [2025-03-16 15:24:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:24:13,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 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 1222 [2025-03-16 15:24:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:13,253 INFO L225 Difference]: With dead ends: 94651 [2025-03-16 15:24:13,253 INFO L226 Difference]: Without dead ends: 47039 [2025-03-16 15:24:13,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:24:13,282 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 1974 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1974 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:13,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1974 Valid, 953 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:24:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47039 states. [2025-03-16 15:24:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47039 to 46923. [2025-03-16 15:24:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46923 states, 46922 states have (on average 1.0638932696815993) internal successors, (49920), 46922 states have internal predecessors, (49920), 0 states have call successors, (0), 0 states 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:24:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46923 states to 46923 states and 49920 transitions. [2025-03-16 15:24:13,718 INFO L78 Accepts]: Start accepts. Automaton has 46923 states and 49920 transitions. Word has length 1222 [2025-03-16 15:24:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:13,719 INFO L471 AbstractCegarLoop]: Abstraction has 46923 states and 49920 transitions. [2025-03-16 15:24:13,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:24:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 46923 states and 49920 transitions. [2025-03-16 15:24:13,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1237 [2025-03-16 15:24:13,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:13,731 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:24:13,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:24:13,731 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:13,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:13,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1371967987, now seen corresponding path program 1 times [2025-03-16 15:24:13,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:13,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472106651] [2025-03-16 15:24:13,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:13,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:13,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1236 statements into 1 equivalence classes. [2025-03-16 15:24:13,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1236 of 1236 statements. [2025-03-16 15:24:13,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:13,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:14,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1790 backedges. 1087 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-16 15:24:14,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:14,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472106651] [2025-03-16 15:24:14,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472106651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:14,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:14,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:14,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139200626] [2025-03-16 15:24:14,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:14,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:14,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:14,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:14,145 INFO L87 Difference]: Start difference. First operand 46923 states and 49920 transitions. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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:24:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:15,585 INFO L93 Difference]: Finished difference Result 113855 states and 121865 transitions. [2025-03-16 15:24:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:15,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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 1236 [2025-03-16 15:24:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:15,647 INFO L225 Difference]: With dead ends: 113855 [2025-03-16 15:24:15,647 INFO L226 Difference]: Without dead ends: 66933 [2025-03-16 15:24:15,678 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:24:15,678 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 646 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:15,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 873 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:24:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66933 states. [2025-03-16 15:24:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66933 to 66933. [2025-03-16 15:24:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66933 states, 66932 states have (on average 1.055892547660312) internal successors, (70673), 66932 states have internal predecessors, (70673), 0 states have call successors, (0), 0 states 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:24:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66933 states to 66933 states and 70673 transitions. [2025-03-16 15:24:16,151 INFO L78 Accepts]: Start accepts. Automaton has 66933 states and 70673 transitions. Word has length 1236 [2025-03-16 15:24:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:16,151 INFO L471 AbstractCegarLoop]: Abstraction has 66933 states and 70673 transitions. [2025-03-16 15:24:16,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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:24:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 66933 states and 70673 transitions. [2025-03-16 15:24:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1255 [2025-03-16 15:24:16,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:16,163 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:24:16,163 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:16,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:16,164 INFO L85 PathProgramCache]: Analyzing trace with hash 631006012, now seen corresponding path program 1 times [2025-03-16 15:24:16,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:16,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460930275] [2025-03-16 15:24:16,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:16,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:16,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1254 statements into 1 equivalence classes. [2025-03-16 15:24:16,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1254 of 1254 statements. [2025-03-16 15:24:16,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:16,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 460 proven. 694 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-03-16 15:24:17,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:17,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460930275] [2025-03-16 15:24:17,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460930275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:24:17,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917967141] [2025-03-16 15:24:17,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:17,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:24:17,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:24:17,707 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:24:17,709 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:24:17,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1254 statements into 1 equivalence classes. [2025-03-16 15:24:17,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1254 of 1254 statements. [2025-03-16 15:24:17,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:17,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:17,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:24:17,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:24:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 549 proven. 0 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2025-03-16 15:24:18,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:24:18,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917967141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:18,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:24:18,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:24:18,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014360619] [2025-03-16 15:24:18,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:18,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:18,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:18,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:18,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:24:18,101 INFO L87 Difference]: Start difference. First operand 66933 states and 70673 transitions. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states 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:24:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:19,502 INFO L93 Difference]: Finished difference Result 138695 states and 146227 transitions. [2025-03-16 15:24:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:19,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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 1254 [2025-03-16 15:24:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:19,566 INFO L225 Difference]: With dead ends: 138695 [2025-03-16 15:24:19,566 INFO L226 Difference]: Without dead ends: 66933 [2025-03-16 15:24:19,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1259 GetRequests, 1254 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:24:19,603 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 627 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:19,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 876 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:24:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66933 states. [2025-03-16 15:24:20,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66933 to 66933. [2025-03-16 15:24:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66933 states, 66932 states have (on average 1.0428494591525728) internal successors, (69800), 66932 states have internal predecessors, (69800), 0 states have call successors, (0), 0 states 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:24:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66933 states to 66933 states and 69800 transitions. [2025-03-16 15:24:20,121 INFO L78 Accepts]: Start accepts. Automaton has 66933 states and 69800 transitions. Word has length 1254 [2025-03-16 15:24:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:20,122 INFO L471 AbstractCegarLoop]: Abstraction has 66933 states and 69800 transitions. [2025-03-16 15:24:20,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states 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:24:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 66933 states and 69800 transitions. [2025-03-16 15:24:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1363 [2025-03-16 15:24:20,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:20,138 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:24:20,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:24:20,339 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,SelfDestructingSolverStorable14 [2025-03-16 15:24:20,339 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:20,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:20,340 INFO L85 PathProgramCache]: Analyzing trace with hash -975767467, now seen corresponding path program 1 times [2025-03-16 15:24:20,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:20,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577519923] [2025-03-16 15:24:20,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:20,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:20,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1362 statements into 1 equivalence classes. [2025-03-16 15:24:20,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1362 of 1362 statements. [2025-03-16 15:24:20,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:20,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 1352 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2025-03-16 15:24:21,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:21,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577519923] [2025-03-16 15:24:21,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577519923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:21,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:21,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:21,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974178937] [2025-03-16 15:24:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:21,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:24:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:21,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:24:21,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:24:21,203 INFO L87 Difference]: Start difference. First operand 66933 states and 69800 transitions. Second operand has 4 states, 4 states have (on average 208.5) internal successors, (834), 3 states have internal predecessors, (834), 0 states have call successors, (0), 0 states 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:24:23,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:23,198 INFO L93 Difference]: Finished difference Result 133175 states and 138908 transitions. [2025-03-16 15:24:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:24:23,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 208.5) internal successors, (834), 3 states have internal predecessors, (834), 0 states have call successors, (0), 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 1362 [2025-03-16 15:24:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:23,259 INFO L225 Difference]: With dead ends: 133175 [2025-03-16 15:24:23,259 INFO L226 Difference]: Without dead ends: 66933 [2025-03-16 15:24:23,296 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:24:23,296 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 981 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:23,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 68 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2684 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:24:23,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66933 states. [2025-03-16 15:24:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66933 to 66243. [2025-03-16 15:24:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66243 states, 66242 states have (on average 1.043039159445669) internal successors, (69093), 66242 states have internal predecessors, (69093), 0 states have call successors, (0), 0 states 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:24:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66243 states to 66243 states and 69093 transitions. [2025-03-16 15:24:23,882 INFO L78 Accepts]: Start accepts. Automaton has 66243 states and 69093 transitions. Word has length 1362 [2025-03-16 15:24:23,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:23,883 INFO L471 AbstractCegarLoop]: Abstraction has 66243 states and 69093 transitions. [2025-03-16 15:24:23,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 208.5) internal successors, (834), 3 states have internal predecessors, (834), 0 states have call successors, (0), 0 states 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:24:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 66243 states and 69093 transitions. [2025-03-16 15:24:23,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1442 [2025-03-16 15:24:23,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:23,902 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:24:23,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:24:23,902 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:23,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:23,903 INFO L85 PathProgramCache]: Analyzing trace with hash 829646490, now seen corresponding path program 1 times [2025-03-16 15:24:23,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:23,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183305286] [2025-03-16 15:24:23,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:23,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:23,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1441 statements into 1 equivalence classes. [2025-03-16 15:24:23,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1441 of 1441 statements. [2025-03-16 15:24:23,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:23,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2383 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 2150 trivial. 0 not checked. [2025-03-16 15:24:24,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:24,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183305286] [2025-03-16 15:24:24,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183305286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:24,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:24,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:24,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571455975] [2025-03-16 15:24:24,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:24,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:24,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:24,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:24,392 INFO L87 Difference]: Start difference. First operand 66243 states and 69093 transitions. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states 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:24:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:25,920 INFO L93 Difference]: Finished difference Result 131795 states and 137494 transitions. [2025-03-16 15:24:25,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:25,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 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 1441 [2025-03-16 15:24:25,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:25,988 INFO L225 Difference]: With dead ends: 131795 [2025-03-16 15:24:25,988 INFO L226 Difference]: Without dead ends: 66243 [2025-03-16 15:24:26,013 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:24:26,013 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 718 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:26,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 887 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:24:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66243 states. [2025-03-16 15:24:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66243 to 66243. [2025-03-16 15:24:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66243 states, 66242 states have (on average 1.0302527097611787) internal successors, (68246), 66242 states have internal predecessors, (68246), 0 states have call successors, (0), 0 states 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:24:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66243 states to 66243 states and 68246 transitions. [2025-03-16 15:24:26,774 INFO L78 Accepts]: Start accepts. Automaton has 66243 states and 68246 transitions. Word has length 1441 [2025-03-16 15:24:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:26,775 INFO L471 AbstractCegarLoop]: Abstraction has 66243 states and 68246 transitions. [2025-03-16 15:24:26,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states 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:24:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 66243 states and 68246 transitions. [2025-03-16 15:24:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1463 [2025-03-16 15:24:26,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:26,809 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:24:26,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:24:26,809 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:26,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:26,810 INFO L85 PathProgramCache]: Analyzing trace with hash 651579435, now seen corresponding path program 1 times [2025-03-16 15:24:26,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:26,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315331320] [2025-03-16 15:24:26,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:26,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:26,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1462 statements into 1 equivalence classes. [2025-03-16 15:24:26,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1462 of 1462 statements. [2025-03-16 15:24:26,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:26,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 1342 proven. 0 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2025-03-16 15:24:27,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:27,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315331320] [2025-03-16 15:24:27,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315331320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:27,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:27,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:27,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294732132] [2025-03-16 15:24:27,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:27,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:27,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:27,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:27,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:27,497 INFO L87 Difference]: Start difference. First operand 66243 states and 68246 transitions. Second operand has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states 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:24:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:28,804 INFO L93 Difference]: Finished difference Result 131795 states and 135800 transitions. [2025-03-16 15:24:28,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:28,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 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 1462 [2025-03-16 15:24:28,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:28,873 INFO L225 Difference]: With dead ends: 131795 [2025-03-16 15:24:28,873 INFO L226 Difference]: Without dead ends: 66243 [2025-03-16 15:24:28,908 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:24:28,908 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 504 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:28,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 922 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:24:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66243 states. [2025-03-16 15:24:29,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66243 to 64173. [2025-03-16 15:24:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64173 states, 64172 states have (on average 1.0267250514242972) internal successors, (65887), 64172 states have internal predecessors, (65887), 0 states have call successors, (0), 0 states 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:24:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64173 states to 64173 states and 65887 transitions. [2025-03-16 15:24:29,422 INFO L78 Accepts]: Start accepts. Automaton has 64173 states and 65887 transitions. Word has length 1462 [2025-03-16 15:24:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:29,422 INFO L471 AbstractCegarLoop]: Abstraction has 64173 states and 65887 transitions. [2025-03-16 15:24:29,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states 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:24:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 64173 states and 65887 transitions. [2025-03-16 15:24:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1515 [2025-03-16 15:24:29,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:29,444 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:29,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:24:29,444 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:29,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash 378496999, now seen corresponding path program 1 times [2025-03-16 15:24:29,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:29,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193196538] [2025-03-16 15:24:29,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:29,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:29,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1514 statements into 1 equivalence classes. [2025-03-16 15:24:29,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1514 of 1514 statements. [2025-03-16 15:24:29,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:29,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 553 proven. 0 refuted. 0 times theorem prover too weak. 1577 trivial. 0 not checked. [2025-03-16 15:24:30,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:30,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193196538] [2025-03-16 15:24:30,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193196538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:30,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:30,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:30,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731668361] [2025-03-16 15:24:30,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:30,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:30,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:30,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:30,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:30,003 INFO L87 Difference]: Start difference. First operand 64173 states and 65887 transitions. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states 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:24:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:31,308 INFO L93 Difference]: Finished difference Result 128345 states and 131778 transitions. [2025-03-16 15:24:31,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:31,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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 1514 [2025-03-16 15:24:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:31,368 INFO L225 Difference]: With dead ends: 128345 [2025-03-16 15:24:31,369 INFO L226 Difference]: Without dead ends: 64863 [2025-03-16 15:24:31,403 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:24:31,404 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 618 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:31,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 66 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:24:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64863 states. [2025-03-16 15:24:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64863 to 64173. [2025-03-16 15:24:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64173 states, 64172 states have (on average 1.0261017266097363) internal successors, (65847), 64172 states have internal predecessors, (65847), 0 states have call successors, (0), 0 states 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:24:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64173 states to 64173 states and 65847 transitions. [2025-03-16 15:24:31,924 INFO L78 Accepts]: Start accepts. Automaton has 64173 states and 65847 transitions. Word has length 1514 [2025-03-16 15:24:31,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:31,925 INFO L471 AbstractCegarLoop]: Abstraction has 64173 states and 65847 transitions. [2025-03-16 15:24:31,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states 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:24:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 64173 states and 65847 transitions. [2025-03-16 15:24:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1582 [2025-03-16 15:24:31,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:31,952 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:24:31,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:24:31,953 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:31,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:31,953 INFO L85 PathProgramCache]: Analyzing trace with hash 46079896, now seen corresponding path program 1 times [2025-03-16 15:24:31,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:31,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666065581] [2025-03-16 15:24:31,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:31,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:32,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1581 statements into 1 equivalence classes. [2025-03-16 15:24:32,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1581 of 1581 statements. [2025-03-16 15:24:32,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:32,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2331 backedges. 1866 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-16 15:24:32,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:32,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666065581] [2025-03-16 15:24:32,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666065581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:32,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:32,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:32,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164503301] [2025-03-16 15:24:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:32,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:32,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:32,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:32,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:32,663 INFO L87 Difference]: Start difference. First operand 64173 states and 65847 transitions. Second operand has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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:24:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:34,079 INFO L93 Difference]: Finished difference Result 135935 states and 139628 transitions. [2025-03-16 15:24:34,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:34,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 0 states have call successors, (0), 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 1581 [2025-03-16 15:24:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:34,142 INFO L225 Difference]: With dead ends: 135935 [2025-03-16 15:24:34,142 INFO L226 Difference]: Without dead ends: 72453 [2025-03-16 15:24:34,179 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:24:34,180 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 343 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:34,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 196 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:24:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72453 states. [2025-03-16 15:24:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72453 to 71073. [2025-03-16 15:24:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71073 states, 71072 states have (on average 1.0223435389464206) internal successors, (72660), 71072 states have internal predecessors, (72660), 0 states have call successors, (0), 0 states 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:24:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71073 states to 71073 states and 72660 transitions. [2025-03-16 15:24:34,730 INFO L78 Accepts]: Start accepts. Automaton has 71073 states and 72660 transitions. Word has length 1581 [2025-03-16 15:24:34,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:34,731 INFO L471 AbstractCegarLoop]: Abstraction has 71073 states and 72660 transitions. [2025-03-16 15:24:34,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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:24:34,731 INFO L276 IsEmpty]: Start isEmpty. Operand 71073 states and 72660 transitions. [2025-03-16 15:24:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1905 [2025-03-16 15:24:34,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:34,767 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:34,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:24:34,767 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:34,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:34,768 INFO L85 PathProgramCache]: Analyzing trace with hash -270604377, now seen corresponding path program 1 times [2025-03-16 15:24:34,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:34,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955885056] [2025-03-16 15:24:34,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:34,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:34,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1904 statements into 1 equivalence classes. [2025-03-16 15:24:34,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1904 of 1904 statements. [2025-03-16 15:24:34,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:34,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:36,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 2592 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2025-03-16 15:24:36,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:36,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955885056] [2025-03-16 15:24:36,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955885056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:36,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:36,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:36,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336360915] [2025-03-16 15:24:36,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:36,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:36,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:36,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:36,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:36,212 INFO L87 Difference]: Start difference. First operand 71073 states and 72660 transitions. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states 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:24:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:37,770 INFO L93 Difference]: Finished difference Result 158705 states and 162425 transitions. [2025-03-16 15:24:37,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:37,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 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 1904 [2025-03-16 15:24:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:37,856 INFO L225 Difference]: With dead ends: 158705 [2025-03-16 15:24:37,856 INFO L226 Difference]: Without dead ends: 88323 [2025-03-16 15:24:37,898 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:24:37,898 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 365 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:37,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 153 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1745 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:24:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88323 states. [2025-03-16 15:24:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88323 to 86253. [2025-03-16 15:24:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86253 states, 86252 states have (on average 1.0226661410749895) internal successors, (88207), 86252 states have internal predecessors, (88207), 0 states have call successors, (0), 0 states 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:24:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86253 states to 86253 states and 88207 transitions. [2025-03-16 15:24:38,578 INFO L78 Accepts]: Start accepts. Automaton has 86253 states and 88207 transitions. Word has length 1904 [2025-03-16 15:24:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:38,579 INFO L471 AbstractCegarLoop]: Abstraction has 86253 states and 88207 transitions. [2025-03-16 15:24:38,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states 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:24:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 86253 states and 88207 transitions. [2025-03-16 15:24:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1940 [2025-03-16 15:24:38,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:38,619 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, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:38,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:24:38,620 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:38,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1513566752, now seen corresponding path program 1 times [2025-03-16 15:24:38,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:38,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566865144] [2025-03-16 15:24:38,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:38,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:38,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1939 statements into 1 equivalence classes. [2025-03-16 15:24:38,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1939 of 1939 statements. [2025-03-16 15:24:38,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:38,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2164 proven. 0 refuted. 0 times theorem prover too weak. 2597 trivial. 0 not checked. [2025-03-16 15:24:39,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:39,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566865144] [2025-03-16 15:24:39,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566865144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:39,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:39,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:39,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355253679] [2025-03-16 15:24:39,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:39,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:39,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:39,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:39,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:39,472 INFO L87 Difference]: Start difference. First operand 86253 states and 88207 transitions. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states 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:24:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:40,932 INFO L93 Difference]: Finished difference Result 184233 states and 188413 transitions. [2025-03-16 15:24:40,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:40,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 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 1939 [2025-03-16 15:24:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:40,937 INFO L225 Difference]: With dead ends: 184233 [2025-03-16 15:24:40,937 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:24:40,993 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:24:40,995 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 459 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:40,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 834 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:24:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:24:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:24:40,996 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:24:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:24:40,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1939 [2025-03-16 15:24:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:40,996 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:24:40,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states 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:24:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:24:40,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:24:41,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:24:41,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:24:41,005 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:24:41,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:24:43,089 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:24:43,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:24:43 BoogieIcfgContainer [2025-03-16 15:24:43,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:24:43,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:24:43,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:24:43,107 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:24:43,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:23:41" (3/4) ... [2025-03-16 15:24:43,111 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:24:43,149 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-16 15:24:43,153 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:24:43,156 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:24:43,160 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:24:43,339 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:24:43,340 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:24:43,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:24:43,341 INFO L158 Benchmark]: Toolchain (without parser) took 66026.88ms. Allocated memory was 201.3MB in the beginning and 813.7MB in the end (delta: 612.4MB). Free memory was 145.0MB in the beginning and 605.4MB in the end (delta: -460.4MB). Peak memory consumption was 151.3MB. Max. memory is 16.1GB. [2025-03-16 15:24:43,341 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:24:43,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 809.47ms. Allocated memory is still 201.3MB. Free memory was 145.0MB in the beginning and 126.0MB in the end (delta: 19.0MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. [2025-03-16 15:24:43,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 168.71ms. Allocated memory is still 201.3MB. Free memory was 126.0MB in the beginning and 85.0MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 15:24:43,342 INFO L158 Benchmark]: Boogie Preprocessor took 279.02ms. Allocated memory is still 201.3MB. Free memory was 85.0MB in the beginning and 105.9MB in the end (delta: -20.9MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2025-03-16 15:24:43,342 INFO L158 Benchmark]: IcfgBuilder took 2772.24ms. Allocated memory was 201.3MB in the beginning and 335.5MB in the end (delta: 134.2MB). Free memory was 105.9MB in the beginning and 141.1MB in the end (delta: -35.2MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. [2025-03-16 15:24:43,342 INFO L158 Benchmark]: TraceAbstraction took 61757.94ms. Allocated memory was 335.5MB in the beginning and 813.7MB in the end (delta: 478.2MB). Free memory was 141.1MB in the beginning and 652.5MB in the end (delta: -511.4MB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-03-16 15:24:43,343 INFO L158 Benchmark]: Witness Printer took 233.65ms. Allocated memory is still 813.7MB. Free memory was 652.5MB in the beginning and 605.4MB in the end (delta: 47.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-16 15:24:43,343 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.19ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 809.47ms. Allocated memory is still 201.3MB. Free memory was 145.0MB in the beginning and 126.0MB in the end (delta: 19.0MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 168.71ms. Allocated memory is still 201.3MB. Free memory was 126.0MB in the beginning and 85.0MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 279.02ms. Allocated memory is still 201.3MB. Free memory was 85.0MB in the beginning and 105.9MB in the end (delta: -20.9MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * IcfgBuilder took 2772.24ms. Allocated memory was 201.3MB in the beginning and 335.5MB in the end (delta: 134.2MB). Free memory was 105.9MB in the beginning and 141.1MB in the end (delta: -35.2MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. * TraceAbstraction took 61757.94ms. Allocated memory was 335.5MB in the beginning and 813.7MB in the end (delta: 478.2MB). Free memory was 141.1MB in the beginning and 652.5MB in the end (delta: -511.4MB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 233.65ms. Allocated memory is still 813.7MB. Free memory was 652.5MB in the beginning and 605.4MB in the end (delta: 47.1MB). Peak memory consumption was 50.3MB. 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: 142]: 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: 59.6s, OverallIterations: 22, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 37.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16007 SdHoareTripleChecker+Valid, 31.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16007 mSDsluCounter, 13503 SdHoareTripleChecker+Invalid, 25.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 8947 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43898 IncrementalHoareTripleChecker+Invalid, 52845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8947 mSolverCounterUnsat, 13350 mSDtfsCounter, 43898 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1323 GetRequests, 1290 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86253occurred in iteration=21, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 13234 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 25235 NumberOfCodeBlocks, 25235 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 25212 ConstructedInterpolants, 0 QuantifiedInterpolants, 44360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1445 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 23 InterpolantComputations, 22 PerfectInterpolantSequences, 33905/34599 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: ((((((((((((((((((((((a18 <= 11) && (a24 <= 3)) && (a15 == 6)) || (((a18 <= 10) && (a15 <= 4)) && (a24 <= 3))) || ((((a24 != 1) && (5 == a15)) && (a18 <= 11)) && (a24 <= 3))) || ((((5 == a15) && (307 <= a3)) && (a18 <= 11)) && (a24 <= 3))) || (((5 == a15) && (a18 <= 11)) && (a24 == 4))) || ((((a24 == 1) && (168 <= a3)) && (a15 <= 4)) && (a18 <= 11))) || ((((a24 == 1) && (5 == a15)) && (168 <= a3)) && (a18 == 12))) || ((a24 == 0) && (a15 <= 4))) || (((a24 <= 3) && (a18 == 12)) && (a15 == 6))) || ((((a24 != 1) && (a15 <= 4)) && (a18 <= 11)) && (a24 <= 3))) || ((((a24 == 1) && (5 == a15)) && (a18 == 12)) && (a3 <= 99))) || (((a18 <= 10) && (a24 == 1)) && (5 == a15))) || ((((a24 != 1) && (5 == a15)) && (a24 <= 3)) && (a18 == 12))) || (((307 <= a3) && (a15 <= 4)) && (a24 <= 1))) || ((((a24 == 1) && (5 == a15)) && (a18 <= 11)) && (a3 <= 99))) || (((a15 <= 4) && (a18 == 12)) && (a24 == 4))) || (((a15 <= 4) && (a24 <= 3)) && (a18 == 12))) || ((((a3 <= 306) && (5 == a15)) && (a18 == 12)) && (a24 == 4))) || (((a15 <= 4) && (a18 <= 11)) && (a24 == 4))) || (((a24 == 1) && (a15 == 6)) && (a3 <= 99))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:24:43,359 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