./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/Problem19_label11.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 ce9ec331bbd0957d91f023d2cde751d43aea048fc58a1bf2a8faaac825bae047 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:09:38,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:09:38,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:09:38,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:09:38,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:09:38,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:09:38,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:09:38,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:09:38,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:09:38,266 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:09:38,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:09:38,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:09:38,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:09:38,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:09:38,268 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:09:38,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:09:38,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:09:38,268 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:09:38,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:09:38,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:09:38,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:09:38,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:09:38,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:09:38,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:09:38,269 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:09:38,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:09:38,269 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:09:38,269 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:09:38,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:09:38,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:09:38,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:09:38,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:09:38,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:09:38,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:09:38,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:09:38,270 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:09:38,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:09:38,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:09:38,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:09:38,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:09:38,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:09:38,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:09:38,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:09:38,271 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 -> ce9ec331bbd0957d91f023d2cde751d43aea048fc58a1bf2a8faaac825bae047 [2025-03-03 11:09:38,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:09:38,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:09:38,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:09:38,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:09:38,495 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:09:38,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label11.c [2025-03-03 11:09:39,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c952f2a4/b8fad4aad9c74bb5b0b3fdf05768702c/FLAG81a9845cd [2025-03-03 11:09:40,052 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:09:40,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label11.c [2025-03-03 11:09:40,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c952f2a4/b8fad4aad9c74bb5b0b3fdf05768702c/FLAG81a9845cd [2025-03-03 11:09:40,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c952f2a4/b8fad4aad9c74bb5b0b3fdf05768702c [2025-03-03 11:09:40,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:09:40,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:09:40,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:09:40,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:09:40,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:09:40,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:09:40" (1/1) ... [2025-03-03 11:09:40,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b53348a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:40, skipping insertion in model container [2025-03-03 11:09:40,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:09:40" (1/1) ... [2025-03-03 11:09:40,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:09:40,515 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/Problem19_label11.c[2490,2503] [2025-03-03 11:09:41,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:09:41,209 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:09:41,222 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/Problem19_label11.c[2490,2503] [2025-03-03 11:09:41,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:09:41,685 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:09:41,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41 WrapperNode [2025-03-03 11:09:41,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:09:41,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:09:41,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:09:41,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:09:41,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (1/1) ... [2025-03-03 11:09:41,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (1/1) ... [2025-03-03 11:09:42,216 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-03 11:09:42,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:09:42,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:09:42,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:09:42,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:09:42,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (1/1) ... [2025-03-03 11:09:42,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (1/1) ... [2025-03-03 11:09:42,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (1/1) ... [2025-03-03 11:09:42,579 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-03 11:09:42,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (1/1) ... [2025-03-03 11:09:42,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (1/1) ... [2025-03-03 11:09:42,923 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (1/1) ... [2025-03-03 11:09:42,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (1/1) ... [2025-03-03 11:09:42,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (1/1) ... [2025-03-03 11:09:43,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (1/1) ... [2025-03-03 11:09:43,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:09:43,106 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:09:43,106 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:09:43,107 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:09:43,108 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (1/1) ... [2025-03-03 11:09:43,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:09:43,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:09:43,133 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-03 11:09:43,135 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-03 11:09:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:09:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:09:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:09:43,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:09:43,195 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:09:43,197 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:09:48,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-03 11:09:48,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-03 11:09:48,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-03 11:09:48,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-03 11:09:48,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-03 11:09:48,918 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-03 11:09:48,918 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:09:48,959 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:09:48,960 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:09:48,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:48 BoogieIcfgContainer [2025-03-03 11:09:48,961 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:09:48,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:09:48,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:09:48,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:09:48,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:09:40" (1/3) ... [2025-03-03 11:09:48,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7a1ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:09:48, skipping insertion in model container [2025-03-03 11:09:48,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:41" (2/3) ... [2025-03-03 11:09:48,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7a1ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:09:48, skipping insertion in model container [2025-03-03 11:09:48,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:48" (3/3) ... [2025-03-03 11:09:48,968 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label11.c [2025-03-03 11:09:48,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:09:48,982 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label11.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:09:49,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:09:49,074 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;@5054bd0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:09:49,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:09:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:09:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 11:09:49,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:09:49,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:09:49,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:09:49,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:09:49,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1205068271, now seen corresponding path program 1 times [2025-03-03 11:09:49,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:09:49,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403955301] [2025-03-03 11:09:49,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:09:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:09:49,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 11:09:49,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 11:09:49,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:09:49,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:09:49,278 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-03 11:09:49,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:09:49,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403955301] [2025-03-03 11:09:49,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403955301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:09:49,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:09:49,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:09:49,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037639039] [2025-03-03 11:09:49,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:09:49,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:09:49,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:09:49,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:09:49,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:09:49,304 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 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 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:09:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:09:54,748 INFO L93 Difference]: Finished difference Result 4957 states and 9395 transitions. [2025-03-03 11:09:54,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:09:54,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-03-03 11:09:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:09:54,774 INFO L225 Difference]: With dead ends: 4957 [2025-03-03 11:09:54,774 INFO L226 Difference]: Without dead ends: 3129 [2025-03-03 11:09:54,780 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-03 11:09:54,781 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 1610 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 4344 mSolverCounterSat, 1517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 5861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1517 IncrementalHoareTripleChecker+Valid, 4344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:09:54,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 1598 Invalid, 5861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1517 Valid, 4344 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-03 11:09:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2025-03-03 11:09:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 3108. [2025-03-03 11:09:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 3107 states have (on average 1.6012230447376892) internal successors, (4975), 3107 states have internal predecessors, (4975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:09:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4975 transitions. [2025-03-03 11:09:54,882 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4975 transitions. Word has length 16 [2025-03-03 11:09:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:09:54,882 INFO L471 AbstractCegarLoop]: Abstraction has 3108 states and 4975 transitions. [2025-03-03 11:09:54,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:09:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4975 transitions. [2025-03-03 11:09:54,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 11:09:54,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:09:54,884 INFO L218 NwaCegarLoop]: trace histogram [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-03 11:09:54,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:09:54,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:09:54,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:09:54,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1753972814, now seen corresponding path program 1 times [2025-03-03 11:09:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:09:54,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322707710] [2025-03-03 11:09:54,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:09:54,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:09:54,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 11:09:54,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 11:09:54,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:09:54,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:09:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:09:55,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:09:55,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322707710] [2025-03-03 11:09:55,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322707710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:09:55,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:09:55,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:09:55,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259269292] [2025-03-03 11:09:55,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:09:55,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:09:55,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:09:55,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:09:55,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:09:55,267 INFO L87 Difference]: Start difference. First operand 3108 states and 4975 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:10:02,348 INFO L93 Difference]: Finished difference Result 10359 states and 16187 transitions. [2025-03-03 11:10:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:10:02,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-03 11:10:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:10:02,371 INFO L225 Difference]: With dead ends: 10359 [2025-03-03 11:10:02,371 INFO L226 Difference]: Without dead ends: 7253 [2025-03-03 11:10:02,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:10:02,377 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 4321 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 9504 mSolverCounterSat, 1498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 11002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1498 IncrementalHoareTripleChecker+Valid, 9504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:10:02,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4321 Valid, 1298 Invalid, 11002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1498 Valid, 9504 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-03-03 11:10:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7253 states. [2025-03-03 11:10:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7253 to 7249. [2025-03-03 11:10:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7249 states, 7248 states have (on average 1.4501931567328918) internal successors, (10511), 7248 states have internal predecessors, (10511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7249 states to 7249 states and 10511 transitions. [2025-03-03 11:10:02,488 INFO L78 Accepts]: Start accepts. Automaton has 7249 states and 10511 transitions. Word has length 83 [2025-03-03 11:10:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:10:02,489 INFO L471 AbstractCegarLoop]: Abstraction has 7249 states and 10511 transitions. [2025-03-03 11:10:02,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7249 states and 10511 transitions. [2025-03-03 11:10:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-03 11:10:02,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:10:02,500 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:10:02,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:10:02,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:10:02,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:10:02,501 INFO L85 PathProgramCache]: Analyzing trace with hash 818138462, now seen corresponding path program 1 times [2025-03-03 11:10:02,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:10:02,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885781700] [2025-03-03 11:10:02,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:02,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:10:02,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-03 11:10:02,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-03 11:10:02,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:02,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 11:10:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:10:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885781700] [2025-03-03 11:10:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885781700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:10:03,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:10:03,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:10:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938253949] [2025-03-03 11:10:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:10:03,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:10:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:10:03,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:10:03,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:10:03,318 INFO L87 Difference]: Start difference. First operand 7249 states and 10511 transitions. Second operand has 4 states, 4 states have (on average 71.75) 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-03 11:10:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:10:09,539 INFO L93 Difference]: Finished difference Result 17269 states and 24865 transitions. [2025-03-03 11:10:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:10:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) 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 300 [2025-03-03 11:10:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:10:09,563 INFO L225 Difference]: With dead ends: 17269 [2025-03-03 11:10:09,564 INFO L226 Difference]: Without dead ends: 11387 [2025-03-03 11:10:09,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:10:09,568 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 3756 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9455 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 9885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 9455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:10:09,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2159 Invalid, 9885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 9455 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-03-03 11:10:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11387 states. [2025-03-03 11:10:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11387 to 11367. [2025-03-03 11:10:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11367 states, 11366 states have (on average 1.328523667077248) internal successors, (15100), 11366 states have internal predecessors, (15100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 15100 transitions. [2025-03-03 11:10:09,697 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 15100 transitions. Word has length 300 [2025-03-03 11:10:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:10:09,699 INFO L471 AbstractCegarLoop]: Abstraction has 11367 states and 15100 transitions. [2025-03-03 11:10:09,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) 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-03 11:10:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 15100 transitions. [2025-03-03 11:10:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 11:10:09,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:10:09,703 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:10:09,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:10:09,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:10:09,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:10:09,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1119481844, now seen corresponding path program 1 times [2025-03-03 11:10:09,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:10:09,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482257553] [2025-03-03 11:10:09,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:09,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:10:09,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 11:10:09,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 11:10:09,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:09,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:10:10,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:10:10,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482257553] [2025-03-03 11:10:10,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482257553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:10:10,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:10:10,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:10:10,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289699935] [2025-03-03 11:10:10,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:10:10,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:10:10,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:10:10,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:10:10,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:10:10,177 INFO L87 Difference]: Start difference. First operand 11367 states and 15100 transitions. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:10:14,660 INFO L93 Difference]: Finished difference Result 20033 states and 27481 transitions. [2025-03-03 11:10:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:10:14,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 328 [2025-03-03 11:10:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:10:14,683 INFO L225 Difference]: With dead ends: 20033 [2025-03-03 11:10:14,683 INFO L226 Difference]: Without dead ends: 11367 [2025-03-03 11:10:14,688 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-03 11:10:14,688 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7325 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:10:14,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2117 Invalid, 7333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7325 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 11:10:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11367 states. [2025-03-03 11:10:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11367 to 11367. [2025-03-03 11:10:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11367 states, 11366 states have (on average 1.327379904979764) internal successors, (15087), 11366 states have internal predecessors, (15087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 15087 transitions. [2025-03-03 11:10:14,812 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 15087 transitions. Word has length 328 [2025-03-03 11:10:14,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:10:14,812 INFO L471 AbstractCegarLoop]: Abstraction has 11367 states and 15087 transitions. [2025-03-03 11:10:14,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 15087 transitions. [2025-03-03 11:10:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-03 11:10:14,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:10:14,824 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:10:14,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:10:14,824 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:10:14,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:10:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash 695656881, now seen corresponding path program 1 times [2025-03-03 11:10:14,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:10:14,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408568045] [2025-03-03 11:10:14,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:14,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:10:14,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-03 11:10:14,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-03 11:10:14,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:14,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 27 proven. 43 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 11:10:15,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:10:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408568045] [2025-03-03 11:10:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408568045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:10:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432462652] [2025-03-03 11:10:15,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:15,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:10:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:10:15,402 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-03 11:10:15,403 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-03 11:10:15,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-03 11:10:15,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-03 11:10:15,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:15,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:15,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:10:15,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:10:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:10:15,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:10:15,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432462652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:10:15,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:10:15,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 11:10:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723869452] [2025-03-03 11:10:15,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:10:15,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:10:15,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:10:15,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:10:15,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:10:15,765 INFO L87 Difference]: Start difference. First operand 11367 states and 15087 transitions. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:10:19,946 INFO L93 Difference]: Finished difference Result 28211 states and 39183 transitions. [2025-03-03 11:10:19,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:10:19,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 572 [2025-03-03 11:10:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:10:19,975 INFO L225 Difference]: With dead ends: 28211 [2025-03-03 11:10:19,975 INFO L226 Difference]: Without dead ends: 19576 [2025-03-03 11:10:19,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:10:19,986 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 1775 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 3854 mSolverCounterSat, 1728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 5582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1728 IncrementalHoareTripleChecker+Valid, 3854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:10:19,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 1445 Invalid, 5582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1728 Valid, 3854 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 11:10:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19576 states. [2025-03-03 11:10:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19576 to 19575. [2025-03-03 11:10:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19575 states, 19574 states have (on average 1.2423623173597629) internal successors, (24318), 19574 states have internal predecessors, (24318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19575 states to 19575 states and 24318 transitions. [2025-03-03 11:10:20,158 INFO L78 Accepts]: Start accepts. Automaton has 19575 states and 24318 transitions. Word has length 572 [2025-03-03 11:10:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:10:20,159 INFO L471 AbstractCegarLoop]: Abstraction has 19575 states and 24318 transitions. [2025-03-03 11:10:20,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand 19575 states and 24318 transitions. [2025-03-03 11:10:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-03 11:10:20,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:10:20,168 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:10:20,177 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-03 11:10:20,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:10:20,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:10:20,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:10:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -326600655, now seen corresponding path program 1 times [2025-03-03 11:10:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:10:20,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188269685] [2025-03-03 11:10:20,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:20,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:10:20,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-03 11:10:20,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-03 11:10:20,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:20,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:10:20,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:10:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188269685] [2025-03-03 11:10:20,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188269685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:10:20,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:10:20,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:10:20,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462237598] [2025-03-03 11:10:20,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:10:20,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:10:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:10:20,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:10:20,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:10:20,836 INFO L87 Difference]: Start difference. First operand 19575 states and 24318 transitions. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:10:25,211 INFO L93 Difference]: Finished difference Result 46052 states and 59454 transitions. [2025-03-03 11:10:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:10:25,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 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 577 [2025-03-03 11:10:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:10:25,251 INFO L225 Difference]: With dead ends: 46052 [2025-03-03 11:10:25,251 INFO L226 Difference]: Without dead ends: 29209 [2025-03-03 11:10:25,269 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-03 11:10:25,270 INFO L435 NwaCegarLoop]: 2993 mSDtfsCounter, 1421 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 4130 mSolverCounterSat, 1663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 5793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1663 IncrementalHoareTripleChecker+Valid, 4130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:10:25,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 3163 Invalid, 5793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1663 Valid, 4130 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-03 11:10:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29209 states. [2025-03-03 11:10:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29209 to 27797. [2025-03-03 11:10:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27797 states, 27796 states have (on average 1.223125629586991) internal successors, (33998), 27796 states have internal predecessors, (33998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27797 states to 27797 states and 33998 transitions. [2025-03-03 11:10:25,635 INFO L78 Accepts]: Start accepts. Automaton has 27797 states and 33998 transitions. Word has length 577 [2025-03-03 11:10:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:10:25,636 INFO L471 AbstractCegarLoop]: Abstraction has 27797 states and 33998 transitions. [2025-03-03 11:10:25,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 27797 states and 33998 transitions. [2025-03-03 11:10:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-03-03 11:10:25,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:10:25,643 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:10:25,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:10:25,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:10:25,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:10:25,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1650035299, now seen corresponding path program 1 times [2025-03-03 11:10:25,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:10:25,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399049606] [2025-03-03 11:10:25,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:25,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:10:25,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-03 11:10:25,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-03 11:10:25,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:25,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-03 11:10:25,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:10:25,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399049606] [2025-03-03 11:10:25,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399049606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:10:25,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:10:25,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:10:25,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302828567] [2025-03-03 11:10:25,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:10:25,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:10:25,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:10:25,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:10:25,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:10:25,884 INFO L87 Difference]: Start difference. First operand 27797 states and 33998 transitions. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 2 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:10:30,434 INFO L93 Difference]: Finished difference Result 76271 states and 94708 transitions. [2025-03-03 11:10:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:10:30,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 2 states have internal predecessors, (505), 0 states have call successors, (0), 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 580 [2025-03-03 11:10:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:10:30,490 INFO L225 Difference]: With dead ends: 76271 [2025-03-03 11:10:30,491 INFO L226 Difference]: Without dead ends: 51206 [2025-03-03 11:10:30,508 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-03 11:10:30,509 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 2111 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 5097 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 5531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:10:30,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 964 Invalid, 5531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5097 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 11:10:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51206 states. [2025-03-03 11:10:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51206 to 49837. [2025-03-03 11:10:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49837 states, 49836 states have (on average 1.2111525804639216) internal successors, (60359), 49836 states have internal predecessors, (60359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49837 states to 49837 states and 60359 transitions. [2025-03-03 11:10:30,916 INFO L78 Accepts]: Start accepts. Automaton has 49837 states and 60359 transitions. Word has length 580 [2025-03-03 11:10:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:10:30,918 INFO L471 AbstractCegarLoop]: Abstraction has 49837 states and 60359 transitions. [2025-03-03 11:10:30,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 2 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 49837 states and 60359 transitions. [2025-03-03 11:10:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2025-03-03 11:10:30,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:10:30,923 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:10:30,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:10:30,923 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:10:30,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:10:30,924 INFO L85 PathProgramCache]: Analyzing trace with hash -36713050, now seen corresponding path program 1 times [2025-03-03 11:10:30,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:10:30,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839660487] [2025-03-03 11:10:30,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:10:30,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes. [2025-03-03 11:10:31,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements. [2025-03-03 11:10:31,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:31,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-03 11:10:31,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:10:31,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839660487] [2025-03-03 11:10:31,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839660487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:10:31,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:10:31,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:10:31,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77603430] [2025-03-03 11:10:31,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:10:31,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:10:31,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:10:31,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:10:31,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:10:31,377 INFO L87 Difference]: Start difference. First operand 49837 states and 60359 transitions. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:36,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:10:36,133 INFO L93 Difference]: Finished difference Result 114727 states and 142448 transitions. [2025-03-03 11:10:36,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:10:36,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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 809 [2025-03-03 11:10:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:10:36,215 INFO L225 Difference]: With dead ends: 114727 [2025-03-03 11:10:36,215 INFO L226 Difference]: Without dead ends: 67622 [2025-03-03 11:10:36,252 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-03 11:10:36,253 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 1543 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 4036 mSolverCounterSat, 1699 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 5735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1699 IncrementalHoareTripleChecker+Valid, 4036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:10:36,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 1672 Invalid, 5735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1699 Valid, 4036 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 11:10:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2025-03-03 11:10:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 49783. [2025-03-03 11:10:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49783 states, 49782 states have (on average 1.2108191715881242) internal successors, (60277), 49782 states have internal predecessors, (60277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49783 states to 49783 states and 60277 transitions. [2025-03-03 11:10:36,821 INFO L78 Accepts]: Start accepts. Automaton has 49783 states and 60277 transitions. Word has length 809 [2025-03-03 11:10:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:10:36,821 INFO L471 AbstractCegarLoop]: Abstraction has 49783 states and 60277 transitions. [2025-03-03 11:10:36,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 49783 states and 60277 transitions. [2025-03-03 11:10:36,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-03-03 11:10:36,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:10:36,827 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:10:36,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:10:36,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:10:36,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:10:36,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1696665155, now seen corresponding path program 1 times [2025-03-03 11:10:36,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:10:36,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797789648] [2025-03-03 11:10:36,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:36,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:10:36,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-03-03 11:10:36,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-03-03 11:10:36,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:36,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-03 11:10:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:10:37,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797789648] [2025-03-03 11:10:37,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797789648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:10:37,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:10:37,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:10:37,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657533949] [2025-03-03 11:10:37,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:10:37,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:10:37,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:10:37,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:10:37,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:10:37,169 INFO L87 Difference]: Start difference. First operand 49783 states and 60277 transitions. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:10:41,540 INFO L93 Difference]: Finished difference Result 115967 states and 141280 transitions. [2025-03-03 11:10:41,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:10:41,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 0 states have call successors, (0), 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 833 [2025-03-03 11:10:41,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:10:41,609 INFO L225 Difference]: With dead ends: 115967 [2025-03-03 11:10:41,609 INFO L226 Difference]: Without dead ends: 68916 [2025-03-03 11:10:41,630 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-03 11:10:41,631 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 1371 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 3926 mSolverCounterSat, 2082 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 6008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2082 IncrementalHoareTripleChecker+Valid, 3926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:10:41,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 746 Invalid, 6008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2082 Valid, 3926 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 11:10:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68916 states. [2025-03-03 11:10:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68916 to 68899. [2025-03-03 11:10:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68899 states, 68898 states have (on average 1.1851287410374758) internal successors, (81653), 68898 states have internal predecessors, (81653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68899 states to 68899 states and 81653 transitions. [2025-03-03 11:10:42,197 INFO L78 Accepts]: Start accepts. Automaton has 68899 states and 81653 transitions. Word has length 833 [2025-03-03 11:10:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:10:42,197 INFO L471 AbstractCegarLoop]: Abstraction has 68899 states and 81653 transitions. [2025-03-03 11:10:42,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 68899 states and 81653 transitions. [2025-03-03 11:10:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2025-03-03 11:10:42,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:10:42,203 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:10:42,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 11:10:42,203 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:10:42,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:10:42,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1795181970, now seen corresponding path program 1 times [2025-03-03 11:10:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:10:42,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111273991] [2025-03-03 11:10:42,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:10:42,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 875 statements into 1 equivalence classes. [2025-03-03 11:10:42,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 875 of 875 statements. [2025-03-03 11:10:42,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:42,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-03 11:10:43,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:10:43,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111273991] [2025-03-03 11:10:43,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111273991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:10:43,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:10:43,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:10:43,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985380625] [2025-03-03 11:10:43,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:10:43,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:10:43,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:10:43,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:10:43,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:10:43,095 INFO L87 Difference]: Start difference. First operand 68899 states and 81653 transitions. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:10:48,045 INFO L93 Difference]: Finished difference Result 174747 states and 209480 transitions. [2025-03-03 11:10:48,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:10:48,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 875 [2025-03-03 11:10:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:10:48,189 INFO L225 Difference]: With dead ends: 174747 [2025-03-03 11:10:48,189 INFO L226 Difference]: Without dead ends: 108580 [2025-03-03 11:10:48,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:10:48,231 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 1549 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4245 mSolverCounterSat, 2310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 6555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2310 IncrementalHoareTripleChecker+Valid, 4245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:10:48,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 643 Invalid, 6555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2310 Valid, 4245 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 11:10:48,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108580 states. [2025-03-03 11:10:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108580 to 100293. [2025-03-03 11:10:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100293 states, 100292 states have (on average 1.2114625294141108) internal successors, (121500), 100292 states have internal predecessors, (121500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100293 states to 100293 states and 121500 transitions. [2025-03-03 11:10:49,130 INFO L78 Accepts]: Start accepts. Automaton has 100293 states and 121500 transitions. Word has length 875 [2025-03-03 11:10:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:10:49,131 INFO L471 AbstractCegarLoop]: Abstraction has 100293 states and 121500 transitions. [2025-03-03 11:10:49,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 100293 states and 121500 transitions. [2025-03-03 11:10:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2025-03-03 11:10:49,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:10:49,137 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:10:49,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:10:49,138 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:10:49,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:10:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash -389378430, now seen corresponding path program 1 times [2025-03-03 11:10:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:10:49,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33507124] [2025-03-03 11:10:49,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:49,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:10:49,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 906 statements into 1 equivalence classes. [2025-03-03 11:10:49,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 906 of 906 statements. [2025-03-03 11:10:49,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:49,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-03 11:10:49,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:10:49,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33507124] [2025-03-03 11:10:49,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33507124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:10:49,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:10:49,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:10:49,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545516078] [2025-03-03 11:10:49,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:10:49,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:10:49,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:10:49,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:10:49,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:10:49,650 INFO L87 Difference]: Start difference. First operand 100293 states and 121500 transitions. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:10:53,678 INFO L93 Difference]: Finished difference Result 201959 states and 244458 transitions. [2025-03-03 11:10:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:10:53,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 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 906 [2025-03-03 11:10:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:10:53,798 INFO L225 Difference]: With dead ends: 201959 [2025-03-03 11:10:53,798 INFO L226 Difference]: Without dead ends: 104398 [2025-03-03 11:10:53,861 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-03 11:10:53,861 INFO L435 NwaCegarLoop]: 2870 mSDtfsCounter, 1501 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 3667 mSolverCounterSat, 1461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 5128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1461 IncrementalHoareTripleChecker+Valid, 3667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:10:53,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 3043 Invalid, 5128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1461 Valid, 3667 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-03 11:10:53,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104398 states. [2025-03-03 11:10:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104398 to 100291. [2025-03-03 11:10:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100291 states, 100290 states have (on average 1.153056137202114) internal successors, (115640), 100290 states have internal predecessors, (115640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100291 states to 100291 states and 115640 transitions. [2025-03-03 11:10:54,855 INFO L78 Accepts]: Start accepts. Automaton has 100291 states and 115640 transitions. Word has length 906 [2025-03-03 11:10:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:10:54,855 INFO L471 AbstractCegarLoop]: Abstraction has 100291 states and 115640 transitions. [2025-03-03 11:10:54,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 100291 states and 115640 transitions. [2025-03-03 11:10:54,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 974 [2025-03-03 11:10:54,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:10:54,862 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:10:54,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 11:10:54,863 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:10:54,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:10:54,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2125133748, now seen corresponding path program 1 times [2025-03-03 11:10:54,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:10:54,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291334297] [2025-03-03 11:10:54,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:54,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:10:54,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 973 statements into 1 equivalence classes. [2025-03-03 11:10:55,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 973 of 973 statements. [2025-03-03 11:10:55,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:55,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-03 11:10:55,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:10:55,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291334297] [2025-03-03 11:10:55,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291334297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:10:55,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:10:55,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:10:55,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494120021] [2025-03-03 11:10:55,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:10:55,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:10:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:10:55,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:10:55,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:10:55,387 INFO L87 Difference]: Start difference. First operand 100291 states and 115640 transitions. Second operand has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:11:03,173 INFO L93 Difference]: Finished difference Result 298888 states and 353073 transitions. [2025-03-03 11:11:03,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:11:03,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 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 973 [2025-03-03 11:11:03,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:11:03,416 INFO L225 Difference]: With dead ends: 298888 [2025-03-03 11:11:03,417 INFO L226 Difference]: Without dead ends: 201329 [2025-03-03 11:11:03,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:11:03,500 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 4887 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 5944 mSolverCounterSat, 4147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4887 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 10091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4147 IncrementalHoareTripleChecker+Valid, 5944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:11:03,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4887 Valid, 1081 Invalid, 10091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4147 Valid, 5944 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-03-03 11:11:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201329 states. [2025-03-03 11:11:05,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201329 to 190391. [2025-03-03 11:11:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190391 states, 190390 states have (on average 1.146966752455486) internal successors, (218371), 190390 states have internal predecessors, (218371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190391 states to 190391 states and 218371 transitions. [2025-03-03 11:11:05,355 INFO L78 Accepts]: Start accepts. Automaton has 190391 states and 218371 transitions. Word has length 973 [2025-03-03 11:11:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:11:05,356 INFO L471 AbstractCegarLoop]: Abstraction has 190391 states and 218371 transitions. [2025-03-03 11:11:05,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 190391 states and 218371 transitions.