./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label07.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 c6eeba0e1c333b0671bbfcf3662adf7139859c1a965a716dd9b28c849af19818 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:50:23,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:50:23,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:50:23,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:50:23,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:50:23,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:50:23,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:50:23,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:50:23,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:50:23,364 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:50:23,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:50:23,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:50:23,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:50:23,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:50:23,365 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:50:23,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:50:23,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:50:23,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:50:23,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:50:23,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:50:23,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:50:23,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:50:23,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:50:23,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:50:23,366 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:50:23,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:50:23,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:50:23,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:50:23,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:50:23,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:50:23,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:50:23,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:50:23,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:50:23,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:50:23,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:50:23,367 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:50:23,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:50:23,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:50:23,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:50:23,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:50:23,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:50:23,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:50:23,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:50:23,368 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 -> c6eeba0e1c333b0671bbfcf3662adf7139859c1a965a716dd9b28c849af19818 [2025-03-08 01:50:23,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:50:23,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:50:23,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:50:23,689 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:50:23,690 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:50:23,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label07.c [2025-03-08 01:50:24,844 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f328d1463/4e0290f04d064cd09963a904599f3688/FLAG91381b1b3 [2025-03-08 01:50:25,310 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:50:25,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label07.c [2025-03-08 01:50:25,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f328d1463/4e0290f04d064cd09963a904599f3688/FLAG91381b1b3 [2025-03-08 01:50:25,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f328d1463/4e0290f04d064cd09963a904599f3688 [2025-03-08 01:50:25,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:50:25,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:50:25,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:50:25,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:50:25,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:50:25,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:50:25" (1/1) ... [2025-03-08 01:50:25,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ae97b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:25, skipping insertion in model container [2025-03-08 01:50:25,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:50:25" (1/1) ... [2025-03-08 01:50:25,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:50:25,700 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/Problem13_label07.c[3249,3262] [2025-03-08 01:50:26,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:50:26,242 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:50:26,254 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/Problem13_label07.c[3249,3262] [2025-03-08 01:50:26,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:50:26,551 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:50:26,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26 WrapperNode [2025-03-08 01:50:26,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:50:26,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:50:26,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:50:26,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:50:26,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (1/1) ... [2025-03-08 01:50:26,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (1/1) ... [2025-03-08 01:50:26,936 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-08 01:50:26,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:50:26,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:50:26,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:50:26,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:50:26,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (1/1) ... [2025-03-08 01:50:26,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (1/1) ... [2025-03-08 01:50:27,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (1/1) ... [2025-03-08 01:50:27,217 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:50:27,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (1/1) ... [2025-03-08 01:50:27,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (1/1) ... [2025-03-08 01:50:27,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (1/1) ... [2025-03-08 01:50:27,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (1/1) ... [2025-03-08 01:50:27,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (1/1) ... [2025-03-08 01:50:27,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (1/1) ... [2025-03-08 01:50:27,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:50:27,515 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:50:27,516 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:50:27,516 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:50:27,517 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (1/1) ... [2025-03-08 01:50:27,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:50:27,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:50:27,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:50:27,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:50:27,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:50:27,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:50:27,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:50:27,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:50:27,622 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:50:27,623 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:50:31,744 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-08 01:50:31,745 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-08 01:50:31,745 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-08 01:50:31,924 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-08 01:50:31,924 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:50:31,958 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:50:31,958 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:50:31,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:50:31 BoogieIcfgContainer [2025-03-08 01:50:31,962 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:50:31,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:50:31,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:50:31,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:50:31,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:50:25" (1/3) ... [2025-03-08 01:50:31,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ba421f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:50:31, skipping insertion in model container [2025-03-08 01:50:31,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:50:26" (2/3) ... [2025-03-08 01:50:31,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ba421f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:50:31, skipping insertion in model container [2025-03-08 01:50:31,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:50:31" (3/3) ... [2025-03-08 01:50:31,971 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label07.c [2025-03-08 01:50:31,983 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:50:31,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label07.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:50:32,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:50:32,067 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;@1ad7ab2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:50:32,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:50:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 01:50:32,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:32,076 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] [2025-03-08 01:50:32,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:32,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:32,079 INFO L85 PathProgramCache]: Analyzing trace with hash -337160076, now seen corresponding path program 1 times [2025-03-08 01:50:32,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:32,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958735606] [2025-03-08 01:50:32,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:32,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:32,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 01:50:32,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 01:50:32,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:32,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:50:32,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:32,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958735606] [2025-03-08 01:50:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958735606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:32,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:32,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:50:32,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672199314] [2025-03-08 01:50:32,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:32,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:32,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:32,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:32,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:32,315 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:35,545 INFO L93 Difference]: Finished difference Result 3147 states and 5803 transitions. [2025-03-08 01:50:35,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:35,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-08 01:50:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:35,563 INFO L225 Difference]: With dead ends: 3147 [2025-03-08 01:50:35,563 INFO L226 Difference]: Without dead ends: 1964 [2025-03-08 01:50:35,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:35,569 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1158 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:35,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 987 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 01:50:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-03-08 01:50:35,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2025-03-08 01:50:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2025-03-08 01:50:35,650 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 21 [2025-03-08 01:50:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:35,651 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2025-03-08 01:50:35,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2025-03-08 01:50:35,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 01:50:35,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:35,653 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 01:50:35,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:50:35,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:35,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:35,655 INFO L85 PathProgramCache]: Analyzing trace with hash -303417075, now seen corresponding path program 1 times [2025-03-08 01:50:35,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:35,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710022592] [2025-03-08 01:50:35,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:35,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:35,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 01:50:35,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 01:50:35,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:35,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:50:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:35,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710022592] [2025-03-08 01:50:35,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710022592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:35,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:35,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:50:35,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011071888] [2025-03-08 01:50:35,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:35,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:35,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:35,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:35,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:35,897 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:39,029 INFO L93 Difference]: Finished difference Result 5540 states and 9221 transitions. [2025-03-08 01:50:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:39,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-08 01:50:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:39,040 INFO L225 Difference]: With dead ends: 5540 [2025-03-08 01:50:39,040 INFO L226 Difference]: Without dead ends: 3591 [2025-03-08 01:50:39,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:39,042 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 923 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:39,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1008 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-08 01:50:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2025-03-08 01:50:39,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3581. [2025-03-08 01:50:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2025-03-08 01:50:39,092 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 92 [2025-03-08 01:50:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:39,093 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2025-03-08 01:50:39,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2025-03-08 01:50:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 01:50:39,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:39,095 INFO L218 NwaCegarLoop]: trace histogram [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-08 01:50:39,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:50:39,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:39,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:39,096 INFO L85 PathProgramCache]: Analyzing trace with hash -950558604, now seen corresponding path program 1 times [2025-03-08 01:50:39,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:39,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980069758] [2025-03-08 01:50:39,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:39,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:39,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 01:50:39,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 01:50:39,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:39,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:50:39,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:39,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980069758] [2025-03-08 01:50:39,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980069758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:39,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:39,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:50:39,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247276859] [2025-03-08 01:50:39,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:39,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:39,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:39,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:39,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:39,273 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:42,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:42,011 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2025-03-08 01:50:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:42,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-08 01:50:42,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:42,031 INFO L225 Difference]: With dead ends: 10352 [2025-03-08 01:50:42,031 INFO L226 Difference]: Without dead ends: 6773 [2025-03-08 01:50:42,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:42,037 INFO L435 NwaCegarLoop]: 1020 mSDtfsCounter, 785 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:42,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1171 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:50:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2025-03-08 01:50:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2025-03-08 01:50:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 8943 transitions. [2025-03-08 01:50:42,134 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 8943 transitions. Word has length 106 [2025-03-08 01:50:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:42,135 INFO L471 AbstractCegarLoop]: Abstraction has 6749 states and 8943 transitions. [2025-03-08 01:50:42,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 8943 transitions. [2025-03-08 01:50:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 01:50:42,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:42,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:42,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:50:42,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:42,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:42,138 INFO L85 PathProgramCache]: Analyzing trace with hash -828031833, now seen corresponding path program 1 times [2025-03-08 01:50:42,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:42,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196617959] [2025-03-08 01:50:42,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:42,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:42,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 01:50:42,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 01:50:42,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:42,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:50:42,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:42,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196617959] [2025-03-08 01:50:42,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196617959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:42,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:42,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:50:42,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882342512] [2025-03-08 01:50:42,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:42,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:42,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:42,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:42,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:42,296 INFO L87 Difference]: Start difference. First operand 6749 states and 8943 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:45,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:45,191 INFO L93 Difference]: Finished difference Result 19871 states and 26319 transitions. [2025-03-08 01:50:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:45,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-08 01:50:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:45,221 INFO L225 Difference]: With dead ends: 19871 [2025-03-08 01:50:45,221 INFO L226 Difference]: Without dead ends: 13124 [2025-03-08 01:50:45,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:45,230 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 899 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 3432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:45,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 611 Invalid, 3432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 01:50:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13124 states. [2025-03-08 01:50:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13124 to 13114. [2025-03-08 01:50:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13114 states, 13113 states have (on average 1.2755281018836269) internal successors, (16726), 13113 states have internal predecessors, (16726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 16726 transitions. [2025-03-08 01:50:45,394 INFO L78 Accepts]: Start accepts. Automaton has 13114 states and 16726 transitions. Word has length 135 [2025-03-08 01:50:45,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:45,395 INFO L471 AbstractCegarLoop]: Abstraction has 13114 states and 16726 transitions. [2025-03-08 01:50:45,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 13114 states and 16726 transitions. [2025-03-08 01:50:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 01:50:45,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:45,400 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:45,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:50:45,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:45,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:45,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1740479659, now seen corresponding path program 1 times [2025-03-08 01:50:45,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:45,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689290579] [2025-03-08 01:50:45,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:45,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:45,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 01:50:45,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 01:50:45,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:45,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-08 01:50:45,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:45,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689290579] [2025-03-08 01:50:45,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689290579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:45,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:45,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:50:45,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936208380] [2025-03-08 01:50:45,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:45,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:45,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:45,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:45,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:45,652 INFO L87 Difference]: Start difference. First operand 13114 states and 16726 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:48,377 INFO L93 Difference]: Finished difference Result 36461 states and 47023 transitions. [2025-03-08 01:50:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:48,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 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 218 [2025-03-08 01:50:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:48,424 INFO L225 Difference]: With dead ends: 36461 [2025-03-08 01:50:48,424 INFO L226 Difference]: Without dead ends: 24136 [2025-03-08 01:50:48,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:48,438 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 849 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:48,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1033 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:50:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24136 states. [2025-03-08 01:50:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24136 to 24130. [2025-03-08 01:50:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24130 states, 24129 states have (on average 1.2020804840648183) internal successors, (29005), 24129 states have internal predecessors, (29005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24130 states to 24130 states and 29005 transitions. [2025-03-08 01:50:48,717 INFO L78 Accepts]: Start accepts. Automaton has 24130 states and 29005 transitions. Word has length 218 [2025-03-08 01:50:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:48,717 INFO L471 AbstractCegarLoop]: Abstraction has 24130 states and 29005 transitions. [2025-03-08 01:50:48,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 24130 states and 29005 transitions. [2025-03-08 01:50:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-08 01:50:48,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:48,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:48,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:50:48,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:48,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1922843453, now seen corresponding path program 1 times [2025-03-08 01:50:48,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:48,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250246379] [2025-03-08 01:50:48,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:48,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:48,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-08 01:50:48,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-08 01:50:48,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:48,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 01:50:48,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:48,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250246379] [2025-03-08 01:50:48,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250246379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:48,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:48,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:50:48,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273056150] [2025-03-08 01:50:48,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:48,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:48,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:48,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:48,958 INFO L87 Difference]: Start difference. First operand 24130 states and 29005 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:51,051 INFO L93 Difference]: Finished difference Result 43520 states and 52823 transitions. [2025-03-08 01:50:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:51,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 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 222 [2025-03-08 01:50:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:51,090 INFO L225 Difference]: With dead ends: 43520 [2025-03-08 01:50:51,090 INFO L226 Difference]: Without dead ends: 24131 [2025-03-08 01:50:51,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:51,110 INFO L435 NwaCegarLoop]: 1078 mSDtfsCounter, 676 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:51,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1213 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 01:50:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24131 states. [2025-03-08 01:50:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24131 to 24130. [2025-03-08 01:50:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24130 states, 24129 states have (on average 1.2018732645364498) internal successors, (29000), 24129 states have internal predecessors, (29000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24130 states to 24130 states and 29000 transitions. [2025-03-08 01:50:51,483 INFO L78 Accepts]: Start accepts. Automaton has 24130 states and 29000 transitions. Word has length 222 [2025-03-08 01:50:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:51,484 INFO L471 AbstractCegarLoop]: Abstraction has 24130 states and 29000 transitions. [2025-03-08 01:50:51,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 24130 states and 29000 transitions. [2025-03-08 01:50:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-08 01:50:51,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:51,508 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:51,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:50:51,508 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:51,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2048777647, now seen corresponding path program 1 times [2025-03-08 01:50:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:51,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985278232] [2025-03-08 01:50:51,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:51,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:51,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-08 01:50:51,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-08 01:50:51,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:51,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:50:51,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:51,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985278232] [2025-03-08 01:50:51,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985278232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:51,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:51,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:50:51,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297634815] [2025-03-08 01:50:51,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:51,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:51,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:51,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:51,632 INFO L87 Difference]: Start difference. First operand 24130 states and 29000 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:53,940 INFO L93 Difference]: Finished difference Result 47314 states and 56987 transitions. [2025-03-08 01:50:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:53,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 235 [2025-03-08 01:50:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:53,965 INFO L225 Difference]: With dead ends: 47314 [2025-03-08 01:50:53,965 INFO L226 Difference]: Without dead ends: 23973 [2025-03-08 01:50:53,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:53,990 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 1037 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:53,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1657 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 01:50:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23973 states. [2025-03-08 01:50:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23973 to 23968. [2025-03-08 01:50:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23968 states, 23967 states have (on average 1.1344348479158843) internal successors, (27189), 23967 states have internal predecessors, (27189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23968 states to 23968 states and 27189 transitions. [2025-03-08 01:50:54,196 INFO L78 Accepts]: Start accepts. Automaton has 23968 states and 27189 transitions. Word has length 235 [2025-03-08 01:50:54,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:54,196 INFO L471 AbstractCegarLoop]: Abstraction has 23968 states and 27189 transitions. [2025-03-08 01:50:54,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 23968 states and 27189 transitions. [2025-03-08 01:50:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-08 01:50:54,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:54,199 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-08 01:50:54,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:50:54,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:54,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1434939271, now seen corresponding path program 1 times [2025-03-08 01:50:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:54,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800289461] [2025-03-08 01:50:54,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:54,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:54,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-08 01:50:54,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-08 01:50:54,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:54,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-08 01:50:54,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:54,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800289461] [2025-03-08 01:50:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800289461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:54,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:54,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:50:54,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602120831] [2025-03-08 01:50:54,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:54,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:50:54,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:54,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:50:54,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:54,552 INFO L87 Difference]: Start difference. First operand 23968 states and 27189 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:50:56,657 INFO L93 Difference]: Finished difference Result 47147 states and 53579 transitions. [2025-03-08 01:50:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:50:56,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2025-03-08 01:50:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:50:56,678 INFO L225 Difference]: With dead ends: 47147 [2025-03-08 01:50:56,678 INFO L226 Difference]: Without dead ends: 23968 [2025-03-08 01:50:56,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:50:56,692 INFO L435 NwaCegarLoop]: 1056 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:50:56,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1185 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 01:50:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23968 states. [2025-03-08 01:50:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23968 to 23968. [2025-03-08 01:50:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23968 states, 23967 states have (on average 1.1342262277297952) internal successors, (27184), 23967 states have internal predecessors, (27184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23968 states to 23968 states and 27184 transitions. [2025-03-08 01:50:56,881 INFO L78 Accepts]: Start accepts. Automaton has 23968 states and 27184 transitions. Word has length 254 [2025-03-08 01:50:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:50:56,882 INFO L471 AbstractCegarLoop]: Abstraction has 23968 states and 27184 transitions. [2025-03-08 01:50:56,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:50:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 23968 states and 27184 transitions. [2025-03-08 01:50:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-08 01:50:56,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:50:56,887 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:50:56,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:50:56,887 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:50:56,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:50:56,887 INFO L85 PathProgramCache]: Analyzing trace with hash 704041883, now seen corresponding path program 1 times [2025-03-08 01:50:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:50:56,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560235305] [2025-03-08 01:50:56,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:50:56,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:50:56,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-08 01:50:56,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-08 01:50:56,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:50:56,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:50:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 01:50:57,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:50:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560235305] [2025-03-08 01:50:57,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560235305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:50:57,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:50:57,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:50:57,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242116476] [2025-03-08 01:50:57,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:50:57,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:50:57,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:50:57,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:50:57,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:50:57,069 INFO L87 Difference]: Start difference. First operand 23968 states and 27184 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:02,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:02,081 INFO L93 Difference]: Finished difference Result 85141 states and 97158 transitions. [2025-03-08 01:51:02,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:51:02,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 261 [2025-03-08 01:51:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:02,145 INFO L225 Difference]: With dead ends: 85141 [2025-03-08 01:51:02,145 INFO L226 Difference]: Without dead ends: 61962 [2025-03-08 01:51:02,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:51:02,172 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 1738 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 6752 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 7810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 6752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:02,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 868 Invalid, 7810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 6752 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 01:51:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61962 states. [2025-03-08 01:51:02,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61962 to 59472. [2025-03-08 01:51:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59472 states, 59471 states have (on average 1.1241781708731986) internal successors, (66856), 59471 states have internal predecessors, (66856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59472 states to 59472 states and 66856 transitions. [2025-03-08 01:51:02,689 INFO L78 Accepts]: Start accepts. Automaton has 59472 states and 66856 transitions. Word has length 261 [2025-03-08 01:51:02,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:02,689 INFO L471 AbstractCegarLoop]: Abstraction has 59472 states and 66856 transitions. [2025-03-08 01:51:02,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:02,689 INFO L276 IsEmpty]: Start isEmpty. Operand 59472 states and 66856 transitions. [2025-03-08 01:51:02,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-08 01:51:02,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:02,693 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 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] [2025-03-08 01:51:02,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:51:02,693 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:02,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:02,694 INFO L85 PathProgramCache]: Analyzing trace with hash 301369793, now seen corresponding path program 1 times [2025-03-08 01:51:02,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:02,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613203725] [2025-03-08 01:51:02,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:02,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-08 01:51:02,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-08 01:51:02,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:02,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 01:51:02,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613203725] [2025-03-08 01:51:02,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613203725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:02,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:02,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:51:02,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846037219] [2025-03-08 01:51:02,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:02,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:02,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:02,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:02,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:02,848 INFO L87 Difference]: Start difference. First operand 59472 states and 66856 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:05,948 INFO L93 Difference]: Finished difference Result 144134 states and 163914 transitions. [2025-03-08 01:51:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:05,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 319 [2025-03-08 01:51:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:06,041 INFO L225 Difference]: With dead ends: 144134 [2025-03-08 01:51:06,041 INFO L226 Difference]: Without dead ends: 85451 [2025-03-08 01:51:06,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:06,074 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 783 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2433 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 3301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 2433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:06,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 1037 Invalid, 3301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 2433 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:51:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85451 states. [2025-03-08 01:51:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85451 to 83866. [2025-03-08 01:51:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83866 states, 83865 states have (on average 1.1146962380015502) internal successors, (93484), 83865 states have internal predecessors, (93484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83866 states to 83866 states and 93484 transitions. [2025-03-08 01:51:06,793 INFO L78 Accepts]: Start accepts. Automaton has 83866 states and 93484 transitions. Word has length 319 [2025-03-08 01:51:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:06,793 INFO L471 AbstractCegarLoop]: Abstraction has 83866 states and 93484 transitions. [2025-03-08 01:51:06,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 83866 states and 93484 transitions. [2025-03-08 01:51:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-08 01:51:06,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:06,797 INFO L218 NwaCegarLoop]: trace histogram [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, 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-08 01:51:06,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:51:06,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:06,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1018782692, now seen corresponding path program 1 times [2025-03-08 01:51:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:06,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132297925] [2025-03-08 01:51:06,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:06,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-08 01:51:06,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-08 01:51:06,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:06,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 01:51:07,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:07,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132297925] [2025-03-08 01:51:07,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132297925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:07,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:07,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:51:07,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193609488] [2025-03-08 01:51:07,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:07,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:07,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:07,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:07,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:07,144 INFO L87 Difference]: Start difference. First operand 83866 states and 93484 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:09,649 INFO L93 Difference]: Finished difference Result 168552 states and 187810 transitions. [2025-03-08 01:51:09,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:09,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 347 [2025-03-08 01:51:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:09,735 INFO L225 Difference]: With dead ends: 168552 [2025-03-08 01:51:09,735 INFO L226 Difference]: Without dead ends: 83109 [2025-03-08 01:51:09,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:09,784 INFO L435 NwaCegarLoop]: 1827 mSDtfsCounter, 746 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:09,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1967 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 01:51:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83109 states. [2025-03-08 01:51:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83109 to 79922. [2025-03-08 01:51:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79922 states, 79921 states have (on average 1.1056167965866293) internal successors, (88362), 79921 states have internal predecessors, (88362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79922 states to 79922 states and 88362 transitions. [2025-03-08 01:51:10,549 INFO L78 Accepts]: Start accepts. Automaton has 79922 states and 88362 transitions. Word has length 347 [2025-03-08 01:51:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:10,550 INFO L471 AbstractCegarLoop]: Abstraction has 79922 states and 88362 transitions. [2025-03-08 01:51:10,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 79922 states and 88362 transitions. [2025-03-08 01:51:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-08 01:51:10,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:10,554 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:10,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:51:10,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:10,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:10,554 INFO L85 PathProgramCache]: Analyzing trace with hash -202476859, now seen corresponding path program 1 times [2025-03-08 01:51:10,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:10,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091012896] [2025-03-08 01:51:10,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:10,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:10,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-08 01:51:10,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-08 01:51:10,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:10,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 260 proven. 113 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 01:51:11,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:11,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091012896] [2025-03-08 01:51:11,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091012896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:51:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754316826] [2025-03-08 01:51:11,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:11,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:51:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:51:11,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:51:11,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 01:51:11,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-08 01:51:11,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-08 01:51:11,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:11,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:11,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:51:11,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:51:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-08 01:51:11,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:51:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754316826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:11,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:51:11,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-08 01:51:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261838827] [2025-03-08 01:51:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:11,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:11,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:11,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:51:11,808 INFO L87 Difference]: Start difference. First operand 79922 states and 88362 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:14,421 INFO L93 Difference]: Finished difference Result 159053 states and 175929 transitions. [2025-03-08 01:51:14,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:14,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 376 [2025-03-08 01:51:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:14,511 INFO L225 Difference]: With dead ends: 159053 [2025-03-08 01:51:14,511 INFO L226 Difference]: Without dead ends: 79920 [2025-03-08 01:51:14,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:51:14,558 INFO L435 NwaCegarLoop]: 1344 mSDtfsCounter, 1084 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:14,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1423 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 01:51:14,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79920 states. [2025-03-08 01:51:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79920 to 79919. [2025-03-08 01:51:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79919 states, 79918 states have (on average 1.0802822893465802) internal successors, (86334), 79918 states have internal predecessors, (86334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79919 states to 79919 states and 86334 transitions. [2025-03-08 01:51:15,461 INFO L78 Accepts]: Start accepts. Automaton has 79919 states and 86334 transitions. Word has length 376 [2025-03-08 01:51:15,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:15,462 INFO L471 AbstractCegarLoop]: Abstraction has 79919 states and 86334 transitions. [2025-03-08 01:51:15,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 79919 states and 86334 transitions. [2025-03-08 01:51:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-08 01:51:15,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:15,466 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-08 01:51:15,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 01:51:15,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 01:51:15,667 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:15,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash 565099845, now seen corresponding path program 1 times [2025-03-08 01:51:15,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:15,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378596751] [2025-03-08 01:51:15,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:15,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:15,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 01:51:15,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 01:51:15,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:15,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-08 01:51:15,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:15,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378596751] [2025-03-08 01:51:15,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378596751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:15,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:15,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:51:15,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476722642] [2025-03-08 01:51:15,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:15,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:15,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:15,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:15,891 INFO L87 Difference]: Start difference. First operand 79919 states and 86334 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:18,864 INFO L93 Difference]: Finished difference Result 185027 states and 201730 transitions. [2025-03-08 01:51:18,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:18,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 377 [2025-03-08 01:51:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:18,977 INFO L225 Difference]: With dead ends: 185027 [2025-03-08 01:51:18,977 INFO L226 Difference]: Without dead ends: 105897 [2025-03-08 01:51:19,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:19,029 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 876 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:19,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 903 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:51:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105897 states. [2025-03-08 01:51:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105897 to 104304. [2025-03-08 01:51:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104304 states, 104303 states have (on average 1.0859131568603013) internal successors, (113264), 104303 states have internal predecessors, (113264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104304 states to 104304 states and 113264 transitions. [2025-03-08 01:51:20,040 INFO L78 Accepts]: Start accepts. Automaton has 104304 states and 113264 transitions. Word has length 377 [2025-03-08 01:51:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:20,041 INFO L471 AbstractCegarLoop]: Abstraction has 104304 states and 113264 transitions. [2025-03-08 01:51:20,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 104304 states and 113264 transitions. [2025-03-08 01:51:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-08 01:51:20,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:20,045 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 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] [2025-03-08 01:51:20,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:51:20,045 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:20,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:20,045 INFO L85 PathProgramCache]: Analyzing trace with hash -695691540, now seen corresponding path program 1 times [2025-03-08 01:51:20,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:20,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078272068] [2025-03-08 01:51:20,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:20,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:20,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-08 01:51:20,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-08 01:51:20,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:20,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 01:51:20,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:20,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078272068] [2025-03-08 01:51:20,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078272068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:20,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:20,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:51:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046333362] [2025-03-08 01:51:20,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:20,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:51:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:20,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:51:20,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:51:20,423 INFO L87 Difference]: Start difference. First operand 104304 states and 113264 transitions. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:23,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:23,790 INFO L93 Difference]: Finished difference Result 203879 states and 221787 transitions. [2025-03-08 01:51:23,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:51:23,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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 410 [2025-03-08 01:51:23,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:23,912 INFO L225 Difference]: With dead ends: 203879 [2025-03-08 01:51:23,912 INFO L226 Difference]: Without dead ends: 111386 [2025-03-08 01:51:23,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:51:23,965 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 1569 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 4068 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 4523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 4068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:23,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 999 Invalid, 4523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 4068 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 01:51:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111386 states. [2025-03-08 01:51:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111386 to 107450. [2025-03-08 01:51:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107450 states, 107449 states have (on average 1.0778601941386146) internal successors, (115815), 107449 states have internal predecessors, (115815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107450 states to 107450 states and 115815 transitions. [2025-03-08 01:51:25,224 INFO L78 Accepts]: Start accepts. Automaton has 107450 states and 115815 transitions. Word has length 410 [2025-03-08 01:51:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:25,225 INFO L471 AbstractCegarLoop]: Abstraction has 107450 states and 115815 transitions. [2025-03-08 01:51:25,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 107450 states and 115815 transitions. [2025-03-08 01:51:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-08 01:51:25,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:25,242 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-08 01:51:25,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:51:25,243 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:25,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:25,244 INFO L85 PathProgramCache]: Analyzing trace with hash 19371381, now seen corresponding path program 1 times [2025-03-08 01:51:25,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:25,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714311297] [2025-03-08 01:51:25,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:25,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:25,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-08 01:51:25,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-08 01:51:25,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:25,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 01:51:25,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:25,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714311297] [2025-03-08 01:51:25,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714311297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:25,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:25,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:51:25,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668896541] [2025-03-08 01:51:25,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:25,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:25,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:25,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:25,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:25,687 INFO L87 Difference]: Start difference. First operand 107450 states and 115815 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:28,825 INFO L93 Difference]: Finished difference Result 240097 states and 260427 transitions. [2025-03-08 01:51:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:28,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 469 [2025-03-08 01:51:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:28,972 INFO L225 Difference]: With dead ends: 240097 [2025-03-08 01:51:28,972 INFO L226 Difference]: Without dead ends: 132649 [2025-03-08 01:51:29,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:29,023 INFO L435 NwaCegarLoop]: 1740 mSDtfsCounter, 721 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 654 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 3141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 654 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:29,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1882 Invalid, 3141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [654 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:51:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132649 states. [2025-03-08 01:51:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132649 to 130272. [2025-03-08 01:51:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130272 states, 130271 states have (on average 1.0689409001235886) internal successors, (139252), 130271 states have internal predecessors, (139252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130272 states to 130272 states and 139252 transitions. [2025-03-08 01:51:30,287 INFO L78 Accepts]: Start accepts. Automaton has 130272 states and 139252 transitions. Word has length 469 [2025-03-08 01:51:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:30,287 INFO L471 AbstractCegarLoop]: Abstraction has 130272 states and 139252 transitions. [2025-03-08 01:51:30,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 130272 states and 139252 transitions. [2025-03-08 01:51:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-08 01:51:30,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:30,293 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:30,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 01:51:30,293 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:30,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash 691700349, now seen corresponding path program 1 times [2025-03-08 01:51:30,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:30,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60788239] [2025-03-08 01:51:30,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:30,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:30,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-08 01:51:30,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-08 01:51:30,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:30,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 01:51:30,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:30,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60788239] [2025-03-08 01:51:30,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60788239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:30,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:30,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:51:30,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485900706] [2025-03-08 01:51:30,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:30,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:30,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:30,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:30,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:30,533 INFO L87 Difference]: Start difference. First operand 130272 states and 139252 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:34,285 INFO L93 Difference]: Finished difference Result 261347 states and 279240 transitions. [2025-03-08 01:51:34,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:34,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 470 [2025-03-08 01:51:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:34,449 INFO L225 Difference]: With dead ends: 261347 [2025-03-08 01:51:34,449 INFO L226 Difference]: Without dead ends: 131075 [2025-03-08 01:51:34,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:34,499 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 723 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:34,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1779 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 01:51:34,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131075 states. [2025-03-08 01:51:35,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131075 to 127907. [2025-03-08 01:51:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127907 states, 127906 states have (on average 1.0576751677012806) internal successors, (135283), 127906 states have internal predecessors, (135283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127907 states to 127907 states and 135283 transitions. [2025-03-08 01:51:36,058 INFO L78 Accepts]: Start accepts. Automaton has 127907 states and 135283 transitions. Word has length 470 [2025-03-08 01:51:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:36,058 INFO L471 AbstractCegarLoop]: Abstraction has 127907 states and 135283 transitions. [2025-03-08 01:51:36,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 127907 states and 135283 transitions. [2025-03-08 01:51:36,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-08 01:51:36,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:36,071 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:36,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 01:51:36,071 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:36,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:36,071 INFO L85 PathProgramCache]: Analyzing trace with hash -680065000, now seen corresponding path program 1 times [2025-03-08 01:51:36,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:36,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958862230] [2025-03-08 01:51:36,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:36,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:36,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-08 01:51:36,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-08 01:51:36,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:36,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2025-03-08 01:51:36,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:36,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958862230] [2025-03-08 01:51:36,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958862230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:36,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:36,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:51:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640044017] [2025-03-08 01:51:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:36,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:36,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:36,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:36,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:36,761 INFO L87 Difference]: Start difference. First operand 127907 states and 135283 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:40,502 INFO L93 Difference]: Finished difference Result 289676 states and 307864 transitions. [2025-03-08 01:51:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:40,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 601 [2025-03-08 01:51:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:40,739 INFO L225 Difference]: With dead ends: 289676 [2025-03-08 01:51:40,739 INFO L226 Difference]: Without dead ends: 171990 [2025-03-08 01:51:40,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:40,802 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 924 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 3160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:40,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 804 Invalid, 3160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 01:51:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171990 states. [2025-03-08 01:51:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171990 to 127889. [2025-03-08 01:51:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127889 states, 127888 states have (on average 1.054579006630802) internal successors, (134868), 127888 states have internal predecessors, (134868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127889 states to 127889 states and 134868 transitions. [2025-03-08 01:51:42,209 INFO L78 Accepts]: Start accepts. Automaton has 127889 states and 134868 transitions. Word has length 601 [2025-03-08 01:51:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:42,210 INFO L471 AbstractCegarLoop]: Abstraction has 127889 states and 134868 transitions. [2025-03-08 01:51:42,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 127889 states and 134868 transitions. [2025-03-08 01:51:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-03-08 01:51:42,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:42,222 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:42,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 01:51:42,222 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:42,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:42,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1520310599, now seen corresponding path program 1 times [2025-03-08 01:51:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:42,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477935050] [2025-03-08 01:51:42,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:42,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:42,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-08 01:51:42,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-08 01:51:42,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:42,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-08 01:51:42,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:42,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477935050] [2025-03-08 01:51:42,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477935050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:42,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:42,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:51:42,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388640463] [2025-03-08 01:51:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:42,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:42,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:42,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:42,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:42,710 INFO L87 Difference]: Start difference. First operand 127889 states and 134868 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:45,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:45,795 INFO L93 Difference]: Finished difference Result 299097 states and 316611 transitions. [2025-03-08 01:51:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:45,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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 607 [2025-03-08 01:51:45,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:46,000 INFO L225 Difference]: With dead ends: 299097 [2025-03-08 01:51:46,000 INFO L226 Difference]: Without dead ends: 171997 [2025-03-08 01:51:46,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:46,082 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 1007 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 805 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 805 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:46,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 606 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [805 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 01:51:46,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171997 states. [2025-03-08 01:51:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171997 to 171206. [2025-03-08 01:51:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171206 states, 171205 states have (on average 1.0549049385239917) internal successors, (180605), 171205 states have internal predecessors, (180605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171206 states to 171206 states and 180605 transitions. [2025-03-08 01:51:47,810 INFO L78 Accepts]: Start accepts. Automaton has 171206 states and 180605 transitions. Word has length 607 [2025-03-08 01:51:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:47,810 INFO L471 AbstractCegarLoop]: Abstraction has 171206 states and 180605 transitions. [2025-03-08 01:51:47,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 171206 states and 180605 transitions. [2025-03-08 01:51:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2025-03-08 01:51:47,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:47,824 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:47,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 01:51:47,825 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:47,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:47,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1095363656, now seen corresponding path program 1 times [2025-03-08 01:51:47,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:47,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328679908] [2025-03-08 01:51:47,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:47,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:47,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes.