./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label13.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b7385fd88a67a4d51b868c33a4a2a17411348aca1f3bf817148857f9693eef2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:42:30,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:42:30,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:42:30,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:42:30,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:42:31,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:42:31,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:42:31,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:42:31,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:42:31,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:42:31,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:42:31,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:42:31,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:42:31,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:42:31,030 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:42:31,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:42:31,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:42:31,030 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:42:31,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:42:31,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:42:31,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:42:31,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:42:31,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:42:31,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:42:31,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:42:31,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:42:31,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:42:31,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:42:31,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:42:31,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:42:31,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:42:31,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:42:31,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:42:31,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:42:31,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:42:31,033 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:42:31,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:42:31,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:42:31,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:42:31,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:42:31,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:42:31,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:42:31,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:42:31,034 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-jdk21/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 -> b7385fd88a67a4d51b868c33a4a2a17411348aca1f3bf817148857f9693eef2c [2025-02-05 11:42:31,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:42:31,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:42:31,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:42:31,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:42:31,306 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:42:31,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label13.c [2025-02-05 11:42:32,664 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aadf12c9e/283fb78e0d2046039874fedbb93e3162/FLAG5a09175e1 [2025-02-05 11:42:33,315 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:42:33,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label13.c [2025-02-05 11:42:33,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aadf12c9e/283fb78e0d2046039874fedbb93e3162/FLAG5a09175e1 [2025-02-05 11:42:33,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aadf12c9e/283fb78e0d2046039874fedbb93e3162 [2025-02-05 11:42:33,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:42:33,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:42:33,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:42:33,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:42:33,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:42:33,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:42:33" (1/1) ... [2025-02-05 11:42:33,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e4979a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:33, skipping insertion in model container [2025-02-05 11:42:33,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:42:33" (1/1) ... [2025-02-05 11:42:33,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:42:34,157 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label13.c[8099,8112] [2025-02-05 11:42:34,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:42:34,846 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:42:34,872 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label13.c[8099,8112] [2025-02-05 11:42:35,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:42:35,295 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:42:35,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35 WrapperNode [2025-02-05 11:42:35,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:42:35,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:42:35,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:42:35,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:42:35,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (1/1) ... [2025-02-05 11:42:35,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (1/1) ... [2025-02-05 11:42:35,799 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:42:35,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:42:35,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:42:35,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:42:35,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:42:35,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (1/1) ... [2025-02-05 11:42:35,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (1/1) ... [2025-02-05 11:42:36,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (1/1) ... [2025-02-05 11:42:36,197 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-02-05 11:42:36,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (1/1) ... [2025-02-05 11:42:36,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (1/1) ... [2025-02-05 11:42:36,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (1/1) ... [2025-02-05 11:42:36,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (1/1) ... [2025-02-05 11:42:36,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (1/1) ... [2025-02-05 11:42:36,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (1/1) ... [2025-02-05 11:42:36,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:42:36,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:42:36,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:42:36,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:42:36,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (1/1) ... [2025-02-05 11:42:36,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:42:36,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:42:36,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:42:36,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:42:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:42:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:42:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:42:36,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:42:36,699 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:42:36,702 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:42:41,966 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:42:41,967 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:42:41,967 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:42:42,164 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:42:42,164 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:42:42,210 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:42:42,211 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:42:42,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:42:42 BoogieIcfgContainer [2025-02-05 11:42:42,211 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:42:42,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:42:42,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:42:42,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:42:42,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:42:33" (1/3) ... [2025-02-05 11:42:42,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab7fe5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:42:42, skipping insertion in model container [2025-02-05 11:42:42,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:35" (2/3) ... [2025-02-05 11:42:42,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab7fe5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:42:42, skipping insertion in model container [2025-02-05 11:42:42,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:42:42" (3/3) ... [2025-02-05 11:42:42,221 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label13.c [2025-02-05 11:42:42,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:42:42,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label13.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:42:42,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:42:42,326 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;@59f5a21b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:42:42,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:42:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 11:42:42,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:42,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:42,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:42,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash -554621762, now seen corresponding path program 1 times [2025-02-05 11:42:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:42,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840179753] [2025-02-05 11:42:42,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:42,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:42,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 11:42:42,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 11:42:42,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:42,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:42:42,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:42,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840179753] [2025-02-05 11:42:42,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840179753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:42,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:42,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:42:42,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450407306] [2025-02-05 11:42:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:42,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:42,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:42,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:42,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:42,810 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:46,700 INFO L93 Difference]: Finished difference Result 3082 states and 5686 transitions. [2025-02-05 11:42:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:46,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-02-05 11:42:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:46,730 INFO L225 Difference]: With dead ends: 3082 [2025-02-05 11:42:46,730 INFO L226 Difference]: Without dead ends: 1899 [2025-02-05 11:42:46,736 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-02-05 11:42:46,742 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 982 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:46,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 646 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-05 11:42:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-02-05 11:42:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2025-02-05 11:42:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2025-02-05 11:42:46,872 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 57 [2025-02-05 11:42:46,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:46,873 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2025-02-05 11:42:46,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2025-02-05 11:42:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 11:42:46,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:46,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:46,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:42:46,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:46,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:46,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1408470310, now seen corresponding path program 1 times [2025-02-05 11:42:46,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:46,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829772686] [2025-02-05 11:42:46,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:46,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:46,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 11:42:46,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 11:42:46,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:46,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:42:47,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:47,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829772686] [2025-02-05 11:42:47,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829772686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:47,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:47,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:42:47,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105168577] [2025-02-05 11:42:47,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:47,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:47,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:47,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:47,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:47,364 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:51,127 INFO L93 Difference]: Finished difference Result 5437 states and 9566 transitions. [2025-02-05 11:42:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:51,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-02-05 11:42:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:51,144 INFO L225 Difference]: With dead ends: 5437 [2025-02-05 11:42:51,144 INFO L226 Difference]: Without dead ends: 3545 [2025-02-05 11:42:51,149 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-02-05 11:42:51,150 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3127 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 3127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:51,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 881 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 3127 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-05 11:42:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2025-02-05 11:42:51,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 3484. [2025-02-05 11:42:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3483 states have (on average 1.5865633074935401) internal successors, (5526), 3483 states have internal predecessors, (5526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 5526 transitions. [2025-02-05 11:42:51,251 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 5526 transitions. Word has length 122 [2025-02-05 11:42:51,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:51,251 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 5526 transitions. [2025-02-05 11:42:51,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 5526 transitions. [2025-02-05 11:42:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 11:42:51,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:51,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:51,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:42:51,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:51,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash 413891638, now seen corresponding path program 1 times [2025-02-05 11:42:51,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:51,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378355430] [2025-02-05 11:42:51,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:51,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 11:42:51,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 11:42:51,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:51,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:42:51,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:51,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378355430] [2025-02-05 11:42:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378355430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:51,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:51,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:42:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281821380] [2025-02-05 11:42:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:51,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:51,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:51,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:51,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:51,478 INFO L87 Difference]: Start difference. First operand 3484 states and 5526 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:54,758 INFO L93 Difference]: Finished difference Result 10138 states and 16134 transitions. [2025-02-05 11:42:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:54,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-02-05 11:42:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:54,779 INFO L225 Difference]: With dead ends: 10138 [2025-02-05 11:42:54,780 INFO L226 Difference]: Without dead ends: 6656 [2025-02-05 11:42:54,786 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-02-05 11:42:54,787 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 871 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:54,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1136 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:42:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2025-02-05 11:42:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 6655. [2025-02-05 11:42:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 6654 states have (on average 1.4171926660655245) internal successors, (9430), 6654 states have internal predecessors, (9430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 9430 transitions. [2025-02-05 11:42:54,914 INFO L78 Accepts]: Start accepts. Automaton has 6655 states and 9430 transitions. Word has length 123 [2025-02-05 11:42:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:54,914 INFO L471 AbstractCegarLoop]: Abstraction has 6655 states and 9430 transitions. [2025-02-05 11:42:54,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6655 states and 9430 transitions. [2025-02-05 11:42:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 11:42:54,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:54,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:54,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:42:54,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:54,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:54,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2047672720, now seen corresponding path program 1 times [2025-02-05 11:42:54,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:54,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721087284] [2025-02-05 11:42:54,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:54,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:54,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 11:42:54,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 11:42:54,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:54,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:42:55,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:55,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721087284] [2025-02-05 11:42:55,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721087284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:55,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:55,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:42:55,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250010287] [2025-02-05 11:42:55,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:55,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:55,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:55,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:55,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:55,093 INFO L87 Difference]: Start difference. First operand 6655 states and 9430 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:58,453 INFO L93 Difference]: Finished difference Result 14120 states and 20673 transitions. [2025-02-05 11:42:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:58,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-02-05 11:42:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:58,471 INFO L225 Difference]: With dead ends: 14120 [2025-02-05 11:42:58,472 INFO L226 Difference]: Without dead ends: 7467 [2025-02-05 11:42:58,480 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-02-05 11:42:58,480 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 872 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:58,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1176 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:42:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2025-02-05 11:42:58,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7456. [2025-02-05 11:42:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3389671361502347) internal successors, (9982), 7455 states have internal predecessors, (9982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9982 transitions. [2025-02-05 11:42:58,621 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9982 transitions. Word has length 126 [2025-02-05 11:42:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:58,621 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9982 transitions. [2025-02-05 11:42:58,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9982 transitions. [2025-02-05 11:42:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 11:42:58,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:58,623 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:42:58,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:42:58,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:58,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:58,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1940317345, now seen corresponding path program 1 times [2025-02-05 11:42:58,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:58,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999913973] [2025-02-05 11:42:58,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:58,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:58,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 11:42:58,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 11:42:58,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:58,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:42:59,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:59,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999913973] [2025-02-05 11:42:59,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999913973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:59,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:59,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:42:59,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319120305] [2025-02-05 11:42:59,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:59,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:59,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:59,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:59,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:59,062 INFO L87 Difference]: Start difference. First operand 7456 states and 9982 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:01,428 INFO L93 Difference]: Finished difference Result 14123 states and 19150 transitions. [2025-02-05 11:43:01,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-02-05 11:43:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:01,446 INFO L225 Difference]: With dead ends: 14123 [2025-02-05 11:43:01,446 INFO L226 Difference]: Without dead ends: 7456 [2025-02-05 11:43:01,453 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-02-05 11:43:01,454 INFO L435 NwaCegarLoop]: 1086 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:01,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1215 Invalid, 2542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:43:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2025-02-05 11:43:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 7456. [2025-02-05 11:43:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3362843729040912) internal successors, (9962), 7455 states have internal predecessors, (9962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9962 transitions. [2025-02-05 11:43:01,563 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9962 transitions. Word has length 168 [2025-02-05 11:43:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:01,563 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9962 transitions. [2025-02-05 11:43:01,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9962 transitions. [2025-02-05 11:43:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 11:43:01,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:01,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:43:01,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:43:01,567 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:01,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1134142027, now seen corresponding path program 1 times [2025-02-05 11:43:01,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:01,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763655872] [2025-02-05 11:43:01,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:01,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:01,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 11:43:01,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 11:43:01,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:01,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:01,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:01,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763655872] [2025-02-05 11:43:01,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763655872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:01,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:01,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:01,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765256930] [2025-02-05 11:43:01,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:01,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:43:01,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:01,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:43:01,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:43:01,773 INFO L87 Difference]: Start difference. First operand 7456 states and 9962 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:09,064 INFO L93 Difference]: Finished difference Result 26116 states and 35959 transitions. [2025-02-05 11:43:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:43:09,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-02-05 11:43:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:09,105 INFO L225 Difference]: With dead ends: 26116 [2025-02-05 11:43:09,106 INFO L226 Difference]: Without dead ends: 19449 [2025-02-05 11:43:09,118 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-02-05 11:43:09,121 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 1635 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 6046 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 6710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 6046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:09,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 1001 Invalid, 6710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 6046 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-02-05 11:43:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19449 states. [2025-02-05 11:43:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19449 to 19303. [2025-02-05 11:43:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19303 states, 19302 states have (on average 1.2778468552481608) internal successors, (24665), 19302 states have internal predecessors, (24665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19303 states to 19303 states and 24665 transitions. [2025-02-05 11:43:09,345 INFO L78 Accepts]: Start accepts. Automaton has 19303 states and 24665 transitions. Word has length 182 [2025-02-05 11:43:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:09,346 INFO L471 AbstractCegarLoop]: Abstraction has 19303 states and 24665 transitions. [2025-02-05 11:43:09,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 19303 states and 24665 transitions. [2025-02-05 11:43:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-05 11:43:09,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:09,353 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:43:09,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:43:09,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2114990533, now seen corresponding path program 1 times [2025-02-05 11:43:09,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:09,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335684167] [2025-02-05 11:43:09,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:09,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:09,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-05 11:43:09,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-05 11:43:09,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:09,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:09,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:09,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335684167] [2025-02-05 11:43:09,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335684167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:09,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:09,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:09,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395611680] [2025-02-05 11:43:09,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:09,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:09,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:09,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:09,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:09,695 INFO L87 Difference]: Start difference. First operand 19303 states and 24665 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:13,150 INFO L93 Difference]: Finished difference Result 52020 states and 67594 transitions. [2025-02-05 11:43:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:13,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2025-02-05 11:43:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:13,209 INFO L225 Difference]: With dead ends: 52020 [2025-02-05 11:43:13,209 INFO L226 Difference]: Without dead ends: 33506 [2025-02-05 11:43:13,230 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-02-05 11:43:13,231 INFO L435 NwaCegarLoop]: 1839 mSDtfsCounter, 760 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:13,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1982 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:43:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33506 states. [2025-02-05 11:43:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33506 to 33477. [2025-02-05 11:43:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33477 states, 33476 states have (on average 1.200531724220337) internal successors, (40189), 33476 states have internal predecessors, (40189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33477 states to 33477 states and 40189 transitions. [2025-02-05 11:43:13,612 INFO L78 Accepts]: Start accepts. Automaton has 33477 states and 40189 transitions. Word has length 269 [2025-02-05 11:43:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:13,613 INFO L471 AbstractCegarLoop]: Abstraction has 33477 states and 40189 transitions. [2025-02-05 11:43:13,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 33477 states and 40189 transitions. [2025-02-05 11:43:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-05 11:43:13,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:13,619 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:13,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:43:13,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:13,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1610404837, now seen corresponding path program 1 times [2025-02-05 11:43:13,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:13,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825999215] [2025-02-05 11:43:13,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:13,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:13,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-05 11:43:13,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-05 11:43:13,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:13,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:13,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:13,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825999215] [2025-02-05 11:43:13,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825999215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:13,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:13,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:13,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542807562] [2025-02-05 11:43:13,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:13,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:13,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:13,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:13,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:13,782 INFO L87 Difference]: Start difference. First operand 33477 states and 40189 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:17,014 INFO L93 Difference]: Finished difference Result 89763 states and 108792 transitions. [2025-02-05 11:43:17,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:17,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 271 [2025-02-05 11:43:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:17,093 INFO L225 Difference]: With dead ends: 89763 [2025-02-05 11:43:17,093 INFO L226 Difference]: Without dead ends: 54710 [2025-02-05 11:43:17,127 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-02-05 11:43:17,128 INFO L435 NwaCegarLoop]: 1759 mSDtfsCounter, 887 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 3242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:17,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1898 Invalid, 3242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:43:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54710 states. [2025-02-05 11:43:17,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54710 to 52341. [2025-02-05 11:43:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52341 states, 52340 states have (on average 1.1679212839128774) internal successors, (61129), 52340 states have internal predecessors, (61129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52341 states to 52341 states and 61129 transitions. [2025-02-05 11:43:17,818 INFO L78 Accepts]: Start accepts. Automaton has 52341 states and 61129 transitions. Word has length 271 [2025-02-05 11:43:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:17,820 INFO L471 AbstractCegarLoop]: Abstraction has 52341 states and 61129 transitions. [2025-02-05 11:43:17,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 52341 states and 61129 transitions. [2025-02-05 11:43:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-02-05 11:43:17,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:17,829 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:17,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:43:17,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:17,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:17,830 INFO L85 PathProgramCache]: Analyzing trace with hash -659459084, now seen corresponding path program 1 times [2025-02-05 11:43:17,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:17,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283754220] [2025-02-05 11:43:17,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:17,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:17,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-02-05 11:43:17,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-02-05 11:43:17,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:17,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 11:43:18,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283754220] [2025-02-05 11:43:18,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283754220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:18,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:18,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:18,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669678089] [2025-02-05 11:43:18,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:18,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:43:18,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:18,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:43:18,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:43:18,105 INFO L87 Difference]: Start difference. First operand 52341 states and 61129 transitions. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:24,055 INFO L93 Difference]: Finished difference Result 140312 states and 165850 transitions. [2025-02-05 11:43:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:43:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 323 [2025-02-05 11:43:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:24,163 INFO L225 Difference]: With dead ends: 140312 [2025-02-05 11:43:24,163 INFO L226 Difference]: Without dead ends: 88760 [2025-02-05 11:43:24,209 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-02-05 11:43:24,210 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 1727 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 6085 mSolverCounterSat, 999 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 7084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 999 IncrementalHoareTripleChecker+Valid, 6085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:24,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 1165 Invalid, 7084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [999 Valid, 6085 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-02-05 11:43:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88760 states. [2025-02-05 11:43:24,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88760 to 87842. [2025-02-05 11:43:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87842 states, 87841 states have (on average 1.1658792591159026) internal successors, (102412), 87841 states have internal predecessors, (102412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87842 states to 87842 states and 102412 transitions. [2025-02-05 11:43:25,156 INFO L78 Accepts]: Start accepts. Automaton has 87842 states and 102412 transitions. Word has length 323 [2025-02-05 11:43:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:25,158 INFO L471 AbstractCegarLoop]: Abstraction has 87842 states and 102412 transitions. [2025-02-05 11:43:25,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 87842 states and 102412 transitions. [2025-02-05 11:43:25,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-05 11:43:25,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:25,165 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:43:25,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:43:25,165 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:25,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2005028325, now seen corresponding path program 1 times [2025-02-05 11:43:25,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:25,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940498420] [2025-02-05 11:43:25,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:25,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:25,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-05 11:43:25,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-05 11:43:25,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:25,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 11:43:25,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:25,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940498420] [2025-02-05 11:43:25,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940498420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:25,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:25,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:25,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229131064] [2025-02-05 11:43:25,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:25,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:25,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:25,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:25,626 INFO L87 Difference]: Start difference. First operand 87842 states and 102412 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:29,556 INFO L93 Difference]: Finished difference Result 213468 states and 252357 transitions. [2025-02-05 11:43:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:29,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 348 [2025-02-05 11:43:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:29,720 INFO L225 Difference]: With dead ends: 213468 [2025-02-05 11:43:29,720 INFO L226 Difference]: Without dead ends: 126415 [2025-02-05 11:43:29,786 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-02-05 11:43:29,787 INFO L435 NwaCegarLoop]: 1867 mSDtfsCounter, 786 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 3303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:29,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 2009 Invalid, 3303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:43:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126415 states. [2025-02-05 11:43:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126415 to 122470. [2025-02-05 11:43:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122470 states, 122469 states have (on average 1.1388514644522287) internal successors, (139474), 122469 states have internal predecessors, (139474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122470 states to 122470 states and 139474 transitions. [2025-02-05 11:43:31,246 INFO L78 Accepts]: Start accepts. Automaton has 122470 states and 139474 transitions. Word has length 348 [2025-02-05 11:43:31,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:31,247 INFO L471 AbstractCegarLoop]: Abstraction has 122470 states and 139474 transitions. [2025-02-05 11:43:31,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:31,247 INFO L276 IsEmpty]: Start isEmpty. Operand 122470 states and 139474 transitions. [2025-02-05 11:43:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-05 11:43:31,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:31,255 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:43:31,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:43:31,255 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:31,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 159490439, now seen corresponding path program 1 times [2025-02-05 11:43:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:31,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268730841] [2025-02-05 11:43:31,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:31,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-05 11:43:31,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-05 11:43:31,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:31,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 238 proven. 113 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 11:43:32,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:32,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268730841] [2025-02-05 11:43:32,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268730841] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:43:32,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156258465] [2025-02-05 11:43:32,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:32,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:43:32,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:43:32,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:43:32,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:43:32,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-05 11:43:32,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-05 11:43:32,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:32,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:32,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:43:32,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:43:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 11:43:32,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:43:32,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156258465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:32,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:43:32,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:43:32,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351983714] [2025-02-05 11:43:32,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:32,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:32,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:32,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:32,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:43:32,928 INFO L87 Difference]: Start difference. First operand 122470 states and 139474 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:36,101 INFO L93 Difference]: Finished difference Result 244140 states and 278144 transitions. [2025-02-05 11:43:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:36,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 363 [2025-02-05 11:43:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:36,240 INFO L225 Difference]: With dead ends: 244140 [2025-02-05 11:43:36,240 INFO L226 Difference]: Without dead ends: 122459 [2025-02-05 11:43:36,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:43:36,311 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 1075 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:36,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 796 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:43:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122459 states. [2025-02-05 11:43:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122459 to 122456. [2025-02-05 11:43:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122456 states, 122455 states have (on average 1.1027806132865134) internal successors, (135041), 122455 states have internal predecessors, (135041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122456 states to 122456 states and 135041 transitions. [2025-02-05 11:43:37,661 INFO L78 Accepts]: Start accepts. Automaton has 122456 states and 135041 transitions. Word has length 363 [2025-02-05 11:43:37,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:37,661 INFO L471 AbstractCegarLoop]: Abstraction has 122456 states and 135041 transitions. [2025-02-05 11:43:37,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 122456 states and 135041 transitions. [2025-02-05 11:43:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-02-05 11:43:37,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:37,666 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-02-05 11:43:37,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:43:37,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 11:43:37,867 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:37,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:37,868 INFO L85 PathProgramCache]: Analyzing trace with hash 603548448, now seen corresponding path program 1 times [2025-02-05 11:43:37,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:37,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008316836] [2025-02-05 11:43:37,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:37,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:37,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-05 11:43:37,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-05 11:43:37,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:37,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 278 proven. 113 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 11:43:39,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:39,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008316836] [2025-02-05 11:43:39,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008316836] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:43:39,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156749387] [2025-02-05 11:43:39,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:39,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:43:39,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:43:39,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:43:39,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:43:39,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-05 11:43:39,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-05 11:43:39,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:39,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:39,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:43:39,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:43:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-05 11:43:39,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:43:39,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156749387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:39,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:43:39,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:43:39,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120308443] [2025-02-05 11:43:39,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:39,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:39,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:39,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:39,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:43:39,736 INFO L87 Difference]: Start difference. First operand 122456 states and 135041 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:43,063 INFO L93 Difference]: Finished difference Result 243333 states and 268309 transitions. [2025-02-05 11:43:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:43,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 383 [2025-02-05 11:43:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:43,221 INFO L225 Difference]: With dead ends: 243333 [2025-02-05 11:43:43,221 INFO L226 Difference]: Without dead ends: 121666 [2025-02-05 11:43:43,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:43:43,300 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 1112 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:43,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1421 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:43:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121666 states. [2025-02-05 11:43:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121666 to 120874. [2025-02-05 11:43:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120874 states, 120873 states have (on average 1.0777013890612461) internal successors, (130265), 120873 states have internal predecessors, (130265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120874 states to 120874 states and 130265 transitions. [2025-02-05 11:43:44,700 INFO L78 Accepts]: Start accepts. Automaton has 120874 states and 130265 transitions. Word has length 383 [2025-02-05 11:43:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:44,700 INFO L471 AbstractCegarLoop]: Abstraction has 120874 states and 130265 transitions. [2025-02-05 11:43:44,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 120874 states and 130265 transitions. [2025-02-05 11:43:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-05 11:43:44,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:44,706 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:43:44,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:43:44,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:43:44,907 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:44,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash -857311068, now seen corresponding path program 1 times [2025-02-05 11:43:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:44,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045756689] [2025-02-05 11:43:44,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:44,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 11:43:44,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 11:43:44,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:44,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 350 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 11:43:46,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:46,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045756689] [2025-02-05 11:43:46,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045756689] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:43:46,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360296015] [2025-02-05 11:43:46,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:46,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:43:46,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:43:46,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:43:46,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:43:46,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 11:43:46,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 11:43:46,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:46,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:46,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:43:46,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:43:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-02-05 11:43:46,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:43:46,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360296015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:46,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:43:46,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:43:46,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747681506] [2025-02-05 11:43:46,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:46,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:46,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:46,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:43:46,400 INFO L87 Difference]: Start difference. First operand 120874 states and 130265 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)