./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label05.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 132c4c7f806b54f430f28cb3d47097ee784675c7b1df08a5c424914fbf614b6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:40:04,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:40:04,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:40:04,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:40:04,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:40:04,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:40:04,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:40:04,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:40:04,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:40:04,743 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:40:04,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:40:04,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:40:04,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:40:04,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:40:04,744 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:40:04,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:40:04,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:40:04,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:40:04,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:40:04,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:40:04,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:40:04,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:40:04,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:40:04,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:40:04,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:40:04,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:40:04,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:40:04,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:40:04,745 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:40:04,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:40:04,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:40:04,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:40:04,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:40:04,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:40:04,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:40:04,746 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:40:04,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:40:04,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:40:04,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:40:04,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:40:04,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:40:04,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:40:04,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:40:04,747 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 132c4c7f806b54f430f28cb3d47097ee784675c7b1df08a5c424914fbf614b6c [2025-02-05 17:40:04,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:40:04,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:40:04,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:40:04,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:40:04,996 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:40:04,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label05.c [2025-02-05 17:40:06,167 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3a0e9960/4036babbb68d4c9ba9bacf8770db129a/FLAG12b0ef6ed [2025-02-05 17:40:06,576 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:40:06,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label05.c [2025-02-05 17:40:06,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3a0e9960/4036babbb68d4c9ba9bacf8770db129a/FLAG12b0ef6ed [2025-02-05 17:40:06,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3a0e9960/4036babbb68d4c9ba9bacf8770db129a [2025-02-05 17:40:06,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:40:06,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:40:06,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:40:06,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:40:06,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:40:06,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:40:06" (1/1) ... [2025-02-05 17:40:06,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c96a1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:06, skipping insertion in model container [2025-02-05 17:40:06,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:40:06" (1/1) ... [2025-02-05 17:40:06,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:40:07,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label05.c[11677,11690] [2025-02-05 17:40:07,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label05.c[18613,18626] [2025-02-05 17:40:07,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:40:07,628 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:40:07,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label05.c[11677,11690] [2025-02-05 17:40:07,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label05.c[18613,18626] [2025-02-05 17:40:07,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:40:07,930 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:40:07,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07 WrapperNode [2025-02-05 17:40:07,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:40:07,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:40:07,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:40:07,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:40:07,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (1/1) ... [2025-02-05 17:40:07,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (1/1) ... [2025-02-05 17:40:08,244 INFO L138 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5094 [2025-02-05 17:40:08,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:40:08,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:40:08,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:40:08,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:40:08,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (1/1) ... [2025-02-05 17:40:08,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (1/1) ... [2025-02-05 17:40:08,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (1/1) ... [2025-02-05 17:40:08,406 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:40:08,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (1/1) ... [2025-02-05 17:40:08,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (1/1) ... [2025-02-05 17:40:08,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (1/1) ... [2025-02-05 17:40:08,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (1/1) ... [2025-02-05 17:40:08,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (1/1) ... [2025-02-05 17:40:08,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (1/1) ... [2025-02-05 17:40:08,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:40:08,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:40:08,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:40:08,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:40:08,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (1/1) ... [2025-02-05 17:40:08,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:40:08,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:08,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:40:08,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:40:08,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:40:08,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:40:08,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:40:08,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:40:08,758 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:40:08,759 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:40:12,000 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret38#1; [2025-02-05 17:40:12,001 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret39#1; [2025-02-05 17:40:12,001 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret40#1; [2025-02-05 17:40:12,135 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-02-05 17:40:12,135 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:40:12,158 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:40:12,158 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:40:12,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:40:12 BoogieIcfgContainer [2025-02-05 17:40:12,159 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:40:12,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:40:12,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:40:12,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:40:12,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:40:06" (1/3) ... [2025-02-05 17:40:12,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5466e0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:40:12, skipping insertion in model container [2025-02-05 17:40:12,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:07" (2/3) ... [2025-02-05 17:40:12,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5466e0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:40:12, skipping insertion in model container [2025-02-05 17:40:12,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:40:12" (3/3) ... [2025-02-05 17:40:12,166 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label05.c [2025-02-05 17:40:12,181 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:40:12,184 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals+Problem12_label05.c that has 1 procedures, 898 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:40:12,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:40:12,260 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;@6ec16a1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:40:12,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:40:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:40:12,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:12,274 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] [2025-02-05 17:40:12,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:12,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:12,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1170366575, now seen corresponding path program 1 times [2025-02-05 17:40:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:12,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354870414] [2025-02-05 17:40:12,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:12,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:12,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:40:12,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:40:12,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:12,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:12,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:12,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354870414] [2025-02-05 17:40:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354870414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:12,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:12,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:40:12,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369980555] [2025-02-05 17:40:12,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:12,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:40:12,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:12,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:40:12,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:40:12,504 INFO L87 Difference]: Start difference. First operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:12,576 INFO L93 Difference]: Finished difference Result 1759 states and 3338 transitions. [2025-02-05 17:40:12,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:40:12,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-05 17:40:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:12,590 INFO L225 Difference]: With dead ends: 1759 [2025-02-05 17:40:12,591 INFO L226 Difference]: Without dead ends: 833 [2025-02-05 17:40:12,594 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-02-05 17:40:12,596 INFO L435 NwaCegarLoop]: 1640 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, 1640 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-02-05 17:40:12,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-02-05 17:40:12,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-02-05 17:40:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8941034897713598) internal successors, (1574), 832 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-02-05 17:40:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1574 transitions. [2025-02-05 17:40:12,660 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1574 transitions. Word has length 24 [2025-02-05 17:40:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:12,660 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1574 transitions. [2025-02-05 17:40:12,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1574 transitions. [2025-02-05 17:40:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:40:12,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:12,661 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] [2025-02-05 17:40:12,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:40:12,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:12,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2127528368, now seen corresponding path program 1 times [2025-02-05 17:40:12,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:12,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91305229] [2025-02-05 17:40:12,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:12,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:12,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:40:12,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:40:12,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:12,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:12,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:12,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91305229] [2025-02-05 17:40:12,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91305229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:12,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:12,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:40:12,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451791629] [2025-02-05 17:40:12,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:12,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:40:12,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:12,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:40:12,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:40:12,848 INFO L87 Difference]: Start difference. First operand 833 states and 1574 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:12,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:12,974 INFO L93 Difference]: Finished difference Result 879 states and 1645 transitions. [2025-02-05 17:40:12,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:40:12,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-05 17:40:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:12,977 INFO L225 Difference]: With dead ends: 879 [2025-02-05 17:40:12,977 INFO L226 Difference]: Without dead ends: 833 [2025-02-05 17:40:12,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:40:12,978 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 0 mSDsluCounter, 4680 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6252 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:12,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6252 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-02-05 17:40:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-02-05 17:40:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8567990373044525) internal successors, (1543), 832 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1543 transitions. [2025-02-05 17:40:13,003 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1543 transitions. Word has length 24 [2025-02-05 17:40:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:13,004 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1543 transitions. [2025-02-05 17:40:13,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1543 transitions. [2025-02-05 17:40:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:40:13,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:13,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:13,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:40:13,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:13,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:13,006 INFO L85 PathProgramCache]: Analyzing trace with hash -130168238, now seen corresponding path program 1 times [2025-02-05 17:40:13,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:13,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396671216] [2025-02-05 17:40:13,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:13,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:13,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:40:13,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:40:13,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:13,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:13,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:13,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396671216] [2025-02-05 17:40:13,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396671216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:13,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:13,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:13,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006170811] [2025-02-05 17:40:13,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:13,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:13,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:13,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:13,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:13,189 INFO L87 Difference]: Start difference. First operand 833 states and 1543 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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-02-05 17:40:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:13,400 INFO L93 Difference]: Finished difference Result 1253 states and 2213 transitions. [2025-02-05 17:40:13,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:40:13,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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 54 [2025-02-05 17:40:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:13,410 INFO L225 Difference]: With dead ends: 1253 [2025-02-05 17:40:13,410 INFO L226 Difference]: Without dead ends: 1211 [2025-02-05 17:40:13,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-05 17:40:13,413 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 7898 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7898 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:13,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7898 Valid, 2999 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-02-05 17:40:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 873. [2025-02-05 17:40:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8450057405281286) internal successors, (1607), 872 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:13,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1607 transitions. [2025-02-05 17:40:13,447 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1607 transitions. Word has length 54 [2025-02-05 17:40:13,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:13,447 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1607 transitions. [2025-02-05 17:40:13,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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-02-05 17:40:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1607 transitions. [2025-02-05 17:40:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:40:13,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:13,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:13,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:40:13,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:13,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:13,451 INFO L85 PathProgramCache]: Analyzing trace with hash 582728109, now seen corresponding path program 1 times [2025-02-05 17:40:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:13,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350592822] [2025-02-05 17:40:13,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:13,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:40:13,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:40:13,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:13,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:13,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:13,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350592822] [2025-02-05 17:40:13,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350592822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:13,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:13,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:13,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531858758] [2025-02-05 17:40:13,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:13,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:13,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:13,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:13,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:13,539 INFO L87 Difference]: Start difference. First operand 873 states and 1607 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-02-05 17:40:13,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:13,563 INFO L93 Difference]: Finished difference Result 1026 states and 1850 transitions. [2025-02-05 17:40:13,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:13,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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 56 [2025-02-05 17:40:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:13,567 INFO L225 Difference]: With dead ends: 1026 [2025-02-05 17:40:13,567 INFO L226 Difference]: Without dead ends: 944 [2025-02-05 17:40:13,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:13,568 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 1482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1603 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-02-05 17:40:13,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1603 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-05 17:40:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-02-05 17:40:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 1.824468085106383) internal successors, (1715), 941 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1715 transitions. [2025-02-05 17:40:13,592 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1715 transitions. Word has length 56 [2025-02-05 17:40:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:13,593 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1715 transitions. [2025-02-05 17:40:13,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-02-05 17:40:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1715 transitions. [2025-02-05 17:40:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:40:13,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:13,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:13,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:40:13,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:13,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:13,597 INFO L85 PathProgramCache]: Analyzing trace with hash 615051344, now seen corresponding path program 1 times [2025-02-05 17:40:13,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:13,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177699870] [2025-02-05 17:40:13,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:13,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:13,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:40:13,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:40:13,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:13,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:13,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:13,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177699870] [2025-02-05 17:40:13,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177699870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:13,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:13,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:13,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064618106] [2025-02-05 17:40:13,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:13,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:13,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:13,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:13,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:13,838 INFO L87 Difference]: Start difference. First operand 942 states and 1715 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-02-05 17:40:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:13,980 INFO L93 Difference]: Finished difference Result 1095 states and 1955 transitions. [2025-02-05 17:40:13,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:13,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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 56 [2025-02-05 17:40:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:13,984 INFO L225 Difference]: With dead ends: 1095 [2025-02-05 17:40:13,984 INFO L226 Difference]: Without dead ends: 944 [2025-02-05 17:40:13,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:40:13,986 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 5964 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5964 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:13,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5964 Valid, 1792 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-05 17:40:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-02-05 17:40:14,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 1.8223404255319149) internal successors, (1713), 941 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:14,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1713 transitions. [2025-02-05 17:40:14,003 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1713 transitions. Word has length 56 [2025-02-05 17:40:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:14,003 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1713 transitions. [2025-02-05 17:40:14,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-02-05 17:40:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1713 transitions. [2025-02-05 17:40:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 17:40:14,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:14,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:14,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:40:14,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:14,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:14,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1917260214, now seen corresponding path program 1 times [2025-02-05 17:40:14,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:14,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751495375] [2025-02-05 17:40:14,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:14,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:14,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 17:40:14,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 17:40:14,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:14,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:14,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:14,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751495375] [2025-02-05 17:40:14,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751495375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:14,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:14,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:40:14,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257500691] [2025-02-05 17:40:14,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:14,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:40:14,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:14,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:40:14,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:40:14,207 INFO L87 Difference]: Start difference. First operand 942 states and 1713 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:14,261 INFO L93 Difference]: Finished difference Result 950 states and 1722 transitions. [2025-02-05 17:40:14,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:40:14,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-05 17:40:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:14,264 INFO L225 Difference]: With dead ends: 950 [2025-02-05 17:40:14,265 INFO L226 Difference]: Without dead ends: 948 [2025-02-05 17:40:14,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:40:14,265 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 0 mSDsluCounter, 9209 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10746 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:14,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10746 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-02-05 17:40:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2025-02-05 17:40:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8160676532769555) internal successors, (1718), 947 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1718 transitions. [2025-02-05 17:40:14,279 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1718 transitions. Word has length 57 [2025-02-05 17:40:14,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:14,280 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1718 transitions. [2025-02-05 17:40:14,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1718 transitions. [2025-02-05 17:40:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:14,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:14,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:14,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:40:14,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:14,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:14,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1309029714, now seen corresponding path program 1 times [2025-02-05 17:40:14,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:14,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242522058] [2025-02-05 17:40:14,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:14,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:14,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:14,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:14,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:14,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:14,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242522058] [2025-02-05 17:40:14,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242522058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:14,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:14,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:14,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025642048] [2025-02-05 17:40:14,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:14,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:14,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:14,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:14,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:14,328 INFO L87 Difference]: Start difference. First operand 948 states and 1718 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-02-05 17:40:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:14,349 INFO L93 Difference]: Finished difference Result 1118 states and 1979 transitions. [2025-02-05 17:40:14,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:14,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 58 [2025-02-05 17:40:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:14,353 INFO L225 Difference]: With dead ends: 1118 [2025-02-05 17:40:14,353 INFO L226 Difference]: Without dead ends: 1030 [2025-02-05 17:40:14,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:14,354 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1496 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1663 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-02-05 17:40:14,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1663 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-02-05 17:40:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1028. [2025-02-05 17:40:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1026 states have (on average 1.7923976608187135) internal successors, (1839), 1027 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1839 transitions. [2025-02-05 17:40:14,371 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1839 transitions. Word has length 58 [2025-02-05 17:40:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:14,371 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1839 transitions. [2025-02-05 17:40:14,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-02-05 17:40:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1839 transitions. [2025-02-05 17:40:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:14,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:14,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:14,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:40:14,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:14,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2007007086, now seen corresponding path program 1 times [2025-02-05 17:40:14,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:14,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296190001] [2025-02-05 17:40:14,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:14,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:14,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:14,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:14,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:14,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:14,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:14,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296190001] [2025-02-05 17:40:14,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296190001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:14,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:14,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:14,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719481388] [2025-02-05 17:40:14,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:14,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:14,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:14,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:14,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:14,421 INFO L87 Difference]: Start difference. First operand 1028 states and 1839 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-02-05 17:40:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:14,444 INFO L93 Difference]: Finished difference Result 1474 states and 2519 transitions. [2025-02-05 17:40:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:14,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 58 [2025-02-05 17:40:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:14,449 INFO L225 Difference]: With dead ends: 1474 [2025-02-05 17:40:14,449 INFO L226 Difference]: Without dead ends: 1239 [2025-02-05 17:40:14,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:14,450 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 1494 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1669 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-02-05 17:40:14,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1669 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-02-05 17:40:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1237. [2025-02-05 17:40:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1235 states have (on average 1.7417004048582996) internal successors, (2151), 1236 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:14,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2151 transitions. [2025-02-05 17:40:14,472 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2151 transitions. Word has length 58 [2025-02-05 17:40:14,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:14,472 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 2151 transitions. [2025-02-05 17:40:14,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-02-05 17:40:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2151 transitions. [2025-02-05 17:40:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:14,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:14,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:14,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:40:14,473 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:14,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:14,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1559061550, now seen corresponding path program 1 times [2025-02-05 17:40:14,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:14,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426345529] [2025-02-05 17:40:14,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:14,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:14,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:14,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:14,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:14,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:14,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:14,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426345529] [2025-02-05 17:40:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426345529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:14,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:14,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:14,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68285107] [2025-02-05 17:40:14,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:14,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:14,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:14,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:14,512 INFO L87 Difference]: Start difference. First operand 1237 states and 2151 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-02-05 17:40:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:14,566 INFO L93 Difference]: Finished difference Result 2077 states and 3413 transitions. [2025-02-05 17:40:14,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:14,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 58 [2025-02-05 17:40:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:14,571 INFO L225 Difference]: With dead ends: 2077 [2025-02-05 17:40:14,571 INFO L226 Difference]: Without dead ends: 1633 [2025-02-05 17:40:14,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:14,572 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1492 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1671 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-02-05 17:40:14,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1671 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2025-02-05 17:40:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1631. [2025-02-05 17:40:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.6740331491712708) internal successors, (2727), 1630 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2727 transitions. [2025-02-05 17:40:14,600 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2727 transitions. Word has length 58 [2025-02-05 17:40:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:14,600 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2727 transitions. [2025-02-05 17:40:14,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-02-05 17:40:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2727 transitions. [2025-02-05 17:40:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:14,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:14,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:14,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:40:14,601 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:14,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:14,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1974237422, now seen corresponding path program 1 times [2025-02-05 17:40:14,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:14,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396225309] [2025-02-05 17:40:14,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:14,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:14,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:14,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:14,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:14,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:14,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:14,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396225309] [2025-02-05 17:40:14,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396225309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:14,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:14,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:14,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750204873] [2025-02-05 17:40:14,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:14,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:14,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:14,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:14,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:14,639 INFO L87 Difference]: Start difference. First operand 1631 states and 2727 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-02-05 17:40:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:14,670 INFO L93 Difference]: Finished difference Result 3211 states and 5057 transitions. [2025-02-05 17:40:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:14,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 58 [2025-02-05 17:40:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:14,677 INFO L225 Difference]: With dead ends: 3211 [2025-02-05 17:40:14,677 INFO L226 Difference]: Without dead ends: 2373 [2025-02-05 17:40:14,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:14,678 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1490 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1673 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-02-05 17:40:14,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1673 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-02-05 17:40:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2371. [2025-02-05 17:40:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2369 states have (on average 1.5968763191219923) internal successors, (3783), 2370 states have internal predecessors, (3783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3783 transitions. [2025-02-05 17:40:14,719 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3783 transitions. Word has length 58 [2025-02-05 17:40:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:14,719 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3783 transitions. [2025-02-05 17:40:14,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-02-05 17:40:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3783 transitions. [2025-02-05 17:40:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:14,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:14,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:14,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:40:14,720 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:14,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1487519150, now seen corresponding path program 1 times [2025-02-05 17:40:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:14,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861545932] [2025-02-05 17:40:14,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:14,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:14,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:14,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:14,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:14,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861545932] [2025-02-05 17:40:14,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861545932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:14,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:14,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520893913] [2025-02-05 17:40:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:14,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:14,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:14,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:14,759 INFO L87 Difference]: Start difference. First operand 2371 states and 3783 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-02-05 17:40:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:14,803 INFO L93 Difference]: Finished difference Result 5335 states and 8057 transitions. [2025-02-05 17:40:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:14,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 58 [2025-02-05 17:40:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:14,814 INFO L225 Difference]: With dead ends: 5335 [2025-02-05 17:40:14,814 INFO L226 Difference]: Without dead ends: 3757 [2025-02-05 17:40:14,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:14,817 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1488 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1675 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-02-05 17:40:14,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1675 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:14,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2025-02-05 17:40:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3755. [2025-02-05 17:40:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3753 states have (on average 1.5195843325339728) internal successors, (5703), 3754 states have internal predecessors, (5703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 5703 transitions. [2025-02-05 17:40:14,889 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 5703 transitions. Word has length 58 [2025-02-05 17:40:14,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:14,889 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 5703 transitions. [2025-02-05 17:40:14,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-02-05 17:40:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 5703 transitions. [2025-02-05 17:40:14,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 17:40:14,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:14,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:14,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:40:14,890 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:14,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:14,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1061758730, now seen corresponding path program 1 times [2025-02-05 17:40:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:14,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672891287] [2025-02-05 17:40:14,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:14,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:14,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:40:14,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:40:14,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:14,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:14,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:14,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672891287] [2025-02-05 17:40:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672891287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:14,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:14,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:14,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99799091] [2025-02-05 17:40:14,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:14,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:40:14,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:14,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:40:14,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:40:14,978 INFO L87 Difference]: Start difference. First operand 3755 states and 5703 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 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-02-05 17:40:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:19,606 INFO L93 Difference]: Finished difference Result 6010 states and 10012 transitions. [2025-02-05 17:40:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:40:19,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 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 60 [2025-02-05 17:40:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:19,620 INFO L225 Difference]: With dead ends: 6010 [2025-02-05 17:40:19,620 INFO L226 Difference]: Without dead ends: 5257 [2025-02-05 17:40:19,622 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-02-05 17:40:19,622 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 2389 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:19,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 815 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-05 17:40:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2025-02-05 17:40:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 5257. [2025-02-05 17:40:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5255 states have (on average 1.4898192197906754) internal successors, (7829), 5256 states have internal predecessors, (7829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 7829 transitions. [2025-02-05 17:40:19,711 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 7829 transitions. Word has length 60 [2025-02-05 17:40:19,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:19,711 INFO L471 AbstractCegarLoop]: Abstraction has 5257 states and 7829 transitions. [2025-02-05 17:40:19,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 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-02-05 17:40:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 7829 transitions. [2025-02-05 17:40:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:19,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:19,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:19,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:40:19,713 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:19,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:19,714 INFO L85 PathProgramCache]: Analyzing trace with hash -926993275, now seen corresponding path program 1 times [2025-02-05 17:40:19,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:19,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408339787] [2025-02-05 17:40:19,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:19,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:19,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:19,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:19,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:19,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:40:19,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:19,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408339787] [2025-02-05 17:40:19,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408339787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:19,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:19,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178357432] [2025-02-05 17:40:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:19,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:19,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:19,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:19,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:19,858 INFO L87 Difference]: Start difference. First operand 5257 states and 7829 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:20,168 INFO L93 Difference]: Finished difference Result 19861 states and 28635 transitions. [2025-02-05 17:40:20,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:20,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 77 [2025-02-05 17:40:20,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:20,209 INFO L225 Difference]: With dead ends: 19861 [2025-02-05 17:40:20,210 INFO L226 Difference]: Without dead ends: 17747 [2025-02-05 17:40:20,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:40:20,218 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6307 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6307 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:20,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6307 Valid, 3694 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17747 states. [2025-02-05 17:40:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17747 to 7801. [2025-02-05 17:40:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7801 states, 7799 states have (on average 1.4633927426593154) internal successors, (11413), 7800 states have internal predecessors, (11413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7801 states to 7801 states and 11413 transitions. [2025-02-05 17:40:20,416 INFO L78 Accepts]: Start accepts. Automaton has 7801 states and 11413 transitions. Word has length 77 [2025-02-05 17:40:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:20,416 INFO L471 AbstractCegarLoop]: Abstraction has 7801 states and 11413 transitions. [2025-02-05 17:40:20,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 7801 states and 11413 transitions. [2025-02-05 17:40:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:20,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:20,419 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:20,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:40:20,419 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:20,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1905923771, now seen corresponding path program 1 times [2025-02-05 17:40:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:20,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311414985] [2025-02-05 17:40:20,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:20,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:20,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:20,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:20,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:40:20,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:20,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311414985] [2025-02-05 17:40:20,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311414985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:20,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:20,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087363904] [2025-02-05 17:40:20,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:20,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:20,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:20,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:20,536 INFO L87 Difference]: Start difference. First operand 7801 states and 11413 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:20,855 INFO L93 Difference]: Finished difference Result 22821 states and 32827 transitions. [2025-02-05 17:40:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:20,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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 77 [2025-02-05 17:40:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:20,885 INFO L225 Difference]: With dead ends: 22821 [2025-02-05 17:40:20,885 INFO L226 Difference]: Without dead ends: 19859 [2025-02-05 17:40:20,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:40:20,891 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6307 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6307 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:20,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6307 Valid, 3685 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:20,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19859 states. [2025-02-05 17:40:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19859 to 11817. [2025-02-05 17:40:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11817 states, 11815 states have (on average 1.4440118493440541) internal successors, (17061), 11816 states have internal predecessors, (17061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11817 states to 11817 states and 17061 transitions. [2025-02-05 17:40:21,105 INFO L78 Accepts]: Start accepts. Automaton has 11817 states and 17061 transitions. Word has length 77 [2025-02-05 17:40:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:21,106 INFO L471 AbstractCegarLoop]: Abstraction has 11817 states and 17061 transitions. [2025-02-05 17:40:21,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 11817 states and 17061 transitions. [2025-02-05 17:40:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:21,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:21,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:21,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:40:21,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:21,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:21,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1941097989, now seen corresponding path program 1 times [2025-02-05 17:40:21,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:21,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337173167] [2025-02-05 17:40:21,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:21,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:21,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:21,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:21,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:21,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:40:21,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:21,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337173167] [2025-02-05 17:40:21,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337173167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:21,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:21,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:21,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243775375] [2025-02-05 17:40:21,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:21,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:21,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:21,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:21,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:21,207 INFO L87 Difference]: Start difference. First operand 11817 states and 17061 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:21,556 INFO L93 Difference]: Finished difference Result 25781 states and 37003 transitions. [2025-02-05 17:40:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:21,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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 77 [2025-02-05 17:40:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:21,590 INFO L225 Difference]: With dead ends: 25781 [2025-02-05 17:40:21,590 INFO L226 Difference]: Without dead ends: 22819 [2025-02-05 17:40:21,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:40:21,596 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6331 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6331 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:21,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6331 Valid, 3633 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22819 states. [2025-02-05 17:40:21,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22819 to 14777. [2025-02-05 17:40:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14777 states, 14775 states have (on average 1.4373604060913705) internal successors, (21237), 14776 states have internal predecessors, (21237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14777 states to 14777 states and 21237 transitions. [2025-02-05 17:40:21,881 INFO L78 Accepts]: Start accepts. Automaton has 14777 states and 21237 transitions. Word has length 77 [2025-02-05 17:40:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:21,881 INFO L471 AbstractCegarLoop]: Abstraction has 14777 states and 21237 transitions. [2025-02-05 17:40:21,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:21,881 INFO L276 IsEmpty]: Start isEmpty. Operand 14777 states and 21237 transitions. [2025-02-05 17:40:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:21,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:21,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:21,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:40:21,883 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:21,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1938693435, now seen corresponding path program 1 times [2025-02-05 17:40:21,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:21,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300026141] [2025-02-05 17:40:21,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:21,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:21,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:21,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:21,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:21,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 17:40:21,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:21,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300026141] [2025-02-05 17:40:21,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300026141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:21,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:21,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:21,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490795645] [2025-02-05 17:40:21,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:21,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:21,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:21,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:21,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:21,996 INFO L87 Difference]: Start difference. First operand 14777 states and 21237 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:22,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:22,433 INFO L93 Difference]: Finished difference Result 28741 states and 41179 transitions. [2025-02-05 17:40:22,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:22,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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 77 [2025-02-05 17:40:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:22,475 INFO L225 Difference]: With dead ends: 28741 [2025-02-05 17:40:22,476 INFO L226 Difference]: Without dead ends: 25779 [2025-02-05 17:40:22,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:40:22,487 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 6369 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6369 SdHoareTripleChecker+Valid, 3626 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:22,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6369 Valid, 3626 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25779 states. [2025-02-05 17:40:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25779 to 17737. [2025-02-05 17:40:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17737 states, 17735 states have (on average 1.4329292359740626) internal successors, (25413), 17736 states have internal predecessors, (25413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17737 states to 17737 states and 25413 transitions. [2025-02-05 17:40:22,953 INFO L78 Accepts]: Start accepts. Automaton has 17737 states and 25413 transitions. Word has length 77 [2025-02-05 17:40:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:22,954 INFO L471 AbstractCegarLoop]: Abstraction has 17737 states and 25413 transitions. [2025-02-05 17:40:22,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 17737 states and 25413 transitions. [2025-02-05 17:40:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:22,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:22,957 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:22,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:40:22,957 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:22,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1869555589, now seen corresponding path program 1 times [2025-02-05 17:40:22,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:22,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653787348] [2025-02-05 17:40:22,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:22,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:22,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:22,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:22,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:22,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 17:40:23,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:23,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653787348] [2025-02-05 17:40:23,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653787348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:23,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:23,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:23,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107048945] [2025-02-05 17:40:23,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:23,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:23,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:23,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:23,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:23,093 INFO L87 Difference]: Start difference. First operand 17737 states and 25413 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:23,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:23,685 INFO L93 Difference]: Finished difference Result 31701 states and 45355 transitions. [2025-02-05 17:40:23,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:23,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 77 [2025-02-05 17:40:23,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:23,726 INFO L225 Difference]: With dead ends: 31701 [2025-02-05 17:40:23,726 INFO L226 Difference]: Without dead ends: 28739 [2025-02-05 17:40:23,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:40:23,738 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6325 mSDsluCounter, 2085 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6325 SdHoareTripleChecker+Valid, 3686 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:23,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6325 Valid, 3686 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28739 states. [2025-02-05 17:40:24,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28739 to 20697. [2025-02-05 17:40:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20697 states, 20695 states have (on average 1.4297656438753321) internal successors, (29589), 20696 states have internal predecessors, (29589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20697 states to 20697 states and 29589 transitions. [2025-02-05 17:40:24,174 INFO L78 Accepts]: Start accepts. Automaton has 20697 states and 29589 transitions. Word has length 77 [2025-02-05 17:40:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:24,174 INFO L471 AbstractCegarLoop]: Abstraction has 20697 states and 29589 transitions. [2025-02-05 17:40:24,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 20697 states and 29589 transitions. [2025-02-05 17:40:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 17:40:24,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:24,177 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:24,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:40:24,177 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:24,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1735618441, now seen corresponding path program 1 times [2025-02-05 17:40:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:24,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163339288] [2025-02-05 17:40:24,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:24,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 17:40:24,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 17:40:24,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:24,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:24,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:24,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163339288] [2025-02-05 17:40:24,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163339288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:24,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:24,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:24,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146667588] [2025-02-05 17:40:24,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:24,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:24,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:24,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:24,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:24,239 INFO L87 Difference]: Start difference. First operand 20697 states and 29589 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:24,483 INFO L93 Difference]: Finished difference Result 39101 states and 55575 transitions. [2025-02-05 17:40:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:24,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-02-05 17:40:24,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:24,512 INFO L225 Difference]: With dead ends: 39101 [2025-02-05 17:40:24,512 INFO L226 Difference]: Without dead ends: 20699 [2025-02-05 17:40:24,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:24,531 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 45 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3108 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-02-05 17:40:24,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20699 states. [2025-02-05 17:40:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20699 to 20697. [2025-02-05 17:40:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20697 states, 20695 states have (on average 1.4154626721430297) internal successors, (29293), 20696 states have internal predecessors, (29293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20697 states to 20697 states and 29293 transitions. [2025-02-05 17:40:24,991 INFO L78 Accepts]: Start accepts. Automaton has 20697 states and 29293 transitions. Word has length 78 [2025-02-05 17:40:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:24,991 INFO L471 AbstractCegarLoop]: Abstraction has 20697 states and 29293 transitions. [2025-02-05 17:40:24,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 20697 states and 29293 transitions. [2025-02-05 17:40:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:40:24,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:24,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:24,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:40:24,993 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:24,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash -783999357, now seen corresponding path program 1 times [2025-02-05 17:40:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:24,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814033465] [2025-02-05 17:40:24,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:25,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:40:25,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:40:25,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:25,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:25,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:25,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814033465] [2025-02-05 17:40:25,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814033465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:25,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:25,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:25,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042449349] [2025-02-05 17:40:25,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:25,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:25,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:25,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:25,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:25,053 INFO L87 Difference]: Start difference. First operand 20697 states and 29293 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:25,177 INFO L93 Difference]: Finished difference Result 27584 states and 38987 transitions. [2025-02-05 17:40:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:25,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 17:40:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:25,190 INFO L225 Difference]: With dead ends: 27584 [2025-02-05 17:40:25,191 INFO L226 Difference]: Without dead ends: 9182 [2025-02-05 17:40:25,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:25,205 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 39 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3105 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-02-05 17:40:25,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3105 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9182 states. [2025-02-05 17:40:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9182 to 9174. [2025-02-05 17:40:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9174 states, 9172 states have (on average 1.4376362843436545) internal successors, (13186), 9173 states have internal predecessors, (13186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9174 states to 9174 states and 13186 transitions. [2025-02-05 17:40:25,347 INFO L78 Accepts]: Start accepts. Automaton has 9174 states and 13186 transitions. Word has length 79 [2025-02-05 17:40:25,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:25,347 INFO L471 AbstractCegarLoop]: Abstraction has 9174 states and 13186 transitions. [2025-02-05 17:40:25,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 9174 states and 13186 transitions. [2025-02-05 17:40:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:40:25,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:25,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:25,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:40:25,348 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:25,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:25,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1691147440, now seen corresponding path program 1 times [2025-02-05 17:40:25,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:25,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366225173] [2025-02-05 17:40:25,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:25,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:25,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:40:25,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:40:25,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:25,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:25,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366225173] [2025-02-05 17:40:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366225173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:25,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:25,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:25,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838472344] [2025-02-05 17:40:25,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:25,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:25,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:25,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:25,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:25,406 INFO L87 Difference]: Start difference. First operand 9174 states and 13186 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:25,471 INFO L93 Difference]: Finished difference Result 12610 states and 17972 transitions. [2025-02-05 17:40:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:25,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-02-05 17:40:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:25,478 INFO L225 Difference]: With dead ends: 12610 [2025-02-05 17:40:25,479 INFO L226 Difference]: Without dead ends: 5744 [2025-02-05 17:40:25,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:25,488 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 41 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3084 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-02-05 17:40:25,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3084 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2025-02-05 17:40:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 5742. [2025-02-05 17:40:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5742 states, 5740 states have (on average 1.4547038327526132) internal successors, (8350), 5741 states have internal predecessors, (8350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5742 states to 5742 states and 8350 transitions. [2025-02-05 17:40:25,570 INFO L78 Accepts]: Start accepts. Automaton has 5742 states and 8350 transitions. Word has length 80 [2025-02-05 17:40:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:25,570 INFO L471 AbstractCegarLoop]: Abstraction has 5742 states and 8350 transitions. [2025-02-05 17:40:25,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 5742 states and 8350 transitions. [2025-02-05 17:40:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 17:40:25,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:25,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:25,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:40:25,571 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:25,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash 234523383, now seen corresponding path program 1 times [2025-02-05 17:40:25,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:25,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553521210] [2025-02-05 17:40:25,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:25,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:25,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 17:40:25,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 17:40:25,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:25,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:25,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:25,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553521210] [2025-02-05 17:40:25,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553521210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:25,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:25,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966334360] [2025-02-05 17:40:25,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:25,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:25,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:25,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:25,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:25,632 INFO L87 Difference]: Start difference. First operand 5742 states and 8350 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:25,673 INFO L93 Difference]: Finished difference Result 7462 states and 10718 transitions. [2025-02-05 17:40:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-02-05 17:40:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:25,678 INFO L225 Difference]: With dead ends: 7462 [2025-02-05 17:40:25,678 INFO L226 Difference]: Without dead ends: 4028 [2025-02-05 17:40:25,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:25,682 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 38 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3069 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-02-05 17:40:25,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3069 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2025-02-05 17:40:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 4026. [2025-02-05 17:40:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4026 states, 4024 states have (on average 1.4806163021868788) internal successors, (5958), 4025 states have internal predecessors, (5958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4026 states to 4026 states and 5958 transitions. [2025-02-05 17:40:25,795 INFO L78 Accepts]: Start accepts. Automaton has 4026 states and 5958 transitions. Word has length 82 [2025-02-05 17:40:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:25,796 INFO L471 AbstractCegarLoop]: Abstraction has 4026 states and 5958 transitions. [2025-02-05 17:40:25,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4026 states and 5958 transitions. [2025-02-05 17:40:25,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:40:25,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:25,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:25,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:40:25,799 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:25,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1533089186, now seen corresponding path program 1 times [2025-02-05 17:40:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:25,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429918290] [2025-02-05 17:40:25,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:25,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:25,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:40:25,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:40:25,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:25,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:25,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:25,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429918290] [2025-02-05 17:40:25,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429918290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:25,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:25,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:25,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967312965] [2025-02-05 17:40:25,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:25,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:25,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:25,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:25,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:25,864 INFO L87 Difference]: Start difference. First operand 4026 states and 5958 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:25,892 INFO L93 Difference]: Finished difference Result 4888 states and 7130 transitions. [2025-02-05 17:40:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-02-05 17:40:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:25,896 INFO L225 Difference]: With dead ends: 4888 [2025-02-05 17:40:25,896 INFO L226 Difference]: Without dead ends: 3170 [2025-02-05 17:40:25,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:25,899 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 35 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3054 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-02-05 17:40:25,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3054 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2025-02-05 17:40:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3168. [2025-02-05 17:40:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3168 states, 3166 states have (on average 1.5082122552116235) internal successors, (4775), 3167 states have internal predecessors, (4775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 4775 transitions. [2025-02-05 17:40:25,933 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 4775 transitions. Word has length 84 [2025-02-05 17:40:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:25,933 INFO L471 AbstractCegarLoop]: Abstraction has 3168 states and 4775 transitions. [2025-02-05 17:40:25,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 4775 transitions. [2025-02-05 17:40:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 17:40:25,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:25,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:25,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:40:25,935 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:25,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash 296643301, now seen corresponding path program 1 times [2025-02-05 17:40:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:25,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305508700] [2025-02-05 17:40:25,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:25,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 17:40:25,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 17:40:25,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:25,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:40:26,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:26,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305508700] [2025-02-05 17:40:26,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305508700] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:40:26,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933040030] [2025-02-05 17:40:26,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:26,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:40:26,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:26,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:40:26,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:40:26,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 17:40:26,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 17:40:26,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:26,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:26,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 17:40:26,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:40:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:26,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:40:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:26,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933040030] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:40:26,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:40:26,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 13 [2025-02-05 17:40:26,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089870745] [2025-02-05 17:40:26,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:40:26,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 17:40:26,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:26,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 17:40:26,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:40:26,734 INFO L87 Difference]: Start difference. First operand 3168 states and 4775 transitions. Second operand has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:26,930 INFO L93 Difference]: Finished difference Result 5996 states and 8546 transitions. [2025-02-05 17:40:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:40:26,930 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 0 states have call successors, (0), 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 86 [2025-02-05 17:40:26,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:26,935 INFO L225 Difference]: With dead ends: 5996 [2025-02-05 17:40:26,935 INFO L226 Difference]: Without dead ends: 5108 [2025-02-05 17:40:26,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:40:26,937 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 7537 mSDsluCounter, 4960 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7537 SdHoareTripleChecker+Valid, 6567 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:26,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7537 Valid, 6567 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:26,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2025-02-05 17:40:27,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 5045. [2025-02-05 17:40:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5045 states, 5043 states have (on average 1.4261352369621256) internal successors, (7192), 5044 states have internal predecessors, (7192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 7192 transitions. [2025-02-05 17:40:27,014 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 7192 transitions. Word has length 86 [2025-02-05 17:40:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:27,014 INFO L471 AbstractCegarLoop]: Abstraction has 5045 states and 7192 transitions. [2025-02-05 17:40:27,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 7192 transitions. [2025-02-05 17:40:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 17:40:27,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:27,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:27,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 17:40:27,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-05 17:40:27,216 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:27,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:27,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1757617236, now seen corresponding path program 1 times [2025-02-05 17:40:27,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:27,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027353219] [2025-02-05 17:40:27,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:27,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:27,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 17:40:27,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 17:40:27,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:27,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:28,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027353219] [2025-02-05 17:40:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027353219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:40:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914545022] [2025-02-05 17:40:28,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:28,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:40:28,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:28,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:40:28,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:40:28,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 17:40:28,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 17:40:28,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:28,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:28,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 17:40:28,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:40:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:28,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:40:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914545022] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:40:29,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:40:29,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 34 [2025-02-05 17:40:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690515113] [2025-02-05 17:40:29,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:40:29,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 17:40:29,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:29,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 17:40:29,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 17:40:29,745 INFO L87 Difference]: Start difference. First operand 5045 states and 7192 transitions. Second operand has 34 states, 34 states have (on average 6.794117647058823) internal successors, (231), 34 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:33,887 INFO L93 Difference]: Finished difference Result 23780 states and 31853 transitions. [2025-02-05 17:40:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-02-05 17:40:33,887 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.794117647058823) internal successors, (231), 34 states have internal predecessors, (231), 0 states have call successors, (0), 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 87 [2025-02-05 17:40:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:33,912 INFO L225 Difference]: With dead ends: 23780 [2025-02-05 17:40:33,913 INFO L226 Difference]: Without dead ends: 21161 [2025-02-05 17:40:33,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1256, Invalid=6400, Unknown=0, NotChecked=0, Total=7656 [2025-02-05 17:40:33,920 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 24548 mSDsluCounter, 11168 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24548 SdHoareTripleChecker+Valid, 12679 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:33,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24548 Valid, 12679 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 17:40:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21161 states. [2025-02-05 17:40:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21161 to 13755. [2025-02-05 17:40:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13755 states, 13753 states have (on average 1.3366538209845125) internal successors, (18383), 13754 states have internal predecessors, (18383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 18383 transitions. [2025-02-05 17:40:34,230 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 18383 transitions. Word has length 87 [2025-02-05 17:40:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:34,230 INFO L471 AbstractCegarLoop]: Abstraction has 13755 states and 18383 transitions. [2025-02-05 17:40:34,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.794117647058823) internal successors, (231), 34 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 18383 transitions. [2025-02-05 17:40:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 17:40:34,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:34,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:34,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 17:40:34,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:40:34,436 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:34,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:34,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1562871412, now seen corresponding path program 1 times [2025-02-05 17:40:34,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:34,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505752959] [2025-02-05 17:40:34,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:34,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:34,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 17:40:34,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 17:40:34,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:34,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:34,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:34,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505752959] [2025-02-05 17:40:34,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505752959] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:40:34,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705029660] [2025-02-05 17:40:34,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:34,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:40:34,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:34,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:40:34,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:40:35,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 17:40:35,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 17:40:35,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:35,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:35,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:40:35,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:40:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:35,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:40:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:36,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705029660] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:40:36,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:40:36,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-02-05 17:40:36,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451121102] [2025-02-05 17:40:36,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:40:36,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 17:40:36,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:36,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 17:40:36,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-02-05 17:40:36,169 INFO L87 Difference]: Start difference. First operand 13755 states and 18383 transitions. Second operand has 25 states, 25 states have (on average 9.32) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:37,739 INFO L93 Difference]: Finished difference Result 46295 states and 60550 transitions. [2025-02-05 17:40:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 17:40:37,740 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.32) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 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 87 [2025-02-05 17:40:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:37,772 INFO L225 Difference]: With dead ends: 46295 [2025-02-05 17:40:37,772 INFO L226 Difference]: Without dead ends: 35125 [2025-02-05 17:40:37,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=462, Invalid=1794, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 17:40:37,782 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 21525 mSDsluCounter, 6501 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21525 SdHoareTripleChecker+Valid, 8027 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:37,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21525 Valid, 8027 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:40:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35125 states. [2025-02-05 17:40:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35125 to 34973. [2025-02-05 17:40:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34973 states, 34971 states have (on average 1.2849503874638986) internal successors, (44936), 34972 states have internal predecessors, (44936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34973 states to 34973 states and 44936 transitions. [2025-02-05 17:40:38,964 INFO L78 Accepts]: Start accepts. Automaton has 34973 states and 44936 transitions. Word has length 87 [2025-02-05 17:40:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:38,964 INFO L471 AbstractCegarLoop]: Abstraction has 34973 states and 44936 transitions. [2025-02-05 17:40:38,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.32) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 34973 states and 44936 transitions. [2025-02-05 17:40:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 17:40:38,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:38,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 17:40:39,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:40:39,174 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:39,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1583507714, now seen corresponding path program 1 times [2025-02-05 17:40:39,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:39,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122536283] [2025-02-05 17:40:39,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:39,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 17:40:39,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 17:40:39,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:39,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122536283] [2025-02-05 17:40:39,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122536283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:40:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531381839] [2025-02-05 17:40:39,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:39,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:40:39,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:39,470 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:40:39,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 17:40:39,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 17:40:39,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 17:40:39,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:39,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:39,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:40:39,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:40:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:40,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:40:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:40,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531381839] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:40:40,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:40:40,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-05 17:40:40,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557570804] [2025-02-05 17:40:40,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:40:40,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 17:40:40,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:40,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 17:40:40,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-02-05 17:40:40,739 INFO L87 Difference]: Start difference. First operand 34973 states and 44936 transitions. Second operand has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 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-02-05 17:40:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:41,915 INFO L93 Difference]: Finished difference Result 73630 states and 94069 transitions. [2025-02-05 17:40:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:40:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 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 88 [2025-02-05 17:40:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:41,959 INFO L225 Difference]: With dead ends: 73630 [2025-02-05 17:40:41,960 INFO L226 Difference]: Without dead ends: 42860 [2025-02-05 17:40:41,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2025-02-05 17:40:41,988 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 10576 mSDsluCounter, 3392 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10576 SdHoareTripleChecker+Valid, 4902 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:41,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10576 Valid, 4902 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:40:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42860 states. [2025-02-05 17:40:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42860 to 42856. [2025-02-05 17:40:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42856 states, 42854 states have (on average 1.2791104681009942) internal successors, (54815), 42855 states have internal predecessors, (54815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42856 states to 42856 states and 54815 transitions. [2025-02-05 17:40:43,491 INFO L78 Accepts]: Start accepts. Automaton has 42856 states and 54815 transitions. Word has length 88 [2025-02-05 17:40:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:43,491 INFO L471 AbstractCegarLoop]: Abstraction has 42856 states and 54815 transitions. [2025-02-05 17:40:43,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 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-02-05 17:40:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 42856 states and 54815 transitions. [2025-02-05 17:40:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 17:40:43,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:43,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:43,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 17:40:43,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 17:40:43,698 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:43,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1347305649, now seen corresponding path program 1 times [2025-02-05 17:40:43,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:43,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028954815] [2025-02-05 17:40:43,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:43,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:43,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:40:43,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:40:43,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:43,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:44,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:44,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028954815] [2025-02-05 17:40:44,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028954815] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:40:44,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444370469] [2025-02-05 17:40:44,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:44,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:40:44,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:44,044 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:40:44,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 17:40:44,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:40:44,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:40:44,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:44,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:44,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-05 17:40:44,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:40:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:47,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:40:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:51,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444370469] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:40:51,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:40:51,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25, 24] total 55 [2025-02-05 17:40:51,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436262751] [2025-02-05 17:40:51,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:40:51,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-05 17:40:51,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:51,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-05 17:40:51,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=2656, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 17:40:51,204 INFO L87 Difference]: Start difference. First operand 42856 states and 54815 transitions. Second operand has 55 states, 55 states have (on average 4.490909090909091) internal successors, (247), 55 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)