./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label28.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/Problem16_label28.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b327f04e85816300a772fdcab90c62f95ac5a620d1563dfbe08b64473c277d33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:13:31,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:13:31,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:13:31,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:13:31,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:13:31,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:13:31,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:13:31,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:13:31,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:13:31,664 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:13:31,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:13:31,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:13:31,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:13:31,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:13:31,665 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:13:31,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:13:31,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:13:31,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:13:31,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:13:31,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:13:31,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:13:31,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:13:31,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:13:31,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:13:31,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:13:31,667 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 -> b327f04e85816300a772fdcab90c62f95ac5a620d1563dfbe08b64473c277d33 [2025-03-16 15:13:31,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:13:31,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:13:31,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:13:31,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:13:31,884 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:13:31,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label28.c [2025-03-16 15:13:32,997 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/402bb6947/dbae8c5321fc4bd6b1620f72a3e437c5/FLAGe8b1e5fdd [2025-03-16 15:13:33,312 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:13:33,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label28.c [2025-03-16 15:13:33,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/402bb6947/dbae8c5321fc4bd6b1620f72a3e437c5/FLAGe8b1e5fdd [2025-03-16 15:13:33,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/402bb6947/dbae8c5321fc4bd6b1620f72a3e437c5 [2025-03-16 15:13:33,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:13:33,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:13:33,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:13:33,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:13:33,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:13:33,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:13:33" (1/1) ... [2025-03-16 15:13:33,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bc32e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:33, skipping insertion in model container [2025-03-16 15:13:33,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:13:33" (1/1) ... [2025-03-16 15:13:33,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:13:33,758 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/Problem16_label28.c[6890,6903] [2025-03-16 15:13:33,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:13:33,951 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:13:33,970 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/Problem16_label28.c[6890,6903] [2025-03-16 15:13:34,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:13:34,065 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:13:34,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:34 WrapperNode [2025-03-16 15:13:34,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:13:34,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:13:34,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:13:34,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:13:34,071 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:13:34" (1/1) ... [2025-03-16 15:13:34,096 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:13:34" (1/1) ... [2025-03-16 15:13:34,191 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-16 15:13:34,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:13:34,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:13:34,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:13:34,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:13:34,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:34" (1/1) ... [2025-03-16 15:13:34,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:34" (1/1) ... [2025-03-16 15:13:34,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:34" (1/1) ... [2025-03-16 15:13:34,308 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:13:34,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:34" (1/1) ... [2025-03-16 15:13:34,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:34" (1/1) ... [2025-03-16 15:13:34,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:34" (1/1) ... [2025-03-16 15:13:34,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:34" (1/1) ... [2025-03-16 15:13:34,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:34" (1/1) ... [2025-03-16 15:13:34,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:34" (1/1) ... [2025-03-16 15:13:34,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:13:34,388 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:13:34,388 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:13:34,389 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:13:34,389 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:34" (1/1) ... [2025-03-16 15:13:34,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:13:34,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:34,413 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:13:34,419 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:13:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:13:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:13:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:13:34,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:13:34,485 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:13:34,487 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:13:36,071 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-16 15:13:36,135 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-16 15:13:36,136 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:13:36,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:13:36,155 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:13:36,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:13:36 BoogieIcfgContainer [2025-03-16 15:13:36,156 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:13:36,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:13:36,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:13:36,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:13:36,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:13:33" (1/3) ... [2025-03-16 15:13:36,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6983b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:13:36, skipping insertion in model container [2025-03-16 15:13:36,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:34" (2/3) ... [2025-03-16 15:13:36,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6983b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:13:36, skipping insertion in model container [2025-03-16 15:13:36,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:13:36" (3/3) ... [2025-03-16 15:13:36,164 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label28.c [2025-03-16 15:13:36,175 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:13:36,177 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label28.c that has 1 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:13:36,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:13:36,243 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;@518c939, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:13:36,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:13:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:13:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 15:13:36,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:36,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:36,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:36,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:36,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1341128742, now seen corresponding path program 1 times [2025-03-16 15:13:36,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:36,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526031120] [2025-03-16 15:13:36,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:36,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:36,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 15:13:36,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 15:13:36,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:36,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:36,374 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:13:36,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:36,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526031120] [2025-03-16 15:13:36,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526031120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:36,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:36,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:13:36,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694775742] [2025-03-16 15:13:36,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:36,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:13:36,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:36,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:13:36,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:13:36,395 INFO L87 Difference]: Start difference. First operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 0 states have call successors, (0), 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 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:13:36,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:36,426 INFO L93 Difference]: Finished difference Result 669 states and 1321 transitions. [2025-03-16 15:13:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:13:36,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 15:13:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:36,438 INFO L225 Difference]: With dead ends: 669 [2025-03-16 15:13:36,438 INFO L226 Difference]: Without dead ends: 332 [2025-03-16 15:13:36,441 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:13:36,442 INFO L435 NwaCegarLoop]: 599 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, 599 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:13:36,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:13:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-16 15:13:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-16 15:13:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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:13:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2025-03-16 15:13:36,482 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 65 [2025-03-16 15:13:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:36,482 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2025-03-16 15:13:36,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:13:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2025-03-16 15:13:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 15:13:36,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:36,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:36,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:13:36,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:36,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash -240649242, now seen corresponding path program 1 times [2025-03-16 15:13:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:36,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870168148] [2025-03-16 15:13:36,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:36,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 15:13:36,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 15:13:36,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:36,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:36,721 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:13:36,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:36,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870168148] [2025-03-16 15:13:36,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870168148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:36,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:36,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:13:36,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616985714] [2025-03-16 15:13:36,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:36,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:36,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:36,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:36,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:36,724 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:13:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:37,972 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2025-03-16 15:13:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:37,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 15:13:37,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:37,975 INFO L225 Difference]: With dead ends: 992 [2025-03-16 15:13:37,975 INFO L226 Difference]: Without dead ends: 661 [2025-03-16 15:13:37,977 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:13:37,978 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 305 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:37,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 200 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:13:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-16 15:13:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2025-03-16 15:13:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5196969696969698) internal successors, (1003), 660 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states 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:13:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1003 transitions. [2025-03-16 15:13:38,007 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1003 transitions. Word has length 65 [2025-03-16 15:13:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:38,007 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1003 transitions. [2025-03-16 15:13:38,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:13:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1003 transitions. [2025-03-16 15:13:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 15:13:38,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:38,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:38,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:13:38,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:38,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:38,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1482018096, now seen corresponding path program 1 times [2025-03-16 15:13:38,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:38,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982834708] [2025-03-16 15:13:38,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:38,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 15:13:38,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 15:13:38,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:38,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:13:38,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:38,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982834708] [2025-03-16 15:13:38,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982834708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:38,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:38,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:38,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587913485] [2025-03-16 15:13:38,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:38,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:13:38,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:38,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:13:38,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:38,339 INFO L87 Difference]: Start difference. First operand 661 states and 1003 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:39,919 INFO L93 Difference]: Finished difference Result 2308 states and 3413 transitions. [2025-03-16 15:13:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:13:39,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 15:13:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:39,925 INFO L225 Difference]: With dead ends: 2308 [2025-03-16 15:13:39,925 INFO L226 Difference]: Without dead ends: 1648 [2025-03-16 15:13:39,926 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:13:39,926 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1007 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:39,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 41 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:13:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-16 15:13:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2025-03-16 15:13:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.4019429265330905) internal successors, (2309), 1647 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states 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:13:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2309 transitions. [2025-03-16 15:13:39,958 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2309 transitions. Word has length 133 [2025-03-16 15:13:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:39,958 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2309 transitions. [2025-03-16 15:13:39,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2309 transitions. [2025-03-16 15:13:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-16 15:13:39,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:39,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:13:39,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:13:39,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:39,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash 232904014, now seen corresponding path program 1 times [2025-03-16 15:13:39,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:39,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958584079] [2025-03-16 15:13:39,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:39,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:39,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 15:13:40,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 15:13:40,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:40,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:13:40,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:40,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958584079] [2025-03-16 15:13:40,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958584079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:40,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:40,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:13:40,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136518362] [2025-03-16 15:13:40,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:40,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:40,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:40,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:40,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:40,147 INFO L87 Difference]: Start difference. First operand 1648 states and 2309 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states 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:13:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:41,157 INFO L93 Difference]: Finished difference Result 3624 states and 5241 transitions. [2025-03-16 15:13:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:41,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 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 196 [2025-03-16 15:13:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:41,164 INFO L225 Difference]: With dead ends: 3624 [2025-03-16 15:13:41,164 INFO L226 Difference]: Without dead ends: 2306 [2025-03-16 15:13:41,165 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:13:41,168 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:41,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 76 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:13:41,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-16 15:13:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2306. [2025-03-16 15:13:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.350108459869848) internal successors, (3112), 2305 states have internal predecessors, (3112), 0 states have call successors, (0), 0 states 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:13:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3112 transitions. [2025-03-16 15:13:41,200 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3112 transitions. Word has length 196 [2025-03-16 15:13:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:41,200 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 3112 transitions. [2025-03-16 15:13:41,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states 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:13:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3112 transitions. [2025-03-16 15:13:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 15:13:41,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:41,204 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:41,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:13:41,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:41,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:41,205 INFO L85 PathProgramCache]: Analyzing trace with hash 377100346, now seen corresponding path program 1 times [2025-03-16 15:13:41,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:41,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762358520] [2025-03-16 15:13:41,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:41,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:41,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 15:13:41,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 15:13:41,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:41,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 15:13:41,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:41,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762358520] [2025-03-16 15:13:41,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762358520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:41,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:41,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:13:41,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570828978] [2025-03-16 15:13:41,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:41,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:41,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:41,368 INFO L87 Difference]: Start difference. First operand 2306 states and 3112 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:13:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:42,288 INFO L93 Difference]: Finished difference Result 5598 states and 7698 transitions. [2025-03-16 15:13:42,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:42,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 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 231 [2025-03-16 15:13:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:42,298 INFO L225 Difference]: With dead ends: 5598 [2025-03-16 15:13:42,298 INFO L226 Difference]: Without dead ends: 3622 [2025-03-16 15:13:42,300 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:13:42,301 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:42,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 154 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:13:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-03-16 15:13:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 2964. [2025-03-16 15:13:42,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2964 states, 2963 states have (on average 1.2443469456631793) internal successors, (3687), 2963 states have internal predecessors, (3687), 0 states have call successors, (0), 0 states 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:13:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 3687 transitions. [2025-03-16 15:13:42,358 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 3687 transitions. Word has length 231 [2025-03-16 15:13:42,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:42,359 INFO L471 AbstractCegarLoop]: Abstraction has 2964 states and 3687 transitions. [2025-03-16 15:13:42,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:13:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 3687 transitions. [2025-03-16 15:13:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-16 15:13:42,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:42,361 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:42,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:13:42,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:42,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:42,362 INFO L85 PathProgramCache]: Analyzing trace with hash -912298752, now seen corresponding path program 1 times [2025-03-16 15:13:42,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:42,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732767329] [2025-03-16 15:13:42,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:42,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-16 15:13:42,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-16 15:13:42,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:42,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:13:42,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:42,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732767329] [2025-03-16 15:13:42,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732767329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:42,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:42,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683013133] [2025-03-16 15:13:42,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:42,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:42,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:42,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:42,514 INFO L87 Difference]: Start difference. First operand 2964 states and 3687 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states 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:13:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:43,409 INFO L93 Difference]: Finished difference Result 6914 states and 8656 transitions. [2025-03-16 15:13:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:43,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2025-03-16 15:13:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:43,417 INFO L225 Difference]: With dead ends: 6914 [2025-03-16 15:13:43,417 INFO L226 Difference]: Without dead ends: 3622 [2025-03-16 15:13:43,421 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:13:43,421 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 286 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:43,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 538 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:13:43,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-03-16 15:13:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3622. [2025-03-16 15:13:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3621 states have (on average 1.076222038111019) internal successors, (3897), 3621 states have internal predecessors, (3897), 0 states have call successors, (0), 0 states 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:13:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 3897 transitions. [2025-03-16 15:13:43,494 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 3897 transitions. Word has length 248 [2025-03-16 15:13:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:43,494 INFO L471 AbstractCegarLoop]: Abstraction has 3622 states and 3897 transitions. [2025-03-16 15:13:43,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states 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:13:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 3897 transitions. [2025-03-16 15:13:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-16 15:13:43,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:43,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:13:43,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:13:43,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:43,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1449235126, now seen corresponding path program 1 times [2025-03-16 15:13:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:43,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784803341] [2025-03-16 15:13:43,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:43,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:43,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-16 15:13:43,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-16 15:13:43,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:43,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:13:43,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:43,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784803341] [2025-03-16 15:13:43,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784803341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:43,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:43,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:43,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961333477] [2025-03-16 15:13:43,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:43,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:43,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:43,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:43,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:43,662 INFO L87 Difference]: Start difference. First operand 3622 states and 3897 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:13:44,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:44,352 INFO L93 Difference]: Finished difference Result 8230 states and 8904 transitions. [2025-03-16 15:13:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:44,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 300 [2025-03-16 15:13:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:44,362 INFO L225 Difference]: With dead ends: 8230 [2025-03-16 15:13:44,362 INFO L226 Difference]: Without dead ends: 4938 [2025-03-16 15:13:44,364 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:13:44,365 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 275 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:44,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 67 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:13:44,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2025-03-16 15:13:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4938. [2025-03-16 15:13:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4937 states have (on average 1.065424346769293) internal successors, (5260), 4937 states have internal predecessors, (5260), 0 states have call successors, (0), 0 states 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:13:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 5260 transitions. [2025-03-16 15:13:44,437 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 5260 transitions. Word has length 300 [2025-03-16 15:13:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:44,437 INFO L471 AbstractCegarLoop]: Abstraction has 4938 states and 5260 transitions. [2025-03-16 15:13:44,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:13:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 5260 transitions. [2025-03-16 15:13:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-03-16 15:13:44,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:44,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:44,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:13:44,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:44,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1146479630, now seen corresponding path program 1 times [2025-03-16 15:13:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:44,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185394388] [2025-03-16 15:13:44,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:44,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:44,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-03-16 15:13:44,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-03-16 15:13:44,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:44,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-16 15:13:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:44,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185394388] [2025-03-16 15:13:44,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185394388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:44,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:44,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:13:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281707569] [2025-03-16 15:13:44,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:44,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:44,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:44,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:44,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:44,727 INFO L87 Difference]: Start difference. First operand 4938 states and 5260 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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:13:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:45,505 INFO L93 Difference]: Finished difference Result 13496 states and 14436 transitions. [2025-03-16 15:13:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:45,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 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 396 [2025-03-16 15:13:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:45,524 INFO L225 Difference]: With dead ends: 13496 [2025-03-16 15:13:45,524 INFO L226 Difference]: Without dead ends: 8888 [2025-03-16 15:13:45,529 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:13:45,530 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 99 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:45,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 60 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:13:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8888 states. [2025-03-16 15:13:45,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8888 to 8886. [2025-03-16 15:13:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8886 states, 8885 states have (on average 1.0646032639279686) internal successors, (9459), 8885 states have internal predecessors, (9459), 0 states have call successors, (0), 0 states 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:13:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 9459 transitions. [2025-03-16 15:13:45,634 INFO L78 Accepts]: Start accepts. Automaton has 8886 states and 9459 transitions. Word has length 396 [2025-03-16 15:13:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:45,634 INFO L471 AbstractCegarLoop]: Abstraction has 8886 states and 9459 transitions. [2025-03-16 15:13:45,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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:13:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 8886 states and 9459 transitions. [2025-03-16 15:13:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-16 15:13:45,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:45,640 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:45,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:13:45,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:45,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash -88485638, now seen corresponding path program 1 times [2025-03-16 15:13:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:45,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8655004] [2025-03-16 15:13:45,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:45,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-16 15:13:45,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-16 15:13:45,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:45,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-16 15:13:45,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:45,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8655004] [2025-03-16 15:13:45,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8655004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:45,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860229519] [2025-03-16 15:13:45,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:45,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:45,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:45,981 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:13:45,983 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:13:46,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-16 15:13:46,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-16 15:13:46,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:46,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:46,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:13:46,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-16 15:13:46,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:46,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860229519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:46,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:46,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 15:13:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304494442] [2025-03-16 15:13:46,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:46,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:46,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:46,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:13:46,508 INFO L87 Difference]: Start difference. First operand 8886 states and 9459 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:13:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:47,086 INFO L93 Difference]: Finished difference Result 10533 states and 11155 transitions. [2025-03-16 15:13:47,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:47,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 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 404 [2025-03-16 15:13:47,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:47,111 INFO L225 Difference]: With dead ends: 10533 [2025-03-16 15:13:47,111 INFO L226 Difference]: Without dead ends: 10531 [2025-03-16 15:13:47,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:13:47,115 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:47,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 74 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:47,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10531 states. [2025-03-16 15:13:47,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10531 to 9544. [2025-03-16 15:13:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9544 states, 9543 states have (on average 1.0625589437283873) internal successors, (10140), 9543 states have internal predecessors, (10140), 0 states have call successors, (0), 0 states 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:13:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9544 states to 9544 states and 10140 transitions. [2025-03-16 15:13:47,217 INFO L78 Accepts]: Start accepts. Automaton has 9544 states and 10140 transitions. Word has length 404 [2025-03-16 15:13:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:47,219 INFO L471 AbstractCegarLoop]: Abstraction has 9544 states and 10140 transitions. [2025-03-16 15:13:47,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:13:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 9544 states and 10140 transitions. [2025-03-16 15:13:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2025-03-16 15:13:47,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:47,230 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:13:47,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:13:47,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:47,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:47,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash -371112059, now seen corresponding path program 1 times [2025-03-16 15:13:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468412956] [2025-03-16 15:13:47,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:47,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:47,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 960 statements into 1 equivalence classes. [2025-03-16 15:13:47,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 960 of 960 statements. [2025-03-16 15:13:47,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:47,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2079 backedges. 1469 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-16 15:13:48,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:48,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468412956] [2025-03-16 15:13:48,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468412956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:48,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:48,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:48,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367178406] [2025-03-16 15:13:48,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:48,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:48,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:48,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:48,071 INFO L87 Difference]: Start difference. First operand 9544 states and 10140 transitions. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:13:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:48,693 INFO L93 Difference]: Finished difference Result 21719 states and 23152 transitions. [2025-03-16 15:13:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:48,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 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 960 [2025-03-16 15:13:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:48,713 INFO L225 Difference]: With dead ends: 21719 [2025-03-16 15:13:48,713 INFO L226 Difference]: Without dead ends: 12505 [2025-03-16 15:13:48,721 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:13:48,721 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 222 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:48,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 35 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2025-03-16 15:13:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 12505. [2025-03-16 15:13:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12505 states, 12504 states have (on average 1.0621401151631478) internal successors, (13281), 12504 states have internal predecessors, (13281), 0 states have call successors, (0), 0 states 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:13:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12505 states to 12505 states and 13281 transitions. [2025-03-16 15:13:48,830 INFO L78 Accepts]: Start accepts. Automaton has 12505 states and 13281 transitions. Word has length 960 [2025-03-16 15:13:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:48,830 INFO L471 AbstractCegarLoop]: Abstraction has 12505 states and 13281 transitions. [2025-03-16 15:13:48,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:13:48,831 INFO L276 IsEmpty]: Start isEmpty. Operand 12505 states and 13281 transitions. [2025-03-16 15:13:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1058 [2025-03-16 15:13:48,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:48,845 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:48,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:13:48,845 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:48,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:48,846 INFO L85 PathProgramCache]: Analyzing trace with hash 128234643, now seen corresponding path program 1 times [2025-03-16 15:13:48,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:48,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306341270] [2025-03-16 15:13:48,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:48,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:48,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1057 statements into 1 equivalence classes. [2025-03-16 15:13:48,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1057 of 1057 statements. [2025-03-16 15:13:48,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:48,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2019 backedges. 1089 proven. 0 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2025-03-16 15:13:49,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:49,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306341270] [2025-03-16 15:13:49,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306341270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:49,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:49,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:13:49,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596295503] [2025-03-16 15:13:49,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:49,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:49,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:49,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:49,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:49,586 INFO L87 Difference]: Start difference. First operand 12505 states and 13281 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 2 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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:13:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:50,126 INFO L93 Difference]: Finished difference Result 25009 states and 26567 transitions. [2025-03-16 15:13:50,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:50,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 2 states have internal predecessors, (521), 0 states have call successors, (0), 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 1057 [2025-03-16 15:13:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:50,146 INFO L225 Difference]: With dead ends: 25009 [2025-03-16 15:13:50,147 INFO L226 Difference]: Without dead ends: 12834 [2025-03-16 15:13:50,156 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:13:50,157 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:50,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 101 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:50,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12834 states. [2025-03-16 15:13:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12834 to 12834. [2025-03-16 15:13:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.0610924959089847) internal successors, (13617), 12833 states have internal predecessors, (13617), 0 states have call successors, (0), 0 states 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:13:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 13617 transitions. [2025-03-16 15:13:50,272 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 13617 transitions. Word has length 1057 [2025-03-16 15:13:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:50,272 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 13617 transitions. [2025-03-16 15:13:50,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 2 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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:13:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 13617 transitions. [2025-03-16 15:13:50,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2025-03-16 15:13:50,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:50,286 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:50,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:13:50,286 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:50,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:50,287 INFO L85 PathProgramCache]: Analyzing trace with hash 755110695, now seen corresponding path program 1 times [2025-03-16 15:13:50,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:50,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509899679] [2025-03-16 15:13:50,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:50,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:50,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1065 statements into 1 equivalence classes. [2025-03-16 15:13:50,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1065 of 1065 statements. [2025-03-16 15:13:50,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:50,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 1469 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2025-03-16 15:13:50,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:50,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509899679] [2025-03-16 15:13:50,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509899679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:50,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:50,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:50,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175042906] [2025-03-16 15:13:50,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:50,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:50,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:50,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:50,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:50,851 INFO L87 Difference]: Start difference. First operand 12834 states and 13617 transitions. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:51,425 INFO L93 Difference]: Finished difference Result 27970 states and 29769 transitions. [2025-03-16 15:13:51,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:51,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1065 [2025-03-16 15:13:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:51,448 INFO L225 Difference]: With dead ends: 27970 [2025-03-16 15:13:51,448 INFO L226 Difference]: Without dead ends: 15795 [2025-03-16 15:13:51,457 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:13:51,458 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:51,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 431 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15795 states. [2025-03-16 15:13:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15795 to 14808. [2025-03-16 15:13:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.0552441412845275) internal successors, (15625), 14807 states have internal predecessors, (15625), 0 states have call successors, (0), 0 states 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:13:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15625 transitions. [2025-03-16 15:13:51,584 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15625 transitions. Word has length 1065 [2025-03-16 15:13:51,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:51,585 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15625 transitions. [2025-03-16 15:13:51,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15625 transitions. [2025-03-16 15:13:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2025-03-16 15:13:51,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:51,598 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:51,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:13:51,598 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2087884655, now seen corresponding path program 1 times [2025-03-16 15:13:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:51,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467219756] [2025-03-16 15:13:51,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:51,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1066 statements into 1 equivalence classes. [2025-03-16 15:13:51,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1066 of 1066 statements. [2025-03-16 15:13:51,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:51,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 1316 proven. 0 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2025-03-16 15:13:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:52,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467219756] [2025-03-16 15:13:52,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467219756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:52,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:52,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 15:13:52,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732227588] [2025-03-16 15:13:52,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:52,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:13:52,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:52,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:13:52,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:52,461 INFO L87 Difference]: Start difference. First operand 14808 states and 15625 transitions. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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:13:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:53,658 INFO L93 Difference]: Finished difference Result 28958 states and 30583 transitions. [2025-03-16 15:13:53,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 15:13:53,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 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 1066 [2025-03-16 15:13:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:53,685 INFO L225 Difference]: With dead ends: 28958 [2025-03-16 15:13:53,685 INFO L226 Difference]: Without dead ends: 14809 [2025-03-16 15:13:53,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:13:53,697 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 417 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:53,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 567 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:13:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2025-03-16 15:13:53,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14808. [2025-03-16 15:13:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.053758357533599) internal successors, (15603), 14807 states have internal predecessors, (15603), 0 states have call successors, (0), 0 states 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:13:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15603 transitions. [2025-03-16 15:13:53,876 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15603 transitions. Word has length 1066 [2025-03-16 15:13:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:53,876 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15603 transitions. [2025-03-16 15:13:53,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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:13:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15603 transitions. [2025-03-16 15:13:53,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1081 [2025-03-16 15:13:53,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:53,889 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:53,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:13:53,890 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:53,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:53,890 INFO L85 PathProgramCache]: Analyzing trace with hash 690870006, now seen corresponding path program 1 times [2025-03-16 15:13:53,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:53,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509878470] [2025-03-16 15:13:53,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:53,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1080 statements into 1 equivalence classes. [2025-03-16 15:13:53,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1080 of 1080 statements. [2025-03-16 15:13:53,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:53,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1887 backedges. 1200 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-16 15:13:54,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:54,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509878470] [2025-03-16 15:13:54,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509878470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:54,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:54,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:13:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562187992] [2025-03-16 15:13:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:54,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:13:54,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:54,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:13:54,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:54,876 INFO L87 Difference]: Start difference. First operand 14808 states and 15603 transitions. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:55,663 INFO L93 Difference]: Finished difference Result 28967 states and 30548 transitions. [2025-03-16 15:13:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:13:55,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1080 [2025-03-16 15:13:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:55,682 INFO L225 Difference]: With dead ends: 28967 [2025-03-16 15:13:55,682 INFO L226 Difference]: Without dead ends: 14818 [2025-03-16 15:13:55,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:13:55,689 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:55,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 441 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:13:55,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14818 states. [2025-03-16 15:13:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14818 to 14479. [2025-03-16 15:13:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14479 states, 14478 states have (on average 1.054358336786849) internal successors, (15265), 14478 states have internal predecessors, (15265), 0 states have call successors, (0), 0 states 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:13:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 15265 transitions. [2025-03-16 15:13:55,798 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 15265 transitions. Word has length 1080 [2025-03-16 15:13:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:55,798 INFO L471 AbstractCegarLoop]: Abstraction has 14479 states and 15265 transitions. [2025-03-16 15:13:55,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 15265 transitions. [2025-03-16 15:13:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2025-03-16 15:13:55,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:55,810 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:55,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:13:55,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:55,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1951471871, now seen corresponding path program 1 times [2025-03-16 15:13:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:55,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376415865] [2025-03-16 15:13:55,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:55,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:55,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1095 statements into 1 equivalence classes. [2025-03-16 15:13:55,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1095 of 1095 statements. [2025-03-16 15:13:55,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:55,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2127 backedges. 1559 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-03-16 15:13:56,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:56,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376415865] [2025-03-16 15:13:56,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376415865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:56,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:56,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:56,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976374708] [2025-03-16 15:13:56,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:56,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:56,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:56,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:56,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:56,196 INFO L87 Difference]: Start difference. First operand 14479 states and 15265 transitions. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:56,847 INFO L93 Difference]: Finished difference Result 28299 states and 29862 transitions. [2025-03-16 15:13:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:56,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1095 [2025-03-16 15:13:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:56,868 INFO L225 Difference]: With dead ends: 28299 [2025-03-16 15:13:56,868 INFO L226 Difference]: Without dead ends: 14479 [2025-03-16 15:13:56,878 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:13:56,878 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 193 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:56,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 422 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14479 states. [2025-03-16 15:13:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14479 to 13821. [2025-03-16 15:13:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.043849493487699) internal successors, (14426), 13820 states have internal predecessors, (14426), 0 states have call successors, (0), 0 states 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:13:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14426 transitions. [2025-03-16 15:13:56,996 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14426 transitions. Word has length 1095 [2025-03-16 15:13:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:56,997 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14426 transitions. [2025-03-16 15:13:56,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14426 transitions. [2025-03-16 15:13:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1121 [2025-03-16 15:13:57,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:57,009 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:13:57,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:13:57,009 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:57,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1474729862, now seen corresponding path program 1 times [2025-03-16 15:13:57,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:57,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950429755] [2025-03-16 15:13:57,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:57,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:57,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1120 statements into 1 equivalence classes. [2025-03-16 15:13:57,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1120 of 1120 statements. [2025-03-16 15:13:57,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:57,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2228 backedges. 1371 proven. 0 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2025-03-16 15:13:57,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:57,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950429755] [2025-03-16 15:13:57,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950429755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:57,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:57,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:13:57,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905357078] [2025-03-16 15:13:57,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:57,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:13:57,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:57,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:13:57,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:57,721 INFO L87 Difference]: Start difference. First operand 13821 states and 14426 transitions. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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:13:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:58,386 INFO L93 Difference]: Finished difference Result 26983 states and 28184 transitions. [2025-03-16 15:13:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:13:58,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 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 1120 [2025-03-16 15:13:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:58,400 INFO L225 Difference]: With dead ends: 26983 [2025-03-16 15:13:58,401 INFO L226 Difference]: Without dead ends: 13821 [2025-03-16 15:13:58,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:13:58,410 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 120 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:58,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 560 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2025-03-16 15:13:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13821. [2025-03-16 15:13:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.0431259044862518) internal successors, (14416), 13820 states have internal predecessors, (14416), 0 states have call successors, (0), 0 states 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:13:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14416 transitions. [2025-03-16 15:13:58,522 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14416 transitions. Word has length 1120 [2025-03-16 15:13:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:58,522 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14416 transitions. [2025-03-16 15:13:58,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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:13:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14416 transitions. [2025-03-16 15:13:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2025-03-16 15:13:58,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:58,535 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:58,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:13:58,535 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:58,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:58,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1880413440, now seen corresponding path program 1 times [2025-03-16 15:13:58,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:58,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82345250] [2025-03-16 15:13:58,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:58,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:58,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1212 statements into 1 equivalence classes. [2025-03-16 15:13:58,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1212 of 1212 statements. [2025-03-16 15:13:58,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:58,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2448 backedges. 959 proven. 919 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2025-03-16 15:13:59,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:59,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82345250] [2025-03-16 15:13:59,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82345250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:59,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810941919] [2025-03-16 15:13:59,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:59,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:59,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:59,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:59,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:13:59,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1212 statements into 1 equivalence classes. [2025-03-16 15:13:59,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1212 of 1212 statements. [2025-03-16 15:13:59,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:59,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:59,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 1391 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:13:59,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:14:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2448 backedges. 1330 proven. 0 refuted. 0 times theorem prover too weak. 1118 trivial. 0 not checked. [2025-03-16 15:14:00,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:14:00,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810941919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:00,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:14:00,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:14:00,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340862256] [2025-03-16 15:14:00,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:00,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:00,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:00,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:00,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:14:00,308 INFO L87 Difference]: Start difference. First operand 13821 states and 14416 transitions. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states 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:14:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:00,831 INFO L93 Difference]: Finished difference Result 26983 states and 28164 transitions. [2025-03-16 15:14:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:00,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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 1212 [2025-03-16 15:14:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:00,842 INFO L225 Difference]: With dead ends: 26983 [2025-03-16 15:14:00,842 INFO L226 Difference]: Without dead ends: 13821 [2025-03-16 15:14:00,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1216 GetRequests, 1212 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:14:00,850 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 94 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:00,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 375 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:14:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2025-03-16 15:14:00,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13163. [2025-03-16 15:14:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.0360127640176264) internal successors, (13636), 13162 states have internal predecessors, (13636), 0 states have call successors, (0), 0 states 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:14:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13636 transitions. [2025-03-16 15:14:00,941 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13636 transitions. Word has length 1212 [2025-03-16 15:14:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:00,942 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13636 transitions. [2025-03-16 15:14:00,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states 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:14:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13636 transitions. [2025-03-16 15:14:00,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1243 [2025-03-16 15:14:00,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:00,953 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:14:00,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:14:01,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 15:14:01,153 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:01,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2093073008, now seen corresponding path program 1 times [2025-03-16 15:14:01,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:01,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944497425] [2025-03-16 15:14:01,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:01,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:01,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1242 statements into 1 equivalence classes. [2025-03-16 15:14:01,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1242 of 1242 statements. [2025-03-16 15:14:01,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:01,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 1799 proven. 0 refuted. 0 times theorem prover too weak. 1361 trivial. 0 not checked. [2025-03-16 15:14:01,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944497425] [2025-03-16 15:14:01,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944497425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:01,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:01,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:01,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785174751] [2025-03-16 15:14:01,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:01,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:01,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:01,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:01,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:01,922 INFO L87 Difference]: Start difference. First operand 13163 states and 13636 transitions. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states 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:14:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:02,447 INFO L93 Difference]: Finished difference Result 26325 states and 27273 transitions. [2025-03-16 15:14:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:02,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 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 1242 [2025-03-16 15:14:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:02,457 INFO L225 Difference]: With dead ends: 26325 [2025-03-16 15:14:02,457 INFO L226 Difference]: Without dead ends: 13821 [2025-03-16 15:14:02,463 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:14:02,464 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:02,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 436 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:14:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2025-03-16 15:14:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13821. [2025-03-16 15:14:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.03465991316932) internal successors, (14299), 13820 states have internal predecessors, (14299), 0 states have call successors, (0), 0 states 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:14:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14299 transitions. [2025-03-16 15:14:02,556 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14299 transitions. Word has length 1242 [2025-03-16 15:14:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:02,556 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14299 transitions. [2025-03-16 15:14:02,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states 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:14:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14299 transitions. [2025-03-16 15:14:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1297 [2025-03-16 15:14:02,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:02,596 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:02,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:14:02,596 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:02,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:02,598 INFO L85 PathProgramCache]: Analyzing trace with hash -950948149, now seen corresponding path program 1 times [2025-03-16 15:14:02,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:02,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132092036] [2025-03-16 15:14:02,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:02,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1296 statements into 1 equivalence classes. [2025-03-16 15:14:02,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1296 of 1296 statements. [2025-03-16 15:14:02,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:02,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3184 backedges. 2336 proven. 82 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-16 15:14:04,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:04,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132092036] [2025-03-16 15:14:04,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132092036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:14:04,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63733104] [2025-03-16 15:14:04,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:04,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:14:04,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:14:04,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:14:04,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:14:04,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1296 statements into 1 equivalence classes. [2025-03-16 15:14:04,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1296 of 1296 statements. [2025-03-16 15:14:04,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:04,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:04,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:14:04,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:14:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3184 backedges. 1604 proven. 201 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2025-03-16 15:14:06,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:14:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3184 backedges. 1604 proven. 201 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2025-03-16 15:14:09,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63733104] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:14:09,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:14:09,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-03-16 15:14:09,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146210749] [2025-03-16 15:14:09,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:14:09,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 15:14:09,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:09,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 15:14:09,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:14:09,294 INFO L87 Difference]: Start difference. First operand 13821 states and 14299 transitions. Second operand has 10 states, 10 states have (on average 187.7) internal successors, (1877), 10 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states 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:14:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:11,911 INFO L93 Difference]: Finished difference Result 27972 states and 28928 transitions. [2025-03-16 15:14:11,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 15:14:11,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 187.7) internal successors, (1877), 10 states have internal predecessors, (1877), 0 states have call successors, (0), 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 1296 [2025-03-16 15:14:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:11,925 INFO L225 Difference]: With dead ends: 27972 [2025-03-16 15:14:11,926 INFO L226 Difference]: Without dead ends: 14810 [2025-03-16 15:14:11,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2605 GetRequests, 2594 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-16 15:14:11,934 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 770 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6693 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 6693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:11,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 87 Invalid, 6813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 6693 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:14:11,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14810 states. [2025-03-16 15:14:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14810 to 13821. [2025-03-16 15:14:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.0314761215629522) internal successors, (14255), 13820 states have internal predecessors, (14255), 0 states have call successors, (0), 0 states 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:14:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14255 transitions. [2025-03-16 15:14:12,034 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14255 transitions. Word has length 1296 [2025-03-16 15:14:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:12,034 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14255 transitions. [2025-03-16 15:14:12,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 187.7) internal successors, (1877), 10 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states 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:14:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14255 transitions. [2025-03-16 15:14:12,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1391 [2025-03-16 15:14:12,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:12,047 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:12,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:14:12,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:14:12,248 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:12,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:12,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2126690506, now seen corresponding path program 1 times [2025-03-16 15:14:12,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:12,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674765471] [2025-03-16 15:14:12,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:12,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:12,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1390 statements into 1 equivalence classes. [2025-03-16 15:14:12,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1390 of 1390 statements. [2025-03-16 15:14:12,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:12,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3464 backedges. 1819 proven. 0 refuted. 0 times theorem prover too weak. 1645 trivial. 0 not checked. [2025-03-16 15:14:13,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:13,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674765471] [2025-03-16 15:14:13,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674765471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:13,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:13,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960824693] [2025-03-16 15:14:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:13,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:14:13,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:13,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:14:13,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:14:13,169 INFO L87 Difference]: Start difference. First operand 13821 states and 14255 transitions. Second operand has 4 states, 4 states have (on average 167.0) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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:14:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:13,987 INFO L93 Difference]: Finished difference Result 27641 states and 28514 transitions. [2025-03-16 15:14:13,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:14:13,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 167.0) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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 1390 [2025-03-16 15:14:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:13,999 INFO L225 Difference]: With dead ends: 27641 [2025-03-16 15:14:14,000 INFO L226 Difference]: Without dead ends: 14150 [2025-03-16 15:14:14,004 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:14:14,005 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 268 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:14,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 111 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:14:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14150 states. [2025-03-16 15:14:14,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14150 to 14150. [2025-03-16 15:14:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14150 states, 14149 states have (on average 1.0308855749522934) internal successors, (14586), 14149 states have internal predecessors, (14586), 0 states have call successors, (0), 0 states 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:14:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 14586 transitions. [2025-03-16 15:14:14,100 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 14586 transitions. Word has length 1390 [2025-03-16 15:14:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:14,100 INFO L471 AbstractCegarLoop]: Abstraction has 14150 states and 14586 transitions. [2025-03-16 15:14:14,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 167.0) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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:14:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 14586 transitions. [2025-03-16 15:14:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1454 [2025-03-16 15:14:14,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:14,114 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 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, 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:14:14,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:14:14,114 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:14,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:14,115 INFO L85 PathProgramCache]: Analyzing trace with hash 601052992, now seen corresponding path program 1 times [2025-03-16 15:14:14,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:14,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579778954] [2025-03-16 15:14:14,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:14,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:14,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1453 statements into 1 equivalence classes. [2025-03-16 15:14:14,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1453 of 1453 statements. [2025-03-16 15:14:14,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:14,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3709 backedges. 2728 proven. 170 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-03-16 15:14:15,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:15,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579778954] [2025-03-16 15:14:15,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579778954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:14:15,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058057208] [2025-03-16 15:14:15,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:15,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:14:15,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:14:15,022 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:14:15,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:14:15,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1453 statements into 1 equivalence classes. [2025-03-16 15:14:15,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1453 of 1453 statements. [2025-03-16 15:14:15,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:15,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:15,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 15:14:15,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:14:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3709 backedges. 2728 proven. 170 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-03-16 15:14:16,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:14:17,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3709 backedges. 2728 proven. 170 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-03-16 15:14:17,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058057208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:14:17,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:14:17,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-16 15:14:17,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591656690] [2025-03-16 15:14:17,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:14:17,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 15:14:17,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:17,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 15:14:17,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:14:17,770 INFO L87 Difference]: Start difference. First operand 14150 states and 14586 transitions. Second operand has 7 states, 7 states have (on average 139.71428571428572) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 0 states 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:14:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:19,591 INFO L93 Difference]: Finished difference Result 28299 states and 29179 transitions. [2025-03-16 15:14:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 15:14:19,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 139.71428571428572) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 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 1453 [2025-03-16 15:14:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:19,603 INFO L225 Difference]: With dead ends: 28299 [2025-03-16 15:14:19,603 INFO L226 Difference]: Without dead ends: 14808 [2025-03-16 15:14:19,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2911 GetRequests, 2904 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:14:19,609 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 808 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 4504 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 4554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 4504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:19,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 125 Invalid, 4554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 4504 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:14:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14808 states. [2025-03-16 15:14:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14808 to 14479. [2025-03-16 15:14:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14479 states, 14478 states have (on average 1.0275590551181102) internal successors, (14877), 14478 states have internal predecessors, (14877), 0 states have call successors, (0), 0 states 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:14:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 14877 transitions. [2025-03-16 15:14:19,706 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 14877 transitions. Word has length 1453 [2025-03-16 15:14:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:19,706 INFO L471 AbstractCegarLoop]: Abstraction has 14479 states and 14877 transitions. [2025-03-16 15:14:19,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 139.71428571428572) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 0 states 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:14:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 14877 transitions. [2025-03-16 15:14:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1479 [2025-03-16 15:14:19,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:19,720 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 4, 4, 4, 4, 4, 4, 4, 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, 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:14:19,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:14:19,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:14:19,921 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:19,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:19,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1408642475, now seen corresponding path program 1 times [2025-03-16 15:14:19,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:19,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216225068] [2025-03-16 15:14:19,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:19,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:20,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1478 statements into 1 equivalence classes. [2025-03-16 15:14:20,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1478 of 1478 statements. [2025-03-16 15:14:20,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:20,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3859 backedges. 2342 proven. 984 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2025-03-16 15:14:21,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216225068] [2025-03-16 15:14:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216225068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:14:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861264112] [2025-03-16 15:14:21,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:21,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:14:21,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:14:21,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:14:21,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:14:21,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1478 statements into 1 equivalence classes. [2025-03-16 15:14:22,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1478 of 1478 statements. [2025-03-16 15:14:22,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:22,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:22,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 1683 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:14:22,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:14:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3859 backedges. 2383 proven. 0 refuted. 0 times theorem prover too weak. 1476 trivial. 0 not checked. [2025-03-16 15:14:22,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:14:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861264112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:22,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:14:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-16 15:14:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433243229] [2025-03-16 15:14:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:22,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:22,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:22,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:14:22,301 INFO L87 Difference]: Start difference. First operand 14479 states and 14877 transitions. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:14:22,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:22,886 INFO L93 Difference]: Finished difference Result 28299 states and 29091 transitions. [2025-03-16 15:14:22,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:22,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1478 [2025-03-16 15:14:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:22,899 INFO L225 Difference]: With dead ends: 28299 [2025-03-16 15:14:22,899 INFO L226 Difference]: Without dead ends: 14479 [2025-03-16 15:14:22,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1484 GetRequests, 1478 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:14:22,910 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 65 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:22,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 416 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:14:22,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14479 states. [2025-03-16 15:14:22,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14479 to 14479. [2025-03-16 15:14:23,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14479 states, 14478 states have (on average 1.022862273794723) internal successors, (14809), 14478 states have internal predecessors, (14809), 0 states have call successors, (0), 0 states 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:14:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 14809 transitions. [2025-03-16 15:14:23,018 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 14809 transitions. Word has length 1478 [2025-03-16 15:14:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:23,019 INFO L471 AbstractCegarLoop]: Abstraction has 14479 states and 14809 transitions. [2025-03-16 15:14:23,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:14:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 14809 transitions. [2025-03-16 15:14:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1651 [2025-03-16 15:14:23,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:23,065 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:23,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:14:23,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-16 15:14:23,265 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:23,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash 612500080, now seen corresponding path program 1 times [2025-03-16 15:14:23,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:23,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481731705] [2025-03-16 15:14:23,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:23,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:23,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1650 statements into 1 equivalence classes. [2025-03-16 15:14:23,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1650 of 1650 statements. [2025-03-16 15:14:23,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:23,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5409 backedges. 2294 proven. 36 refuted. 0 times theorem prover too weak. 3079 trivial. 0 not checked. [2025-03-16 15:14:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481731705] [2025-03-16 15:14:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481731705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:14:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038623479] [2025-03-16 15:14:25,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:25,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:14:25,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:14:25,367 INFO L229 MonitoredProcess]: Starting monitored process 7 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:14:25,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:14:25,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1650 statements into 1 equivalence classes. [2025-03-16 15:14:25,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1650 of 1650 statements. [2025-03-16 15:14:25,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:25,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:25,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:14:25,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:14:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5409 backedges. 1862 proven. 0 refuted. 0 times theorem prover too weak. 3547 trivial. 0 not checked. [2025-03-16 15:14:25,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:14:25,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038623479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:25,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:14:25,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:14:25,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821374989] [2025-03-16 15:14:25,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:25,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:25,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:25,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:25,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:14:25,844 INFO L87 Difference]: Start difference. First operand 14479 states and 14809 transitions. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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:14:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:26,366 INFO L93 Difference]: Finished difference Result 28299 states and 28955 transitions. [2025-03-16 15:14:26,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:26,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 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 1650 [2025-03-16 15:14:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:26,380 INFO L225 Difference]: With dead ends: 28299 [2025-03-16 15:14:26,380 INFO L226 Difference]: Without dead ends: 14479 [2025-03-16 15:14:26,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1658 GetRequests, 1653 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:14:26,390 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 118 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:26,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 419 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:14:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14479 states. [2025-03-16 15:14:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14479 to 14479. [2025-03-16 15:14:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14479 states, 14478 states have (on average 1.0184417737256528) internal successors, (14745), 14478 states have internal predecessors, (14745), 0 states have call successors, (0), 0 states 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:14:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 14745 transitions. [2025-03-16 15:14:26,498 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 14745 transitions. Word has length 1650 [2025-03-16 15:14:26,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:26,499 INFO L471 AbstractCegarLoop]: Abstraction has 14479 states and 14745 transitions. [2025-03-16 15:14:26,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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:14:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 14745 transitions. [2025-03-16 15:14:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2062 [2025-03-16 15:14:26,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:26,520 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:26,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 15:14:26,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:14:26,721 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:26,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash 185704720, now seen corresponding path program 1 times [2025-03-16 15:14:26,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:26,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303242271] [2025-03-16 15:14:26,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:26,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:26,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2061 statements into 1 equivalence classes. [2025-03-16 15:14:26,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2061 of 2061 statements. [2025-03-16 15:14:26,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:26,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 8499 backedges. 4032 proven. 0 refuted. 0 times theorem prover too weak. 4467 trivial. 0 not checked. [2025-03-16 15:14:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:28,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303242271] [2025-03-16 15:14:28,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303242271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:28,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:28,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386264442] [2025-03-16 15:14:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:28,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:28,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:28,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:28,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:28,552 INFO L87 Difference]: Start difference. First operand 14479 states and 14745 transitions. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states 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:14:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:29,160 INFO L93 Difference]: Finished difference Result 32247 states and 32852 transitions. [2025-03-16 15:14:29,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:29,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 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 2061 [2025-03-16 15:14:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:29,174 INFO L225 Difference]: With dead ends: 32247 [2025-03-16 15:14:29,175 INFO L226 Difference]: Without dead ends: 18427 [2025-03-16 15:14:29,183 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:14:29,183 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 207 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:29,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 54 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:14:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18427 states. [2025-03-16 15:14:29,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18427 to 14808. [2025-03-16 15:14:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.0192476531370298) internal successors, (15092), 14807 states have internal predecessors, (15092), 0 states have call successors, (0), 0 states 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:14:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15092 transitions. [2025-03-16 15:14:29,308 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15092 transitions. Word has length 2061 [2025-03-16 15:14:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:29,308 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15092 transitions. [2025-03-16 15:14:29,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states 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:14:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15092 transitions. [2025-03-16 15:14:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2103 [2025-03-16 15:14:29,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:29,330 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:29,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:14:29,330 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:29,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash -951844278, now seen corresponding path program 1 times [2025-03-16 15:14:29,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:29,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061248238] [2025-03-16 15:14:29,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:29,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:29,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2102 statements into 1 equivalence classes. [2025-03-16 15:14:29,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2102 of 2102 statements. [2025-03-16 15:14:29,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:29,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9281 backedges. 6856 proven. 91 refuted. 0 times theorem prover too weak. 2334 trivial. 0 not checked. [2025-03-16 15:14:31,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061248238] [2025-03-16 15:14:31,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061248238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:14:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887403967] [2025-03-16 15:14:31,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:31,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:14:31,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:14:31,458 INFO L229 MonitoredProcess]: Starting monitored process 8 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:14:31,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 15:14:31,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2102 statements into 1 equivalence classes. [2025-03-16 15:14:31,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2102 of 2102 statements. [2025-03-16 15:14:31,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:31,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:31,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 2417 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:14:31,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:14:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9281 backedges. 767 proven. 0 refuted. 0 times theorem prover too weak. 8514 trivial. 0 not checked. [2025-03-16 15:14:31,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:14:31,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887403967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:31,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:14:31,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:14:31,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758765821] [2025-03-16 15:14:31,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:31,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:31,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:31,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:31,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:14:31,954 INFO L87 Difference]: Start difference. First operand 14808 states and 15092 transitions. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:14:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:32,599 INFO L93 Difference]: Finished difference Result 32247 states and 32863 transitions. [2025-03-16 15:14:32,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:32,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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 2102 [2025-03-16 15:14:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:32,614 INFO L225 Difference]: With dead ends: 32247 [2025-03-16 15:14:32,614 INFO L226 Difference]: Without dead ends: 18098 [2025-03-16 15:14:32,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2107 GetRequests, 2102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:14:32,623 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:32,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 432 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:14:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18098 states. [2025-03-16 15:14:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18098 to 16782. [2025-03-16 15:14:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16782 states, 16781 states have (on average 1.0172814492580895) internal successors, (17071), 16781 states have internal predecessors, (17071), 0 states have call successors, (0), 0 states 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:14:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16782 states to 16782 states and 17071 transitions. [2025-03-16 15:14:32,743 INFO L78 Accepts]: Start accepts. Automaton has 16782 states and 17071 transitions. Word has length 2102 [2025-03-16 15:14:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:32,744 INFO L471 AbstractCegarLoop]: Abstraction has 16782 states and 17071 transitions. [2025-03-16 15:14:32,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:14:32,744 INFO L276 IsEmpty]: Start isEmpty. Operand 16782 states and 17071 transitions. [2025-03-16 15:14:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2193 [2025-03-16 15:14:32,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:32,768 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 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, 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, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-16 15:14:32,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 15:14:32,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:14:32,968 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:32,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:32,969 INFO L85 PathProgramCache]: Analyzing trace with hash -47338462, now seen corresponding path program 1 times [2025-03-16 15:14:32,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:32,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477548875] [2025-03-16 15:14:32,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:32,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:33,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2192 statements into 1 equivalence classes. [2025-03-16 15:14:33,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2192 of 2192 statements. [2025-03-16 15:14:33,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:33,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10474 backedges. 831 proven. 0 refuted. 0 times theorem prover too weak. 9643 trivial. 0 not checked. [2025-03-16 15:14:34,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:34,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477548875] [2025-03-16 15:14:34,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477548875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:34,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:34,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104679562] [2025-03-16 15:14:34,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:34,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:34,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:34,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:34,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:34,836 INFO L87 Difference]: Start difference. First operand 16782 states and 17071 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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:14:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:35,165 INFO L93 Difference]: Finished difference Result 32584 states and 33155 transitions. [2025-03-16 15:14:35,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:35,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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 2192 [2025-03-16 15:14:35,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:35,166 INFO L225 Difference]: With dead ends: 32584 [2025-03-16 15:14:35,166 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:14:35,175 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:14:35,176 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:35,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:14:35,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:14:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:14:35,176 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:14:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:14:35,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2192 [2025-03-16 15:14:35,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:35,177 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:14:35,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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:14:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:14:35,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:14:35,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:14:35,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 15:14:35,193 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:35,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:14:35,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:14:35,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:14:35 BoogieIcfgContainer [2025-03-16 15:14:35,958 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:14:35,958 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:14:35,958 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:14:35,959 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:14:35,960 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:13:36" (3/4) ... [2025-03-16 15:14:35,966 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:14:36,001 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-16 15:14:36,003 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:14:36,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:14:36,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:14:36,219 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:14:36,220 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:14:36,220 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:14:36,221 INFO L158 Benchmark]: Toolchain (without parser) took 62651.05ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 123.4MB in the beginning and 1.1GB in the end (delta: -952.7MB). Peak memory consumption was 356.9MB. Max. memory is 16.1GB. [2025-03-16 15:14:36,221 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:14:36,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.56ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 66.2MB in the end (delta: 57.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-16 15:14:36,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.51ms. Allocated memory is still 167.8MB. Free memory was 66.2MB in the beginning and 43.0MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 15:14:36,221 INFO L158 Benchmark]: Boogie Preprocessor took 194.63ms. Allocated memory is still 167.8MB. Free memory was 43.0MB in the beginning and 84.5MB in the end (delta: -41.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2025-03-16 15:14:36,221 INFO L158 Benchmark]: IcfgBuilder took 1767.47ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 84.5MB in the beginning and 252.2MB in the end (delta: -167.6MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2025-03-16 15:14:36,221 INFO L158 Benchmark]: TraceAbstraction took 59800.39ms. Allocated memory was 385.9MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 252.2MB in the beginning and 1.1GB in the end (delta: -849.1MB). Peak memory consumption was 907.9MB. Max. memory is 16.1GB. [2025-03-16 15:14:36,221 INFO L158 Benchmark]: Witness Printer took 261.46ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:14:36,222 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.14ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.56ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 66.2MB in the end (delta: 57.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.51ms. Allocated memory is still 167.8MB. Free memory was 66.2MB in the beginning and 43.0MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 194.63ms. Allocated memory is still 167.8MB. Free memory was 43.0MB in the beginning and 84.5MB in the end (delta: -41.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * IcfgBuilder took 1767.47ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 84.5MB in the beginning and 252.2MB in the end (delta: -167.6MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. * TraceAbstraction took 59800.39ms. Allocated memory was 385.9MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 252.2MB in the beginning and 1.1GB in the end (delta: -849.1MB). Peak memory consumption was 907.9MB. Max. memory is 16.1GB. * Witness Printer took 261.46ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 215]: 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, 335 locations, 661 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.0s, OverallIterations: 26, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7013 SdHoareTripleChecker+Valid, 20.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7013 mSDsluCounter, 7254 SdHoareTripleChecker+Invalid, 16.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 501 mSDsCounter, 2753 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32773 IncrementalHoareTripleChecker+Invalid, 35526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2753 mSolverCounterUnsat, 6753 mSDtfsCounter, 32773 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12453 GetRequests, 12381 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16782occurred in iteration=25, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 10543 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 28.2s InterpolantComputationTime, 35152 NumberOfCodeBlocks, 35152 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 37866 ConstructedInterpolants, 0 QuantifiedInterpolants, 105660 SizeOfPredicates, 8 NumberOfNonLiveVariables, 11060 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 35 InterpolantComputations, 24 PerfectInterpolantSequences, 100892/103958 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: 1783]: Location Invariant Derived location invariant: ((((((((((((((((((((((((a12 <= 5) && (a16 == 12)) && ((5 != a12) || (0 < ((long long) a18 + 156)))) && (a15 == 3)) || (((a12 == 6) && (a16 <= 11)) && (a15 == 3))) || (((a12 <= 5) && (a16 <= 11)) && (a15 == 3))) || (((a16 == 11) && (a15 == 3)) && (7 == a12))) || (((((a12 == 9) && (a16 != 10)) && (a15 == 4)) && (a16 != 11)) && (a16 <= 11))) || (((a15 == 4) && (a12 == 6)) && (a16 <= 11))) || ((((a16 == 9) && (((long long) a18 + 156) <= 0)) && (a15 == 3)) && (7 == a12))) || ((((a12 == 8) && (a16 == 12)) && (a18 <= 132)) && (a15 == 3))) || ((((137 <= a18) && (a16 <= 11)) && (a15 == 3)) && (7 == a12))) || (((a12 == 9) && (a16 == 12)) && (a15 == 3))) || ((((a12 == 8) && (a16 == 12)) && (137 <= a18)) && (a15 == 3))) || (((a16 == 8) && (a15 == 4)) && (5 == a12))) || (((a12 == 8) && (a16 <= 11)) && (a15 == 3))) || ((a16 <= 8) && (a15 <= 3))) || (((a12 == 9) && (a16 <= 11)) && (a15 == 3))) || ((((a12 <= 5) && (a15 == 4)) && (a18 <= 132)) && (a16 <= 11))) || (((((a16 != 10) && (a15 == 4)) && (a12 == 8)) && (a18 <= 132)) && (a16 <= 11))) || ((((a12 <= 5) && (a15 == 4)) && (137 <= a18)) && (a16 <= 11))) || (((a12 == 6) && (a16 == 12)) && (a15 == 3))) || ((((a16 == 12) && (a18 <= 132)) && (a15 == 3)) && (7 == a12))) || ((((a16 != 10) && (a15 == 4)) && (a16 <= 11)) && (7 == a12))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:14:36,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE