./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa83d3f5173117ef698c13f0bcf19338ee3f6f59e63ac9b8ac7bd80f7d40c635 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:25:13,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:25:14,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:25:14,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:25:14,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:25:14,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:25:14,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:25:14,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:25:14,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:25:14,078 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:25:14,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:25:14,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:25:14,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:25:14,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:25:14,079 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:25:14,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:25:14,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:25:14,080 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:25:14,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:25:14,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:25:14,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:25:14,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:25:14,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:25:14,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:25:14,080 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:25:14,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:25:14,080 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:25:14,081 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:25:14,081 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:25:14,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:25:14,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:25:14,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:25:14,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:25:14,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:25:14,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:25:14,082 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:25:14,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:25:14,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:25:14,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:25:14,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:25:14,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:25:14,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:25:14,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:25:14,082 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa83d3f5173117ef698c13f0bcf19338ee3f6f59e63ac9b8ac7bd80f7d40c635 [2025-03-16 20:25:14,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:25:14,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:25:14,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:25:14,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:25:14,306 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:25:14,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:25:15,414 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d38b6c4b/bf420509b510489b80ec5df5c8734e67/FLAG98182e148 [2025-03-16 20:25:15,902 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:25:15,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:25:15,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d38b6c4b/bf420509b510489b80ec5df5c8734e67/FLAG98182e148 [2025-03-16 20:25:15,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d38b6c4b/bf420509b510489b80ec5df5c8734e67 [2025-03-16 20:25:15,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:25:15,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:25:15,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:25:15,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:25:15,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:25:15,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:25:15" (1/1) ... [2025-03-16 20:25:15,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b75528f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:15, skipping insertion in model container [2025-03-16 20:25:15,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:25:15" (1/1) ... [2025-03-16 20:25:16,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:25:16,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[8786,8799] [2025-03-16 20:25:16,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[14341,14354] [2025-03-16 20:25:16,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:25:16,703 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:25:16,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[8786,8799] [2025-03-16 20:25:16,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[14341,14354] [2025-03-16 20:25:16,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:25:16,980 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:25:16,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16 WrapperNode [2025-03-16 20:25:16,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:25:16,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:25:16,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:25:16,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:25:16,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (1/1) ... [2025-03-16 20:25:17,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (1/1) ... [2025-03-16 20:25:17,272 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5031 [2025-03-16 20:25:17,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:25:17,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:25:17,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:25:17,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:25:17,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (1/1) ... [2025-03-16 20:25:17,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (1/1) ... [2025-03-16 20:25:17,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (1/1) ... [2025-03-16 20:25:17,441 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:25:17,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (1/1) ... [2025-03-16 20:25:17,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (1/1) ... [2025-03-16 20:25:17,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (1/1) ... [2025-03-16 20:25:17,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (1/1) ... [2025-03-16 20:25:17,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (1/1) ... [2025-03-16 20:25:17,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (1/1) ... [2025-03-16 20:25:17,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:25:17,633 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:25:17,633 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:25:17,633 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:25:17,634 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (1/1) ... [2025-03-16 20:25:17,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:25:17,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:17,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:25:17,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:25:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:25:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:25:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:25:17,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:25:17,765 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:25:17,767 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:25:21,209 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5024: havoc calculate_output3_#t~ret35#1; [2025-03-16 20:25:21,209 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: havoc calculate_output_#t~ret33#1; [2025-03-16 20:25:21,210 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3534: havoc calculate_output2_#t~ret34#1; [2025-03-16 20:25:21,327 INFO L? ?]: Removed 735 outVars from TransFormulas that were not future-live. [2025-03-16 20:25:21,327 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:25:21,353 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:25:21,353 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:25:21,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:25:21 BoogieIcfgContainer [2025-03-16 20:25:21,356 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:25:21,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:25:21,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:25:21,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:25:21,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:25:15" (1/3) ... [2025-03-16 20:25:21,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4ee6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:25:21, skipping insertion in model container [2025-03-16 20:25:21,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:16" (2/3) ... [2025-03-16 20:25:21,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4ee6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:25:21, skipping insertion in model container [2025-03-16 20:25:21,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:25:21" (3/3) ... [2025-03-16 20:25:21,363 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:25:21,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:25:21,374 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c that has 1 procedures, 820 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:25:21,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:25:21,441 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;@5c182e64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:25:21,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:25:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 820 states, 817 states have (on average 1.9755201958384332) internal successors, (1614), 819 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:25:21,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:21,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:21,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:21,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:21,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1252836054, now seen corresponding path program 1 times [2025-03-16 20:25:21,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:21,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816639554] [2025-03-16 20:25:21,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:21,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:21,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:25:21,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:25:21,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:21,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:21,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:21,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816639554] [2025-03-16 20:25:21,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816639554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:21,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:21,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:25:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737777976] [2025-03-16 20:25:21,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:21,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:25:21,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:21,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:25:21,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:25:21,639 INFO L87 Difference]: Start difference. First operand has 820 states, 817 states have (on average 1.9755201958384332) internal successors, (1614), 819 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:21,699 INFO L93 Difference]: Finished difference Result 1613 states and 3176 transitions. [2025-03-16 20:25:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:25:21,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:25:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:21,714 INFO L225 Difference]: With dead ends: 1613 [2025-03-16 20:25:21,714 INFO L226 Difference]: Without dead ends: 816 [2025-03-16 20:25:21,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:25:21,719 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:21,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-16 20:25:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2025-03-16 20:25:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.898034398034398) internal successors, (1545), 815 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1545 transitions. [2025-03-16 20:25:21,786 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1545 transitions. Word has length 19 [2025-03-16 20:25:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:21,787 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1545 transitions. [2025-03-16 20:25:21,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1545 transitions. [2025-03-16 20:25:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:25:21,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:21,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:21,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:25:21,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:21,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:21,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1534579433, now seen corresponding path program 1 times [2025-03-16 20:25:21,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:21,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938465779] [2025-03-16 20:25:21,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:21,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:21,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:25:21,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:25:21,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:21,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:21,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:21,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938465779] [2025-03-16 20:25:21,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938465779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:21,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:21,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:25:21,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061440595] [2025-03-16 20:25:21,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:21,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:25:21,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:21,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:25:21,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:21,991 INFO L87 Difference]: Start difference. First operand 816 states and 1545 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:22,067 INFO L93 Difference]: Finished difference Result 854 states and 1604 transitions. [2025-03-16 20:25:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:25:22,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:25:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:22,071 INFO L225 Difference]: With dead ends: 854 [2025-03-16 20:25:22,071 INFO L226 Difference]: Without dead ends: 816 [2025-03-16 20:25:22,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:22,072 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 0 mSDsluCounter, 3061 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4605 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:22,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4605 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-16 20:25:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2025-03-16 20:25:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.8697788697788698) internal successors, (1522), 815 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1522 transitions. [2025-03-16 20:25:22,089 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1522 transitions. Word has length 19 [2025-03-16 20:25:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:22,089 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1522 transitions. [2025-03-16 20:25:22,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1522 transitions. [2025-03-16 20:25:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 20:25:22,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:22,091 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] [2025-03-16 20:25:22,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:25:22,091 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:22,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:22,092 INFO L85 PathProgramCache]: Analyzing trace with hash -215177375, now seen corresponding path program 1 times [2025-03-16 20:25:22,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:22,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215141810] [2025-03-16 20:25:22,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:22,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:22,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 20:25:22,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 20:25:22,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:22,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:22,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:22,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215141810] [2025-03-16 20:25:22,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215141810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:22,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:22,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:22,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022555065] [2025-03-16 20:25:22,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:22,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:22,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:22,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:22,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:22,238 INFO L87 Difference]: Start difference. First operand 816 states and 1522 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:22,386 INFO L93 Difference]: Finished difference Result 1096 states and 1970 transitions. [2025-03-16 20:25:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:25:22,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-16 20:25:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:22,391 INFO L225 Difference]: With dead ends: 1096 [2025-03-16 20:25:22,391 INFO L226 Difference]: Without dead ends: 1061 [2025-03-16 20:25:22,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:25:22,392 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 6246 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6246 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:22,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6246 Valid, 2171 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:25:22,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-16 20:25:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 849. [2025-03-16 20:25:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 847 states have (on average 1.859504132231405) internal successors, (1575), 848 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1575 transitions. [2025-03-16 20:25:22,423 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1575 transitions. Word has length 41 [2025-03-16 20:25:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:22,423 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1575 transitions. [2025-03-16 20:25:22,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1575 transitions. [2025-03-16 20:25:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:25:22,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:22,428 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] [2025-03-16 20:25:22,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:25:22,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:22,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash -589844957, now seen corresponding path program 1 times [2025-03-16 20:25:22,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:22,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428419055] [2025-03-16 20:25:22,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:22,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:25:22,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:25:22,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:22,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:22,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:22,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428419055] [2025-03-16 20:25:22,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428419055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:22,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:22,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:22,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926497038] [2025-03-16 20:25:22,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:22,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:22,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:22,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:22,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:22,685 INFO L87 Difference]: Start difference. First operand 849 states and 1575 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:22,785 INFO L93 Difference]: Finished difference Result 919 states and 1685 transitions. [2025-03-16 20:25:22,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:22,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:25:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:22,789 INFO L225 Difference]: With dead ends: 919 [2025-03-16 20:25:22,790 INFO L226 Difference]: Without dead ends: 851 [2025-03-16 20:25:22,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:25:22,791 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 1488 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:22,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1726 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-16 20:25:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 849. [2025-03-16 20:25:22,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 847 states have (on average 1.858323494687131) internal successors, (1574), 848 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1574 transitions. [2025-03-16 20:25:22,810 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1574 transitions. Word has length 43 [2025-03-16 20:25:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:22,810 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1574 transitions. [2025-03-16 20:25:22,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1574 transitions. [2025-03-16 20:25:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:25:22,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:22,812 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] [2025-03-16 20:25:22,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:25:22,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:22,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:22,813 INFO L85 PathProgramCache]: Analyzing trace with hash -590887642, now seen corresponding path program 1 times [2025-03-16 20:25:22,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:22,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869837966] [2025-03-16 20:25:22,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:22,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:25:22,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:25:22,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:22,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:22,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:22,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869837966] [2025-03-16 20:25:22,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869837966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:22,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:22,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:22,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770502833] [2025-03-16 20:25:22,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:22,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:22,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:22,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:22,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:22,901 INFO L87 Difference]: Start difference. First operand 849 states and 1574 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:22,936 INFO L93 Difference]: Finished difference Result 974 states and 1771 transitions. [2025-03-16 20:25:22,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:22,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:25:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:22,940 INFO L225 Difference]: With dead ends: 974 [2025-03-16 20:25:22,940 INFO L226 Difference]: Without dead ends: 906 [2025-03-16 20:25:22,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:22,942 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1472 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:22,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1572 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-03-16 20:25:22,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 904. [2025-03-16 20:25:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 902 states have (on average 1.8392461197339247) internal successors, (1659), 903 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1659 transitions. [2025-03-16 20:25:22,969 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1659 transitions. Word has length 43 [2025-03-16 20:25:22,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:22,969 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1659 transitions. [2025-03-16 20:25:22,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:22,969 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1659 transitions. [2025-03-16 20:25:22,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 20:25:22,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:22,970 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] [2025-03-16 20:25:22,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:25:22,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:22,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1104339423, now seen corresponding path program 1 times [2025-03-16 20:25:22,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:22,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858233573] [2025-03-16 20:25:22,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:22,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:22,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 20:25:22,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 20:25:22,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:22,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:23,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:23,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858233573] [2025-03-16 20:25:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858233573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:23,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:23,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:25:23,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645647173] [2025-03-16 20:25:23,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:23,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:25:23,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:23,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:25:23,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:23,169 INFO L87 Difference]: Start difference. First operand 904 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:23,199 INFO L93 Difference]: Finished difference Result 910 states and 1666 transitions. [2025-03-16 20:25:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:25:23,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-16 20:25:23,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:23,203 INFO L225 Difference]: With dead ends: 910 [2025-03-16 20:25:23,203 INFO L226 Difference]: Without dead ends: 908 [2025-03-16 20:25:23,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:23,203 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 0 mSDsluCounter, 3032 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4552 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:23,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4552 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-03-16 20:25:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2025-03-16 20:25:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 906 states have (on average 1.8344370860927153) internal successors, (1662), 907 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1662 transitions. [2025-03-16 20:25:23,219 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1662 transitions. Word has length 44 [2025-03-16 20:25:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:23,220 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1662 transitions. [2025-03-16 20:25:23,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1662 transitions. [2025-03-16 20:25:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:23,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:23,220 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] [2025-03-16 20:25:23,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:25:23,221 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:23,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:23,221 INFO L85 PathProgramCache]: Analyzing trace with hash 937978053, now seen corresponding path program 1 times [2025-03-16 20:25:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:23,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100648758] [2025-03-16 20:25:23,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:23,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:23,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:23,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:23,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:23,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:23,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100648758] [2025-03-16 20:25:23,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100648758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:23,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:23,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:23,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833523078] [2025-03-16 20:25:23,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:23,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:23,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:23,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:23,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:23,306 INFO L87 Difference]: Start difference. First operand 908 states and 1662 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:23,327 INFO L93 Difference]: Finished difference Result 1046 states and 1875 transitions. [2025-03-16 20:25:23,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:23,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:25:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:23,331 INFO L225 Difference]: With dead ends: 1046 [2025-03-16 20:25:23,331 INFO L226 Difference]: Without dead ends: 974 [2025-03-16 20:25:23,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:23,331 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1484 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:23,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1620 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-16 20:25:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2025-03-16 20:25:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 970 states have (on average 1.81340206185567) internal successors, (1759), 971 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1759 transitions. [2025-03-16 20:25:23,349 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1759 transitions. Word has length 45 [2025-03-16 20:25:23,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:23,349 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1759 transitions. [2025-03-16 20:25:23,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1759 transitions. [2025-03-16 20:25:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:23,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:23,351 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] [2025-03-16 20:25:23,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:25:23,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:23,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1695018693, now seen corresponding path program 1 times [2025-03-16 20:25:23,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:23,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891598302] [2025-03-16 20:25:23,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:23,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:23,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:23,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:23,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:23,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:23,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891598302] [2025-03-16 20:25:23,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891598302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:23,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:23,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:23,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579827676] [2025-03-16 20:25:23,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:23,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:23,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:23,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:23,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:23,411 INFO L87 Difference]: Start difference. First operand 972 states and 1759 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:23,441 INFO L93 Difference]: Finished difference Result 1326 states and 2299 transitions. [2025-03-16 20:25:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:23,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:25:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:23,446 INFO L225 Difference]: With dead ends: 1326 [2025-03-16 20:25:23,446 INFO L226 Difference]: Without dead ends: 1137 [2025-03-16 20:25:23,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:23,447 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 1480 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:23,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1620 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:23,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-03-16 20:25:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1135. [2025-03-16 20:25:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1133 states have (on average 1.766107678729038) internal successors, (2001), 1134 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2001 transitions. [2025-03-16 20:25:23,469 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 2001 transitions. Word has length 45 [2025-03-16 20:25:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:23,470 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 2001 transitions. [2025-03-16 20:25:23,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2001 transitions. [2025-03-16 20:25:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:23,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:23,472 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] [2025-03-16 20:25:23,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:25:23,472 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:23,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:23,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1145229765, now seen corresponding path program 1 times [2025-03-16 20:25:23,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:23,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241702552] [2025-03-16 20:25:23,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:23,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:23,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:23,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:23,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:23,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241702552] [2025-03-16 20:25:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241702552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:23,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:23,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230106095] [2025-03-16 20:25:23,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:23,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:23,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:23,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:23,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:23,523 INFO L87 Difference]: Start difference. First operand 1135 states and 2001 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:23,550 INFO L93 Difference]: Finished difference Result 1791 states and 2983 transitions. [2025-03-16 20:25:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:23,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:25:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:23,556 INFO L225 Difference]: With dead ends: 1791 [2025-03-16 20:25:23,557 INFO L226 Difference]: Without dead ends: 1439 [2025-03-16 20:25:23,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:23,558 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 1478 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:23,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1622 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-03-16 20:25:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1437. [2025-03-16 20:25:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1435 states have (on average 1.6982578397212544) internal successors, (2437), 1436 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2437 transitions. [2025-03-16 20:25:23,586 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2437 transitions. Word has length 45 [2025-03-16 20:25:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:23,587 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2437 transitions. [2025-03-16 20:25:23,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2437 transitions. [2025-03-16 20:25:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:23,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:23,587 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] [2025-03-16 20:25:23,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:25:23,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:23,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:23,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1761201093, now seen corresponding path program 1 times [2025-03-16 20:25:23,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:23,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525092324] [2025-03-16 20:25:23,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:23,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:23,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:23,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:23,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:23,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:23,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:23,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525092324] [2025-03-16 20:25:23,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525092324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:23,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:23,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:23,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999738684] [2025-03-16 20:25:23,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:23,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:23,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:23,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:23,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:23,631 INFO L87 Difference]: Start difference. First operand 1437 states and 2437 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:23,662 INFO L93 Difference]: Finished difference Result 2649 states and 4207 transitions. [2025-03-16 20:25:23,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:23,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:25:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:23,668 INFO L225 Difference]: With dead ends: 2649 [2025-03-16 20:25:23,669 INFO L226 Difference]: Without dead ends: 1995 [2025-03-16 20:25:23,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:23,670 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1482 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:23,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1626 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:23,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-03-16 20:25:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2025-03-16 20:25:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1991 states have (on average 1.6137619286790557) internal successors, (3213), 1992 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 3213 transitions. [2025-03-16 20:25:23,707 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 3213 transitions. Word has length 45 [2025-03-16 20:25:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:23,707 INFO L471 AbstractCegarLoop]: Abstraction has 1993 states and 3213 transitions. [2025-03-16 20:25:23,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 3213 transitions. [2025-03-16 20:25:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:25:23,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:23,708 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] [2025-03-16 20:25:23,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:25:23,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:23,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash 421345978, now seen corresponding path program 1 times [2025-03-16 20:25:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:23,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026486018] [2025-03-16 20:25:23,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:23,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:25:23,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:25:23,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:23,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:23,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:23,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026486018] [2025-03-16 20:25:23,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026486018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:23,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:23,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:23,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390378103] [2025-03-16 20:25:23,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:23,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:25:23,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:23,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:25:23,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:23,786 INFO L87 Difference]: Start difference. First operand 1993 states and 3213 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:28,412 INFO L93 Difference]: Finished difference Result 4248 states and 7522 transitions. [2025-03-16 20:25:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:25:28,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-16 20:25:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:28,423 INFO L225 Difference]: With dead ends: 4248 [2025-03-16 20:25:28,423 INFO L226 Difference]: Without dead ends: 3495 [2025-03-16 20:25:28,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:25:28,425 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 2384 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:28,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 776 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 20:25:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2025-03-16 20:25:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3495. [2025-03-16 20:25:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3495 states, 3493 states have (on average 1.5250501002004009) internal successors, (5327), 3494 states have internal predecessors, (5327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 5327 transitions. [2025-03-16 20:25:28,485 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 5327 transitions. Word has length 47 [2025-03-16 20:25:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:28,485 INFO L471 AbstractCegarLoop]: Abstraction has 3495 states and 5327 transitions. [2025-03-16 20:25:28,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 5327 transitions. [2025-03-16 20:25:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:28,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:28,486 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:25:28,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:25:28,487 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:28,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:28,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1434916046, now seen corresponding path program 1 times [2025-03-16 20:25:28,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:28,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801005772] [2025-03-16 20:25:28,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:28,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:28,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:28,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:28,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:28,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:25:28,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:28,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801005772] [2025-03-16 20:25:28,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801005772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:28,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:28,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:28,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977481864] [2025-03-16 20:25:28,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:28,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:28,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:28,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:28,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:28,582 INFO L87 Difference]: Start difference. First operand 3495 states and 5327 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:28,743 INFO L93 Difference]: Finished difference Result 8257 states and 12188 transitions. [2025-03-16 20:25:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:28,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 61 [2025-03-16 20:25:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:28,764 INFO L225 Difference]: With dead ends: 8257 [2025-03-16 20:25:28,764 INFO L226 Difference]: Without dead ends: 7391 [2025-03-16 20:25:28,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:28,767 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 4635 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4635 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:28,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4635 Valid, 3309 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2025-03-16 20:25:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 4535. [2025-03-16 20:25:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 4533 states have (on average 1.5016545334215752) internal successors, (6807), 4534 states have internal predecessors, (6807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6807 transitions. [2025-03-16 20:25:28,901 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6807 transitions. Word has length 61 [2025-03-16 20:25:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:28,901 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6807 transitions. [2025-03-16 20:25:28,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6807 transitions. [2025-03-16 20:25:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:28,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:28,903 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:25:28,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:25:28,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:28,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:28,903 INFO L85 PathProgramCache]: Analyzing trace with hash -677875406, now seen corresponding path program 1 times [2025-03-16 20:25:28,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:28,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432303441] [2025-03-16 20:25:28,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:28,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:28,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:28,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:28,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:28,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:25:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432303441] [2025-03-16 20:25:29,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432303441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:29,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:29,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:29,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388860694] [2025-03-16 20:25:29,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:29,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:29,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:29,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:29,024 INFO L87 Difference]: Start difference. First operand 4535 states and 6807 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:29,196 INFO L93 Difference]: Finished difference Result 9465 states and 13916 transitions. [2025-03-16 20:25:29,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:29,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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 61 [2025-03-16 20:25:29,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:29,219 INFO L225 Difference]: With dead ends: 9465 [2025-03-16 20:25:29,219 INFO L226 Difference]: Without dead ends: 8255 [2025-03-16 20:25:29,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:29,223 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 4670 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4670 SdHoareTripleChecker+Valid, 3326 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:29,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4670 Valid, 3326 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:25:29,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8255 states. [2025-03-16 20:25:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8255 to 6175. [2025-03-16 20:25:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6175 states, 6173 states have (on average 1.4798315243803661) internal successors, (9135), 6174 states have internal predecessors, (9135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6175 states to 6175 states and 9135 transitions. [2025-03-16 20:25:29,363 INFO L78 Accepts]: Start accepts. Automaton has 6175 states and 9135 transitions. Word has length 61 [2025-03-16 20:25:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:29,363 INFO L471 AbstractCegarLoop]: Abstraction has 6175 states and 9135 transitions. [2025-03-16 20:25:29,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 6175 states and 9135 transitions. [2025-03-16 20:25:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:29,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:29,365 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:25:29,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:25:29,365 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:29,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:29,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1227664334, now seen corresponding path program 1 times [2025-03-16 20:25:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:29,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927570288] [2025-03-16 20:25:29,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:29,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:29,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:29,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:29,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:29,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:25:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:29,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927570288] [2025-03-16 20:25:29,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927570288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:29,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:29,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:29,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305052474] [2025-03-16 20:25:29,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:29,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:29,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:29,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:29,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:29,459 INFO L87 Difference]: Start difference. First operand 6175 states and 9135 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:29,612 INFO L93 Difference]: Finished difference Result 10673 states and 15636 transitions. [2025-03-16 20:25:29,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:29,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 61 [2025-03-16 20:25:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:29,627 INFO L225 Difference]: With dead ends: 10673 [2025-03-16 20:25:29,628 INFO L226 Difference]: Without dead ends: 9463 [2025-03-16 20:25:29,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:29,633 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 4667 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3328 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:29,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3328 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9463 states. [2025-03-16 20:25:29,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9463 to 7383. [2025-03-16 20:25:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7383 states, 7381 states have (on average 1.4706679311746376) internal successors, (10855), 7382 states have internal predecessors, (10855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7383 states to 7383 states and 10855 transitions. [2025-03-16 20:25:29,820 INFO L78 Accepts]: Start accepts. Automaton has 7383 states and 10855 transitions. Word has length 61 [2025-03-16 20:25:29,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:29,820 INFO L471 AbstractCegarLoop]: Abstraction has 7383 states and 10855 transitions. [2025-03-16 20:25:29,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 7383 states and 10855 transitions. [2025-03-16 20:25:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:29,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:29,822 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:25:29,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:25:29,822 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:29,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash -611693006, now seen corresponding path program 1 times [2025-03-16 20:25:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025415704] [2025-03-16 20:25:29,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:29,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:29,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:29,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:29,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:25:29,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025415704] [2025-03-16 20:25:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025415704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:29,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:29,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:29,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238468634] [2025-03-16 20:25:29,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:29,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:29,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:29,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:29,912 INFO L87 Difference]: Start difference. First operand 7383 states and 10855 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:30,094 INFO L93 Difference]: Finished difference Result 11881 states and 17356 transitions. [2025-03-16 20:25:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:30,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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 61 [2025-03-16 20:25:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:30,111 INFO L225 Difference]: With dead ends: 11881 [2025-03-16 20:25:30,111 INFO L226 Difference]: Without dead ends: 10671 [2025-03-16 20:25:30,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:30,117 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 4637 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4637 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:30,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4637 Valid, 3362 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:25:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10671 states. [2025-03-16 20:25:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10671 to 8591. [2025-03-16 20:25:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8591 states, 8589 states have (on average 1.4640819653044592) internal successors, (12575), 8590 states have internal predecessors, (12575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 12575 transitions. [2025-03-16 20:25:30,271 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 12575 transitions. Word has length 61 [2025-03-16 20:25:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:30,272 INFO L471 AbstractCegarLoop]: Abstraction has 8591 states and 12575 transitions. [2025-03-16 20:25:30,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 12575 transitions. [2025-03-16 20:25:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:25:30,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:30,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:30,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:25:30,273 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:30,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:30,273 INFO L85 PathProgramCache]: Analyzing trace with hash 31261546, now seen corresponding path program 1 times [2025-03-16 20:25:30,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:30,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104101191] [2025-03-16 20:25:30,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:30,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:30,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:25:30,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:25:30,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:30,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:30,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:30,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104101191] [2025-03-16 20:25:30,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104101191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:30,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:30,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:30,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892376443] [2025-03-16 20:25:30,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:30,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:30,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:30,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:30,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:30,336 INFO L87 Difference]: Start difference. First operand 8591 states and 12575 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:30,421 INFO L93 Difference]: Finished difference Result 14899 states and 21569 transitions. [2025-03-16 20:25:30,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:30,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-16 20:25:30,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:30,435 INFO L225 Difference]: With dead ends: 14899 [2025-03-16 20:25:30,436 INFO L226 Difference]: Without dead ends: 8593 [2025-03-16 20:25:30,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:30,444 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 37 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:30,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3058 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8593 states. [2025-03-16 20:25:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8593 to 8591. [2025-03-16 20:25:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8591 states, 8589 states have (on average 1.4496448946326697) internal successors, (12451), 8590 states have internal predecessors, (12451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 12451 transitions. [2025-03-16 20:25:30,638 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 12451 transitions. Word has length 62 [2025-03-16 20:25:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:30,638 INFO L471 AbstractCegarLoop]: Abstraction has 8591 states and 12451 transitions. [2025-03-16 20:25:30,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 12451 transitions. [2025-03-16 20:25:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:25:30,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:30,639 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:25:30,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:25:30,640 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:30,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:30,640 INFO L85 PathProgramCache]: Analyzing trace with hash 610722996, now seen corresponding path program 1 times [2025-03-16 20:25:30,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:30,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099405332] [2025-03-16 20:25:30,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:30,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:25:30,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:25:30,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:30,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:30,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:30,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099405332] [2025-03-16 20:25:30,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099405332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:30,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:30,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:30,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403846098] [2025-03-16 20:25:30,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:30,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:30,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:30,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:30,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:30,699 INFO L87 Difference]: Start difference. First operand 8591 states and 12451 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:30,746 INFO L93 Difference]: Finished difference Result 10987 states and 15858 transitions. [2025-03-16 20:25:30,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:30,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-16 20:25:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:30,754 INFO L225 Difference]: With dead ends: 10987 [2025-03-16 20:25:30,754 INFO L226 Difference]: Without dead ends: 4681 [2025-03-16 20:25:30,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:30,760 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 31 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:30,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3055 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4681 states. [2025-03-16 20:25:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4681 to 4674. [2025-03-16 20:25:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 4672 states have (on average 1.4850171232876712) internal successors, (6938), 4673 states have internal predecessors, (6938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 6938 transitions. [2025-03-16 20:25:30,819 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 6938 transitions. Word has length 63 [2025-03-16 20:25:30,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:30,820 INFO L471 AbstractCegarLoop]: Abstraction has 4674 states and 6938 transitions. [2025-03-16 20:25:30,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 6938 transitions. [2025-03-16 20:25:30,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:25:30,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:30,821 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:30,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:25:30,821 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:30,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:30,823 INFO L85 PathProgramCache]: Analyzing trace with hash 106290851, now seen corresponding path program 1 times [2025-03-16 20:25:30,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:30,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362935841] [2025-03-16 20:25:30,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:30,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:30,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:25:30,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:25:30,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:30,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:30,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:30,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362935841] [2025-03-16 20:25:30,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362935841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:30,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:30,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:30,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658662635] [2025-03-16 20:25:30,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:30,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:30,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:30,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:30,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:30,891 INFO L87 Difference]: Start difference. First operand 4674 states and 6938 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:30,919 INFO L93 Difference]: Finished difference Result 5866 states and 8612 transitions. [2025-03-16 20:25:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:30,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-16 20:25:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:30,925 INFO L225 Difference]: With dead ends: 5866 [2025-03-16 20:25:30,925 INFO L226 Difference]: Without dead ends: 3488 [2025-03-16 20:25:30,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:30,928 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 33 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:30,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3034 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:30,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2025-03-16 20:25:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3486. [2025-03-16 20:25:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3486 states, 3484 states have (on average 1.505166475315729) internal successors, (5244), 3485 states have internal predecessors, (5244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 5244 transitions. [2025-03-16 20:25:30,968 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 5244 transitions. Word has length 64 [2025-03-16 20:25:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:30,968 INFO L471 AbstractCegarLoop]: Abstraction has 3486 states and 5244 transitions. [2025-03-16 20:25:30,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 5244 transitions. [2025-03-16 20:25:30,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:25:30,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:30,969 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:25:30,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:25:30,969 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:30,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1930173660, now seen corresponding path program 1 times [2025-03-16 20:25:30,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:30,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235719238] [2025-03-16 20:25:30,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:30,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:25:30,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:25:30,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:30,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:31,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:31,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235719238] [2025-03-16 20:25:31,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235719238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:31,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:31,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717733456] [2025-03-16 20:25:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:31,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:31,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:31,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:31,028 INFO L87 Difference]: Start difference. First operand 3486 states and 5244 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:31,050 INFO L93 Difference]: Finished difference Result 4084 states and 6071 transitions. [2025-03-16 20:25:31,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:31,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-16 20:25:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:31,055 INFO L225 Difference]: With dead ends: 4084 [2025-03-16 20:25:31,055 INFO L226 Difference]: Without dead ends: 2894 [2025-03-16 20:25:31,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:31,057 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 30 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:31,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2025-03-16 20:25:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2892. [2025-03-16 20:25:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2892 states, 2890 states have (on average 1.5252595155709343) internal successors, (4408), 2891 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 4408 transitions. [2025-03-16 20:25:31,087 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 4408 transitions. Word has length 66 [2025-03-16 20:25:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:31,088 INFO L471 AbstractCegarLoop]: Abstraction has 2892 states and 4408 transitions. [2025-03-16 20:25:31,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 4408 transitions. [2025-03-16 20:25:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:25:31,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:31,089 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:25:31,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:25:31,090 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:31,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:31,090 INFO L85 PathProgramCache]: Analyzing trace with hash 103108117, now seen corresponding path program 1 times [2025-03-16 20:25:31,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:31,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806259457] [2025-03-16 20:25:31,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:31,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:25:31,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:25:31,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:31,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:32,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:32,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806259457] [2025-03-16 20:25:32,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806259457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:32,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581140176] [2025-03-16 20:25:32,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:32,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:32,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:32,206 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:25:32,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:25:32,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:25:32,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:25:32,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:32,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:32,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:25:32,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:32,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:32,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581140176] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:32,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:32,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:25:32,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570405514] [2025-03-16 20:25:32,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:32,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:25:32,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:32,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:25:32,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:25:32,801 INFO L87 Difference]: Start difference. First operand 2892 states and 4408 transitions. Second operand has 21 states, 21 states have (on average 9.238095238095237) internal successors, (194), 21 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) [2025-03-16 20:25:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:35,881 INFO L93 Difference]: Finished difference Result 8414 states and 11800 transitions. [2025-03-16 20:25:35,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-16 20:25:35,881 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.238095238095237) internal successors, (194), 21 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) Word has length 68 [2025-03-16 20:25:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:35,892 INFO L225 Difference]: With dead ends: 8414 [2025-03-16 20:25:35,892 INFO L226 Difference]: Without dead ends: 7744 [2025-03-16 20:25:35,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2794 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1348, Invalid=7024, Unknown=0, NotChecked=0, Total=8372 [2025-03-16 20:25:35,896 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 19802 mSDsluCounter, 7857 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19802 SdHoareTripleChecker+Valid, 9365 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:35,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19802 Valid, 9365 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 20:25:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7744 states. [2025-03-16 20:25:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7744 to 7220. [2025-03-16 20:25:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7220 states, 7218 states have (on average 1.3959545580493211) internal successors, (10076), 7219 states have internal predecessors, (10076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 10076 transitions. [2025-03-16 20:25:36,024 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 10076 transitions. Word has length 68 [2025-03-16 20:25:36,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:36,024 INFO L471 AbstractCegarLoop]: Abstraction has 7220 states and 10076 transitions. [2025-03-16 20:25:36,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.238095238095237) internal successors, (194), 21 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) [2025-03-16 20:25:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 10076 transitions. [2025-03-16 20:25:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 20:25:36,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:36,025 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:25:36,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:25:36,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:36,226 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:36,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash -263141404, now seen corresponding path program 1 times [2025-03-16 20:25:36,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:36,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496134165] [2025-03-16 20:25:36,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:36,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:36,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:25:36,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:25:36,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:36,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:36,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:36,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496134165] [2025-03-16 20:25:36,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496134165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:36,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825276875] [2025-03-16 20:25:36,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:36,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:36,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:36,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:25:36,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:25:36,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:25:36,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:25:36,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:36,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:36,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 20:25:36,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:37,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:38,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825276875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:38,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:38,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 31 [2025-03-16 20:25:38,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069510492] [2025-03-16 20:25:38,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:38,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 20:25:38,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:38,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 20:25:38,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2025-03-16 20:25:38,494 INFO L87 Difference]: Start difference. First operand 7220 states and 10076 transitions. Second operand has 31 states, 31 states have (on average 5.903225806451613) internal successors, (183), 31 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:39,593 INFO L93 Difference]: Finished difference Result 22173 states and 29831 transitions. [2025-03-16 20:25:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-16 20:25:39,593 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.903225806451613) internal successors, (183), 31 states have internal predecessors, (183), 0 states have call successors, (0), 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 69 [2025-03-16 20:25:39,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:39,620 INFO L225 Difference]: With dead ends: 22173 [2025-03-16 20:25:39,620 INFO L226 Difference]: Without dead ends: 17528 [2025-03-16 20:25:39,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=758, Invalid=2434, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 20:25:39,625 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 7253 mSDsluCounter, 7837 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7253 SdHoareTripleChecker+Valid, 9332 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:39,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7253 Valid, 9332 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:25:39,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17528 states. [2025-03-16 20:25:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17528 to 16894. [2025-03-16 20:25:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16894 states, 16892 states have (on average 1.329268292682927) internal successors, (22454), 16893 states have internal predecessors, (22454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16894 states to 16894 states and 22454 transitions. [2025-03-16 20:25:39,933 INFO L78 Accepts]: Start accepts. Automaton has 16894 states and 22454 transitions. Word has length 69 [2025-03-16 20:25:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:39,933 INFO L471 AbstractCegarLoop]: Abstraction has 16894 states and 22454 transitions. [2025-03-16 20:25:39,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.903225806451613) internal successors, (183), 31 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 16894 states and 22454 transitions. [2025-03-16 20:25:39,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 20:25:39,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:39,934 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:25:39,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 20:25:40,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-16 20:25:40,135 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:40,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:40,135 INFO L85 PathProgramCache]: Analyzing trace with hash -489439836, now seen corresponding path program 1 times [2025-03-16 20:25:40,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:40,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275786187] [2025-03-16 20:25:40,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:40,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:40,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:25:40,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:25:40,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:40,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:40,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:40,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275786187] [2025-03-16 20:25:40,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275786187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:40,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412379944] [2025-03-16 20:25:40,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:40,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:40,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:40,999 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:25:41,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 20:25:41,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:25:41,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:25:41,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:41,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:41,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 20:25:41,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:41,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:42,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412379944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:42,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:42,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 34 [2025-03-16 20:25:42,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971659855] [2025-03-16 20:25:42,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:42,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-16 20:25:42,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:42,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-16 20:25:42,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 20:25:42,188 INFO L87 Difference]: Start difference. First operand 16894 states and 22454 transitions. Second operand has 34 states, 34 states have (on average 5.411764705882353) internal successors, (184), 34 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:44,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:44,596 INFO L93 Difference]: Finished difference Result 48510 states and 63364 transitions. [2025-03-16 20:25:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-16 20:25:44,599 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.411764705882353) internal successors, (184), 34 states have internal predecessors, (184), 0 states have call successors, (0), 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 69 [2025-03-16 20:25:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:44,654 INFO L225 Difference]: With dead ends: 48510 [2025-03-16 20:25:44,654 INFO L226 Difference]: Without dead ends: 35392 [2025-03-16 20:25:44,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=959, Invalid=4297, Unknown=0, NotChecked=0, Total=5256 [2025-03-16 20:25:44,667 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 17396 mSDsluCounter, 6798 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17396 SdHoareTripleChecker+Valid, 8308 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:44,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17396 Valid, 8308 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:25:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35392 states. [2025-03-16 20:25:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35392 to 32188. [2025-03-16 20:25:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32188 states, 32186 states have (on average 1.2948486919778786) internal successors, (41676), 32187 states have internal predecessors, (41676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32188 states to 32188 states and 41676 transitions. [2025-03-16 20:25:45,595 INFO L78 Accepts]: Start accepts. Automaton has 32188 states and 41676 transitions. Word has length 69 [2025-03-16 20:25:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:45,597 INFO L471 AbstractCegarLoop]: Abstraction has 32188 states and 41676 transitions. [2025-03-16 20:25:45,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.411764705882353) internal successors, (184), 34 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 32188 states and 41676 transitions. [2025-03-16 20:25:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:25:45,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:45,600 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:45,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 20:25:45,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:45,801 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:45,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:45,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1906622144, now seen corresponding path program 1 times [2025-03-16 20:25:45,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:45,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436051510] [2025-03-16 20:25:45,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:45,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:45,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:25:45,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:25:45,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:45,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:46,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:46,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436051510] [2025-03-16 20:25:46,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436051510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:46,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107247779] [2025-03-16 20:25:46,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:46,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:46,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:46,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:25:46,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:25:46,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:25:46,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:25:46,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:46,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:46,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:25:46,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:46,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:47,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107247779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:47,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:47,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-03-16 20:25:47,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430513113] [2025-03-16 20:25:47,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:47,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 20:25:47,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:47,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 20:25:47,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:25:47,335 INFO L87 Difference]: Start difference. First operand 32188 states and 41676 transitions. Second operand has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:48,273 INFO L93 Difference]: Finished difference Result 63110 states and 81340 transitions. [2025-03-16 20:25:48,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 20:25:48,273 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 0 states have call successors, (0), 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 70 [2025-03-16 20:25:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:48,308 INFO L225 Difference]: With dead ends: 63110 [2025-03-16 20:25:48,308 INFO L226 Difference]: Without dead ends: 33500 [2025-03-16 20:25:48,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 20:25:48,327 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 15007 mSDsluCounter, 6283 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15007 SdHoareTripleChecker+Valid, 7780 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:48,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15007 Valid, 7780 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:25:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33500 states. [2025-03-16 20:25:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33500 to 28588. [2025-03-16 20:25:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28588 states, 28586 states have (on average 1.2889176519974812) internal successors, (36845), 28587 states have internal predecessors, (36845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28588 states to 28588 states and 36845 transitions. [2025-03-16 20:25:49,060 INFO L78 Accepts]: Start accepts. Automaton has 28588 states and 36845 transitions. Word has length 70 [2025-03-16 20:25:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:49,060 INFO L471 AbstractCegarLoop]: Abstraction has 28588 states and 36845 transitions. [2025-03-16 20:25:49,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 28588 states and 36845 transitions. [2025-03-16 20:25:49,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:25:49,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:49,062 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:49,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 20:25:49,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:49,266 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:49,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:49,266 INFO L85 PathProgramCache]: Analyzing trace with hash -442116934, now seen corresponding path program 1 times [2025-03-16 20:25:49,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:49,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609336909] [2025-03-16 20:25:49,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:49,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:49,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:25:49,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:25:49,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:49,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:49,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:49,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609336909] [2025-03-16 20:25:49,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609336909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:49,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3960142] [2025-03-16 20:25:49,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:49,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:49,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:49,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:25:49,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:25:49,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:25:49,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:25:49,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:49,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:49,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 20:25:49,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:49,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:50,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3960142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:50,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:50,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 29 [2025-03-16 20:25:50,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273812612] [2025-03-16 20:25:50,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:50,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 20:25:50,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:50,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 20:25:50,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:25:50,836 INFO L87 Difference]: Start difference. First operand 28588 states and 36845 transitions. Second operand has 29 states, 29 states have (on average 6.241379310344827) internal successors, (181), 29 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:52,737 INFO L93 Difference]: Finished difference Result 80056 states and 101928 transitions. [2025-03-16 20:25:52,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 20:25:52,737 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.241379310344827) internal successors, (181), 29 states have internal predecessors, (181), 0 states have call successors, (0), 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 70 [2025-03-16 20:25:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:52,788 INFO L225 Difference]: With dead ends: 80056 [2025-03-16 20:25:52,788 INFO L226 Difference]: Without dead ends: 54656 [2025-03-16 20:25:52,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=343, Invalid=1297, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 20:25:52,805 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 4894 mSDsluCounter, 7832 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4894 SdHoareTripleChecker+Valid, 9332 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:52,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4894 Valid, 9332 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:25:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54656 states. [2025-03-16 20:25:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54656 to 54652. [2025-03-16 20:25:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54652 states, 54650 states have (on average 1.2698993595608417) internal successors, (69400), 54651 states have internal predecessors, (69400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54652 states to 54652 states and 69400 transitions. [2025-03-16 20:25:54,190 INFO L78 Accepts]: Start accepts. Automaton has 54652 states and 69400 transitions. Word has length 70 [2025-03-16 20:25:54,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:54,190 INFO L471 AbstractCegarLoop]: Abstraction has 54652 states and 69400 transitions. [2025-03-16 20:25:54,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.241379310344827) internal successors, (181), 29 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 54652 states and 69400 transitions. [2025-03-16 20:25:54,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:25:54,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:54,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:54,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 20:25:54,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 20:25:54,393 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:54,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:54,393 INFO L85 PathProgramCache]: Analyzing trace with hash 820241630, now seen corresponding path program 1 times [2025-03-16 20:25:54,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:54,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984061955] [2025-03-16 20:25:54,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:54,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:54,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:25:54,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:25:54,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:54,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:54,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984061955] [2025-03-16 20:25:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984061955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347278632] [2025-03-16 20:25:54,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:54,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:54,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:54,932 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:25:54,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:25:54,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:25:55,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:25:55,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:55,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:55,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-16 20:25:55,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:58,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:26:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:26:00,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347278632] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:26:00,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:26:00,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 24, 23] total 53 [2025-03-16 20:26:00,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819496306] [2025-03-16 20:26:00,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:26:00,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-16 20:26:00,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:26:00,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-16 20:26:00,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=2396, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 20:26:00,850 INFO L87 Difference]: Start difference. First operand 54652 states and 69400 transitions. Second operand has 53 states, 53 states have (on average 3.7358490566037736) internal successors, (198), 53 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:26:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:26:39,244 INFO L93 Difference]: Finished difference Result 137377 states and 173938 transitions. [2025-03-16 20:26:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2025-03-16 20:26:39,244 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.7358490566037736) internal successors, (198), 53 states have internal predecessors, (198), 0 states have call successors, (0), 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 71 [2025-03-16 20:26:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:26:39,370 INFO L225 Difference]: With dead ends: 137377 [2025-03-16 20:26:39,370 INFO L226 Difference]: Without dead ends: 115051 [2025-03-16 20:26:39,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17066 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=8195, Invalid=35277, Unknown=0, NotChecked=0, Total=43472 [2025-03-16 20:26:39,398 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 21721 mSDsluCounter, 18736 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21721 SdHoareTripleChecker+Valid, 20250 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:26:39,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21721 Valid, 20250 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 20:26:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115051 states.