./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label01.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.UNBOUNDED.pals+Problem12_label01.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 79d6d14ab0026435a30858ddf19b47e14c18490c6f54007e738f20f9faaa8cb9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:40:09,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:40:09,511 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:09,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:40:09,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:40:09,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:40:09,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:40:09,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:40:09,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:40:09,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:40:09,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:40:09,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:40:09,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:40:09,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:40:09,544 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:40:09,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:40:09,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:40:09,544 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:40:09,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:40:09,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:40:09,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:40:09,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:40:09,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:40:09,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:40:09,545 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:40:09,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:40:09,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:40:09,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:40:09,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:40:09,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:40:09,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:40:09,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:40:09,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:40:09,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:40:09,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:40:09,546 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:40:09,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:40:09,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:40:09,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:40:09,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:40:09,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:40:09,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:40:09,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:40:09,547 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 -> 79d6d14ab0026435a30858ddf19b47e14c18490c6f54007e738f20f9faaa8cb9 [2025-02-05 17:40:09,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:40:09,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:40:09,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:40:09,838 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:40:09,839 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:40:09,840 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.UNBOUNDED.pals+Problem12_label01.c [2025-02-05 17:40:11,088 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa5c23663/97963cd5949b42df9ff422c90cc1fe4c/FLAGd8dd320b6 [2025-02-05 17:40:11,549 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:40:11,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-02-05 17:40:11,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa5c23663/97963cd5949b42df9ff422c90cc1fe4c/FLAGd8dd320b6 [2025-02-05 17:40:11,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa5c23663/97963cd5949b42df9ff422c90cc1fe4c [2025-02-05 17:40:11,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:40:11,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:40:11,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:40:11,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:40:11,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:40:11,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:40:11" (1/1) ... [2025-02-05 17:40:11,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72690f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:11, skipping insertion in model container [2025-02-05 17:40:11,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:40:11" (1/1) ... [2025-02-05 17:40:11,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:40:12,040 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.UNBOUNDED.pals+Problem12_label01.c[11705,11718] [2025-02-05 17:40:12,102 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.UNBOUNDED.pals+Problem12_label01.c[17260,17273] [2025-02-05 17:40:12,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:40:12,634 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:40:12,664 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.UNBOUNDED.pals+Problem12_label01.c[11705,11718] [2025-02-05 17:40:12,671 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.UNBOUNDED.pals+Problem12_label01.c[17260,17273] [2025-02-05 17:40:13,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:40:13,059 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:40:13,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:13 WrapperNode [2025-02-05 17:40:13,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:40:13,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:40:13,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:40:13,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:40:13,068 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:13" (1/1) ... [2025-02-05 17:40:13,125 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:13" (1/1) ... [2025-02-05 17:40:13,438 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5092 [2025-02-05 17:40:13,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:40:13,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:40:13,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:40:13,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:40:13,450 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:13" (1/1) ... [2025-02-05 17:40:13,451 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:13" (1/1) ... [2025-02-05 17:40:13,506 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:13" (1/1) ... [2025-02-05 17:40:13,686 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:13,687 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:13" (1/1) ... [2025-02-05 17:40:13,687 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:13" (1/1) ... [2025-02-05 17:40:13,799 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:13" (1/1) ... [2025-02-05 17:40:13,820 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:13" (1/1) ... [2025-02-05 17:40:13,843 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:13" (1/1) ... [2025-02-05 17:40:13,862 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:13" (1/1) ... [2025-02-05 17:40:13,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:40:13,981 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:40:13,981 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:40:13,981 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:40:13,982 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:13" (1/1) ... [2025-02-05 17:40:13,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:40:13,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:14,014 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:14,019 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:14,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:40:14,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:40:14,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:40:14,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:40:14,156 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:40:14,158 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:40:18,499 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2131: havoc calculate_output_#t~ret37#1; [2025-02-05 17:40:18,499 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3610: havoc calculate_output2_#t~ret38#1; [2025-02-05 17:40:18,499 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5100: havoc calculate_output3_#t~ret39#1; [2025-02-05 17:40:18,724 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-02-05 17:40:18,725 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:40:18,763 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:40:18,767 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:40:18,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:40:18 BoogieIcfgContainer [2025-02-05 17:40:18,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:40:18,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:40:18,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:40:18,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:40:18,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:40:11" (1/3) ... [2025-02-05 17:40:18,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75876153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:40:18, skipping insertion in model container [2025-02-05 17:40:18,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:40:13" (2/3) ... [2025-02-05 17:40:18,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75876153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:40:18, skipping insertion in model container [2025-02-05 17:40:18,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:40:18" (3/3) ... [2025-02-05 17:40:18,779 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-02-05 17:40:18,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:40:18,797 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label01.c that has 1 procedures, 900 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:40:18,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:40:18,891 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;@5937949b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:40:18,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:40:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 900 states, 897 states have (on average 1.9030100334448161) internal successors, (1707), 899 states have internal predecessors, (1707), 0 states have call successors, (0), 0 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:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:40:18,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:18,906 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:18,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:18,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash -29917392, now seen corresponding path program 1 times [2025-02-05 17:40:18,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:18,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056278230] [2025-02-05 17:40:18,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:18,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:40:19,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:40:19,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:19,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:19,163 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:19,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:19,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056278230] [2025-02-05 17:40:19,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056278230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:19,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:19,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:40:19,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501091855] [2025-02-05 17:40:19,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:19,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:40:19,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:19,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:40:19,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:40:19,195 INFO L87 Difference]: Start difference. First operand has 900 states, 897 states have (on average 1.9030100334448161) internal successors, (1707), 899 states have internal predecessors, (1707), 0 states have call successors, (0), 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:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:19,277 INFO L93 Difference]: Finished difference Result 1762 states and 3343 transitions. [2025-02-05 17:40:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:40:19,279 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:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:19,300 INFO L225 Difference]: With dead ends: 1762 [2025-02-05 17:40:19,300 INFO L226 Difference]: Without dead ends: 835 [2025-02-05 17:40:19,305 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:19,309 INFO L435 NwaCegarLoop]: 1641 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, 1641 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:19,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1641 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:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-02-05 17:40:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-02-05 17:40:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 833 states have (on average 1.893157262905162) internal successors, (1577), 834 states have internal predecessors, (1577), 0 states have call successors, (0), 0 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,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1577 transitions. [2025-02-05 17:40:19,389 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1577 transitions. Word has length 24 [2025-02-05 17:40:19,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:19,390 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1577 transitions. [2025-02-05 17:40:19,390 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:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1577 transitions. [2025-02-05 17:40:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:40:19,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:19,391 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:19,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:40:19,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:19,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:19,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1026989745, now seen corresponding path program 1 times [2025-02-05 17:40:19,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:19,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226115446] [2025-02-05 17:40:19,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:19,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:40:19,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:40:19,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:19,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:19,658 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:19,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:19,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226115446] [2025-02-05 17:40:19,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226115446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:19,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:19,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:40:19,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432913585] [2025-02-05 17:40:19,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:19,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:40:19,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:19,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:40:19,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:40:19,662 INFO L87 Difference]: Start difference. First operand 835 states and 1577 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:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:19,800 INFO L93 Difference]: Finished difference Result 883 states and 1651 transitions. [2025-02-05 17:40:19,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:40:19,800 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:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:19,808 INFO L225 Difference]: With dead ends: 883 [2025-02-05 17:40:19,808 INFO L226 Difference]: Without dead ends: 835 [2025-02-05 17:40:19,809 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:19,809 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 0 mSDsluCounter, 4689 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6264 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:19,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6264 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:19,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-02-05 17:40:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-02-05 17:40:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 833 states have (on average 1.8559423769507803) internal successors, (1546), 834 states have internal predecessors, (1546), 0 states have call successors, (0), 0 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,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1546 transitions. [2025-02-05 17:40:19,835 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1546 transitions. Word has length 24 [2025-02-05 17:40:19,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:19,836 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1546 transitions. [2025-02-05 17:40:19,836 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:19,836 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1546 transitions. [2025-02-05 17:40:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 17:40:19,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:19,837 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] [2025-02-05 17:40:19,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:40:19,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:19,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash -807431780, now seen corresponding path program 1 times [2025-02-05 17:40:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:19,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385653432] [2025-02-05 17:40:19,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:19,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 17:40:19,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 17:40:19,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:19,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:20,104 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:20,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:20,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385653432] [2025-02-05 17:40:20,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385653432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:20,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:20,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:20,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630680509] [2025-02-05 17:40:20,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:20,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:40:20,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:20,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:40:20,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:40:20,107 INFO L87 Difference]: Start difference. First operand 835 states and 1546 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:25,965 INFO L93 Difference]: Finished difference Result 3090 states and 5855 transitions. [2025-02-05 17:40:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:40:25,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-02-05 17:40:25,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:25,977 INFO L225 Difference]: With dead ends: 3090 [2025-02-05 17:40:25,977 INFO L226 Difference]: Without dead ends: 2337 [2025-02-05 17:40:25,979 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:25,980 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 2431 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:25,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2431 Valid, 800 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-02-05 17:40:25,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2025-02-05 17:40:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2337. [2025-02-05 17:40:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 2335 states have (on average 1.5674518201284797) internal successors, (3660), 2336 states have internal predecessors, (3660), 0 states have call successors, (0), 0 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,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3660 transitions. [2025-02-05 17:40:26,053 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3660 transitions. Word has length 48 [2025-02-05 17:40:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:26,053 INFO L471 AbstractCegarLoop]: Abstraction has 2337 states and 3660 transitions. [2025-02-05 17:40:26,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3660 transitions. [2025-02-05 17:40:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:40:26,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:26,055 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:26,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:40:26,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:26,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:26,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1149039, now seen corresponding path program 1 times [2025-02-05 17:40:26,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:26,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386466785] [2025-02-05 17:40:26,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:26,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:26,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:40:26,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:40:26,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:26,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:26,286 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:26,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:26,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386466785] [2025-02-05 17:40:26,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386466785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:26,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:26,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:26,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093680203] [2025-02-05 17:40:26,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:26,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:26,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:26,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:26,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:26,290 INFO L87 Difference]: Start difference. First operand 2337 states and 3660 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:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:26,506 INFO L93 Difference]: Finished difference Result 2777 states and 4360 transitions. [2025-02-05 17:40:26,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:40:26,507 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:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:26,519 INFO L225 Difference]: With dead ends: 2777 [2025-02-05 17:40:26,520 INFO L226 Difference]: Without dead ends: 2733 [2025-02-05 17:40:26,522 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:26,523 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 7979 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7979 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:26,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7979 Valid, 2696 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2025-02-05 17:40:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2379. [2025-02-05 17:40:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2377 states have (on average 1.5679427850231384) internal successors, (3727), 2378 states have internal predecessors, (3727), 0 states have call successors, (0), 0 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,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3727 transitions. [2025-02-05 17:40:26,587 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3727 transitions. Word has length 54 [2025-02-05 17:40:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:26,589 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3727 transitions. [2025-02-05 17:40:26,589 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:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3727 transitions. [2025-02-05 17:40:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:40:26,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:26,591 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:26,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:40:26,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:26,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:26,591 INFO L85 PathProgramCache]: Analyzing trace with hash 16126764, now seen corresponding path program 1 times [2025-02-05 17:40:26,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:26,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634434397] [2025-02-05 17:40:26,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:26,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:26,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:40:26,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:40:26,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:26,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:26,702 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:26,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:26,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634434397] [2025-02-05 17:40:26,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634434397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:26,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:26,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:26,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351126391] [2025-02-05 17:40:26,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:26,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:26,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:26,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:26,705 INFO L87 Difference]: Start difference. First operand 2379 states and 3727 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:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:26,740 INFO L93 Difference]: Finished difference Result 2540 states and 3982 transitions. [2025-02-05 17:40:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:26,741 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:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:26,751 INFO L225 Difference]: With dead ends: 2540 [2025-02-05 17:40:26,751 INFO L226 Difference]: Without dead ends: 2454 [2025-02-05 17:40:26,753 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:26,753 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1484 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:26,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1605 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:40:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2025-02-05 17:40:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2450. [2025-02-05 17:40:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 1.5674019607843137) internal successors, (3837), 2449 states have internal predecessors, (3837), 0 states have call successors, (0), 0 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,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3837 transitions. [2025-02-05 17:40:26,875 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3837 transitions. Word has length 56 [2025-02-05 17:40:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:26,876 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3837 transitions. [2025-02-05 17:40:26,876 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:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3837 transitions. [2025-02-05 17:40:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:40:26,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:26,879 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:26,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:40:26,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:26,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash 48449999, now seen corresponding path program 1 times [2025-02-05 17:40:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:26,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840274] [2025-02-05 17:40:26,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:26,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:26,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:40:26,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:40:26,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:26,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:27,224 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:27,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:27,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840274] [2025-02-05 17:40:27,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:27,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:27,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:27,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776417893] [2025-02-05 17:40:27,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:27,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:27,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:27,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:27,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:27,225 INFO L87 Difference]: Start difference. First operand 2450 states and 3837 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:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:27,410 INFO L93 Difference]: Finished difference Result 2609 states and 4085 transitions. [2025-02-05 17:40:27,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:27,410 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:27,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:27,421 INFO L225 Difference]: With dead ends: 2609 [2025-02-05 17:40:27,421 INFO L226 Difference]: Without dead ends: 2452 [2025-02-05 17:40:27,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:40:27,424 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 3000 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3000 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:27,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3000 Valid, 1811 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-02-05 17:40:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2450. [2025-02-05 17:40:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 1.5665849673202614) internal successors, (3835), 2449 states have internal predecessors, (3835), 0 states have call successors, (0), 0 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,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3835 transitions. [2025-02-05 17:40:27,486 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3835 transitions. Word has length 56 [2025-02-05 17:40:27,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:27,487 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3835 transitions. [2025-02-05 17:40:27,487 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:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3835 transitions. [2025-02-05 17:40:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 17:40:27,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:27,488 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:27,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:40:27,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:27,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1532487703, now seen corresponding path program 1 times [2025-02-05 17:40:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:27,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656003365] [2025-02-05 17:40:27,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:27,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 17:40:27,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 17:40:27,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:27,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:27,799 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:27,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:27,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656003365] [2025-02-05 17:40:27,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656003365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:27,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:27,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:40:27,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033518152] [2025-02-05 17:40:27,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:27,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:40:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:27,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:40:27,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:40:27,801 INFO L87 Difference]: Start difference. First operand 2450 states and 3835 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:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:27,867 INFO L93 Difference]: Finished difference Result 2458 states and 3844 transitions. [2025-02-05 17:40:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:40:27,868 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:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:27,878 INFO L225 Difference]: With dead ends: 2458 [2025-02-05 17:40:27,878 INFO L226 Difference]: Without dead ends: 2456 [2025-02-05 17:40:27,880 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:27,880 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 0 mSDsluCounter, 9227 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10767 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:27,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10767 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:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2025-02-05 17:40:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2456. [2025-02-05 17:40:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2456 states, 2454 states have (on average 1.56479217603912) internal successors, (3840), 2455 states have internal predecessors, (3840), 0 states have call successors, (0), 0 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,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 3840 transitions. [2025-02-05 17:40:27,939 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 3840 transitions. Word has length 57 [2025-02-05 17:40:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:27,940 INFO L471 AbstractCegarLoop]: Abstraction has 2456 states and 3840 transitions. [2025-02-05 17:40:27,940 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:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 3840 transitions. [2025-02-05 17:40:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:27,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:27,942 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:27,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:40:27,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:27,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:27,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1331006163, now seen corresponding path program 1 times [2025-02-05 17:40:27,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:27,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203472927] [2025-02-05 17:40:27,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:27,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:27,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:27,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:27,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:27,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:28,013 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:28,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:28,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203472927] [2025-02-05 17:40:28,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203472927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:28,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:28,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:28,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764075664] [2025-02-05 17:40:28,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:28,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:28,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:28,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:28,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:28,015 INFO L87 Difference]: Start difference. First operand 2456 states and 3840 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:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:28,045 INFO L93 Difference]: Finished difference Result 2766 states and 4312 transitions. [2025-02-05 17:40:28,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:28,045 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:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:28,056 INFO L225 Difference]: With dead ends: 2766 [2025-02-05 17:40:28,056 INFO L226 Difference]: Without dead ends: 2603 [2025-02-05 17:40:28,059 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:28,060 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1497 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1668 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:28,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1668 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:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2025-02-05 17:40:28,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2601. [2025-02-05 17:40:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2601 states, 2599 states have (on average 1.5609849942285494) internal successors, (4057), 2600 states have internal predecessors, (4057), 0 states have call successors, (0), 0 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:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 4057 transitions. [2025-02-05 17:40:28,121 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 4057 transitions. Word has length 58 [2025-02-05 17:40:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:28,122 INFO L471 AbstractCegarLoop]: Abstraction has 2601 states and 4057 transitions. [2025-02-05 17:40:28,122 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:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 4057 transitions. [2025-02-05 17:40:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:28,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:28,123 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:28,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:40:28,124 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:28,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1778951699, now seen corresponding path program 1 times [2025-02-05 17:40:28,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:28,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794416941] [2025-02-05 17:40:28,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:28,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:28,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:28,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:28,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:28,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:28,189 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:28,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:28,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794416941] [2025-02-05 17:40:28,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794416941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:28,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:28,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:28,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461435078] [2025-02-05 17:40:28,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:28,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:28,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:28,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:28,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:28,193 INFO L87 Difference]: Start difference. First operand 2601 states and 4057 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:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:28,228 INFO L93 Difference]: Finished difference Result 3185 states and 4935 transitions. [2025-02-05 17:40:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:28,229 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:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:28,240 INFO L225 Difference]: With dead ends: 3185 [2025-02-05 17:40:28,240 INFO L226 Difference]: Without dead ends: 2877 [2025-02-05 17:40:28,244 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:28,245 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1495 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1670 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:28,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1670 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:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2025-02-05 17:40:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2875. [2025-02-05 17:40:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2873 states have (on average 1.5520361990950227) internal successors, (4459), 2874 states have internal predecessors, (4459), 0 states have call successors, (0), 0 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:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4459 transitions. [2025-02-05 17:40:28,315 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4459 transitions. Word has length 58 [2025-02-05 17:40:28,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:28,315 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 4459 transitions. [2025-02-05 17:40:28,316 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:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4459 transitions. [2025-02-05 17:40:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:28,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:28,317 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:28,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:40:28,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:28,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1363775827, now seen corresponding path program 1 times [2025-02-05 17:40:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:28,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133819932] [2025-02-05 17:40:28,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:28,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:28,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:28,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:28,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:28,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:28,376 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:28,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:28,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133819932] [2025-02-05 17:40:28,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133819932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:28,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:28,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:28,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937861282] [2025-02-05 17:40:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:28,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:28,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:28,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:28,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:28,378 INFO L87 Difference]: Start difference. First operand 2875 states and 4459 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:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:28,419 INFO L93 Difference]: Finished difference Result 3975 states and 6085 transitions. [2025-02-05 17:40:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:28,420 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:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:28,434 INFO L225 Difference]: With dead ends: 3975 [2025-02-05 17:40:28,434 INFO L226 Difference]: Without dead ends: 3393 [2025-02-05 17:40:28,437 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:28,437 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 1493 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1672 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:28,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1672 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:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2025-02-05 17:40:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 3391. [2025-02-05 17:40:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3391 states, 3389 states have (on average 1.534080849808203) internal successors, (5199), 3390 states have internal predecessors, (5199), 0 states have call successors, (0), 0 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:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 5199 transitions. [2025-02-05 17:40:28,527 INFO L78 Accepts]: Start accepts. Automaton has 3391 states and 5199 transitions. Word has length 58 [2025-02-05 17:40:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:28,527 INFO L471 AbstractCegarLoop]: Abstraction has 3391 states and 5199 transitions. [2025-02-05 17:40:28,527 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:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 5199 transitions. [2025-02-05 17:40:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:40:28,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:28,528 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:28,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:40:28,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:28,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:28,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1850494099, now seen corresponding path program 1 times [2025-02-05 17:40:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:28,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88919092] [2025-02-05 17:40:28,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:28,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:28,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:40:28,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:40:28,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:28,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:28,623 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:28,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:28,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88919092] [2025-02-05 17:40:28,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88919092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:28,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:28,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:28,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608392242] [2025-02-05 17:40:28,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:28,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:28,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:28,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:28,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:28,626 INFO L87 Difference]: Start difference. First operand 3391 states and 5199 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:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:28,679 INFO L93 Difference]: Finished difference Result 5459 states and 8193 transitions. [2025-02-05 17:40:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:28,680 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:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:28,705 INFO L225 Difference]: With dead ends: 5459 [2025-02-05 17:40:28,706 INFO L226 Difference]: Without dead ends: 4361 [2025-02-05 17:40:28,709 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:28,710 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 1491 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1674 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:28,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1674 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:28,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4361 states. [2025-02-05 17:40:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4361 to 4359. [2025-02-05 17:40:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4359 states, 4357 states have (on average 1.5035574936883176) internal successors, (6551), 4358 states have internal predecessors, (6551), 0 states have call successors, (0), 0 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:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6551 transitions. [2025-02-05 17:40:28,820 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6551 transitions. Word has length 58 [2025-02-05 17:40:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:28,820 INFO L471 AbstractCegarLoop]: Abstraction has 4359 states and 6551 transitions. [2025-02-05 17:40:28,820 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:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6551 transitions. [2025-02-05 17:40:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 17:40:28,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:28,821 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:28,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:40:28,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:28,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash 291030893, now seen corresponding path program 1 times [2025-02-05 17:40:28,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:28,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545844994] [2025-02-05 17:40:28,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:28,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:28,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:40:28,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:40:28,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:28,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:28,871 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:28,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:28,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545844994] [2025-02-05 17:40:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545844994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:28,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:28,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957213282] [2025-02-05 17:40:28,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:28,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:28,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:28,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:28,873 INFO L87 Difference]: Start difference. First operand 4359 states and 6551 transitions. Second operand has 3 states, 3 states have (on average 20.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:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:28,941 INFO L93 Difference]: Finished difference Result 6542 states and 9725 transitions. [2025-02-05 17:40:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:28,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.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:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:28,954 INFO L225 Difference]: With dead ends: 6542 [2025-02-05 17:40:28,955 INFO L226 Difference]: Without dead ends: 5355 [2025-02-05 17:40:28,958 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:28,959 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 1496 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 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:28,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 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:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5355 states. [2025-02-05 17:40:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5355 to 5353. [2025-02-05 17:40:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5353 states, 5351 states have (on average 1.4847692020183143) internal successors, (7945), 5352 states have internal predecessors, (7945), 0 states have call successors, (0), 0 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:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5353 states to 5353 states and 7945 transitions. [2025-02-05 17:40:29,082 INFO L78 Accepts]: Start accepts. Automaton has 5353 states and 7945 transitions. Word has length 60 [2025-02-05 17:40:29,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:29,082 INFO L471 AbstractCegarLoop]: Abstraction has 5353 states and 7945 transitions. [2025-02-05 17:40:29,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.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:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 5353 states and 7945 transitions. [2025-02-05 17:40:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:29,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:29,085 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:29,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:40:29,085 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:29,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1155468229, now seen corresponding path program 1 times [2025-02-05 17:40:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451912524] [2025-02-05 17:40:29,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:29,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:29,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:29,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:29,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:29,247 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:29,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:29,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451912524] [2025-02-05 17:40:29,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451912524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:29,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:29,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:29,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15084818] [2025-02-05 17:40:29,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:29,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:29,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:29,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:29,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:29,249 INFO L87 Difference]: Start difference. First operand 5353 states and 7945 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:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:29,713 INFO L93 Difference]: Finished difference Result 21301 states and 30607 transitions. [2025-02-05 17:40:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:29,714 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:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:29,757 INFO L225 Difference]: With dead ends: 21301 [2025-02-05 17:40:29,757 INFO L226 Difference]: Without dead ends: 18243 [2025-02-05 17:40:29,766 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:29,767 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 6332 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6332 SdHoareTripleChecker+Valid, 3636 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:29,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6332 Valid, 3636 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18243 states. [2025-02-05 17:40:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18243 to 8409. [2025-02-05 17:40:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8409 states, 8407 states have (on average 1.4570001189484953) internal successors, (12249), 8408 states have internal predecessors, (12249), 0 states have call successors, (0), 0 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:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8409 states to 8409 states and 12249 transitions. [2025-02-05 17:40:30,128 INFO L78 Accepts]: Start accepts. Automaton has 8409 states and 12249 transitions. Word has length 77 [2025-02-05 17:40:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:30,129 INFO L471 AbstractCegarLoop]: Abstraction has 8409 states and 12249 transitions. [2025-02-05 17:40:30,130 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:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 8409 states and 12249 transitions. [2025-02-05 17:40:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:30,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:30,133 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:30,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:40:30,133 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:30,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash 707522693, now seen corresponding path program 1 times [2025-02-05 17:40:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:30,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565672958] [2025-02-05 17:40:30,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:30,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:30,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:30,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:30,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:30,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:30,308 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:30,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:30,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565672958] [2025-02-05 17:40:30,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565672958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:30,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:30,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:30,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062479421] [2025-02-05 17:40:30,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:30,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:30,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:30,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:30,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:30,310 INFO L87 Difference]: Start difference. First operand 8409 states and 12249 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:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:30,725 INFO L93 Difference]: Finished difference Result 24357 states and 34911 transitions. [2025-02-05 17:40:30,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:30,725 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:30,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:30,776 INFO L225 Difference]: With dead ends: 24357 [2025-02-05 17:40:30,777 INFO L226 Difference]: Without dead ends: 21299 [2025-02-05 17:40:30,788 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:30,791 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 6357 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6357 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:30,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6357 Valid, 3567 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:30,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21299 states. [2025-02-05 17:40:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21299 to 13001. [2025-02-05 17:40:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13001 states, 12999 states have (on average 1.4358796830525424) internal successors, (18665), 13000 states have internal predecessors, (18665), 0 states have call successors, (0), 0 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:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13001 states to 13001 states and 18665 transitions. [2025-02-05 17:40:31,221 INFO L78 Accepts]: Start accepts. Automaton has 13001 states and 18665 transitions. Word has length 77 [2025-02-05 17:40:31,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:31,222 INFO L471 AbstractCegarLoop]: Abstraction has 13001 states and 18665 transitions. [2025-02-05 17:40:31,222 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:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 13001 states and 18665 transitions. [2025-02-05 17:40:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:31,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:31,225 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:31,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:40:31,225 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:31,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1122698565, now seen corresponding path program 1 times [2025-02-05 17:40:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:31,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829407826] [2025-02-05 17:40:31,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:31,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:31,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:31,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:31,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:31,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:31,391 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:31,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:31,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829407826] [2025-02-05 17:40:31,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829407826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:31,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:31,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:31,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311584307] [2025-02-05 17:40:31,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:31,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:31,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:31,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:31,393 INFO L87 Difference]: Start difference. First operand 13001 states and 18665 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:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:31,891 INFO L93 Difference]: Finished difference Result 27413 states and 39215 transitions. [2025-02-05 17:40:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:31,892 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:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:31,924 INFO L225 Difference]: With dead ends: 27413 [2025-02-05 17:40:31,924 INFO L226 Difference]: Without dead ends: 24355 [2025-02-05 17:40:31,934 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:31,935 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6398 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6398 SdHoareTripleChecker+Valid, 3559 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:31,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6398 Valid, 3559 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24355 states. [2025-02-05 17:40:32,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24355 to 16057. [2025-02-05 17:40:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16057 states, 16055 states have (on average 1.43064465898474) internal successors, (22969), 16056 states have internal predecessors, (22969), 0 states have call successors, (0), 0 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:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16057 states to 16057 states and 22969 transitions. [2025-02-05 17:40:32,348 INFO L78 Accepts]: Start accepts. Automaton has 16057 states and 22969 transitions. Word has length 77 [2025-02-05 17:40:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:32,348 INFO L471 AbstractCegarLoop]: Abstraction has 16057 states and 22969 transitions. [2025-02-05 17:40:32,349 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:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 16057 states and 22969 transitions. [2025-02-05 17:40:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:40:32,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:32,351 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:32,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:40:32,352 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:32,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:32,352 INFO L85 PathProgramCache]: Analyzing trace with hash 635980293, now seen corresponding path program 1 times [2025-02-05 17:40:32,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:32,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853581177] [2025-02-05 17:40:32,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:32,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:32,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:40:32,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:40:32,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:32,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:32,515 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:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:32,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853581177] [2025-02-05 17:40:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853581177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:32,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:32,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:32,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665564946] [2025-02-05 17:40:32,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:32,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:32,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:32,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:32,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:32,517 INFO L87 Difference]: Start difference. First operand 16057 states and 22969 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:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:33,081 INFO L93 Difference]: Finished difference Result 30469 states and 43519 transitions. [2025-02-05 17:40:33,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:33,082 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:33,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:33,143 INFO L225 Difference]: With dead ends: 30469 [2025-02-05 17:40:33,143 INFO L226 Difference]: Without dead ends: 27411 [2025-02-05 17:40:33,152 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:33,154 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 6347 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6347 SdHoareTripleChecker+Valid, 3621 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:33,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6347 Valid, 3621 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:33,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27411 states. [2025-02-05 17:40:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27411 to 19113. [2025-02-05 17:40:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19113 states, 19111 states have (on average 1.4270838783946418) internal successors, (27273), 19112 states have internal predecessors, (27273), 0 states have call successors, (0), 0 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,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19113 states to 19113 states and 27273 transitions. [2025-02-05 17:40:33,781 INFO L78 Accepts]: Start accepts. Automaton has 19113 states and 27273 transitions. Word has length 77 [2025-02-05 17:40:33,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:33,781 INFO L471 AbstractCegarLoop]: Abstraction has 19113 states and 27273 transitions. [2025-02-05 17:40:33,781 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:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 19113 states and 27273 transitions. [2025-02-05 17:40:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:40:33,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:33,785 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] [2025-02-05 17:40:33,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:40:33,786 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:33,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:33,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1791105029, now seen corresponding path program 1 times [2025-02-05 17:40:33,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:33,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760805833] [2025-02-05 17:40:33,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:33,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:33,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:40:33,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:40:33,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:33,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:33,973 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:33,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:33,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760805833] [2025-02-05 17:40:33,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760805833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:33,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:33,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:40:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183890471] [2025-02-05 17:40:33,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:33,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:40:33,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:33,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:40:33,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:40:33,976 INFO L87 Difference]: Start difference. First operand 19113 states and 27273 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:34,775 INFO L93 Difference]: Finished difference Result 31765 states and 45391 transitions. [2025-02-05 17:40:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:40:34,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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 79 [2025-02-05 17:40:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:34,835 INFO L225 Difference]: With dead ends: 31765 [2025-02-05 17:40:34,835 INFO L226 Difference]: Without dead ends: 29587 [2025-02-05 17:40:34,851 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:34,852 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 6326 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6326 SdHoareTripleChecker+Valid, 3734 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:34,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6326 Valid, 3734 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:40:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29587 states. [2025-02-05 17:40:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29587 to 21289. [2025-02-05 17:40:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21289 states, 21287 states have (on average 1.427021186639733) internal successors, (30377), 21288 states have internal predecessors, (30377), 0 states have call successors, (0), 0 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:35,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21289 states to 21289 states and 30377 transitions. [2025-02-05 17:40:35,571 INFO L78 Accepts]: Start accepts. Automaton has 21289 states and 30377 transitions. Word has length 79 [2025-02-05 17:40:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:35,571 INFO L471 AbstractCegarLoop]: Abstraction has 21289 states and 30377 transitions. [2025-02-05 17:40:35,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 21289 states and 30377 transitions. [2025-02-05 17:40:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:40:35,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:35,575 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:35,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:40:35,575 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:35,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash -838885117, now seen corresponding path program 1 times [2025-02-05 17:40:35,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337816318] [2025-02-05 17:40:35,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:35,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:40:35,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:40:35,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:35,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:35,664 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:35,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:35,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337816318] [2025-02-05 17:40:35,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337816318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:35,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:35,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:35,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492162713] [2025-02-05 17:40:35,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:35,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:35,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:35,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:35,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:35,666 INFO L87 Difference]: Start difference. First operand 21289 states and 30377 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:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:36,067 INFO L93 Difference]: Finished difference Result 35457 states and 50576 transitions. [2025-02-05 17:40:36,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:36,068 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:36,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:36,097 INFO L225 Difference]: With dead ends: 35457 [2025-02-05 17:40:36,098 INFO L226 Difference]: Without dead ends: 16463 [2025-02-05 17:40:36,117 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:36,118 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 50 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3117 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:36,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3117 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:36,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16463 states. [2025-02-05 17:40:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16463 to 16461. [2025-02-05 17:40:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16461 states, 16459 states have (on average 1.432711586366122) internal successors, (23581), 16460 states have internal predecessors, (23581), 0 states have call successors, (0), 0 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:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16461 states to 16461 states and 23581 transitions. [2025-02-05 17:40:36,497 INFO L78 Accepts]: Start accepts. Automaton has 16461 states and 23581 transitions. Word has length 79 [2025-02-05 17:40:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:36,498 INFO L471 AbstractCegarLoop]: Abstraction has 16461 states and 23581 transitions. [2025-02-05 17:40:36,498 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:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 16461 states and 23581 transitions. [2025-02-05 17:40:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:40:36,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:36,501 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, 1, 1] [2025-02-05 17:40:36,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:40:36,501 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:36,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:36,501 INFO L85 PathProgramCache]: Analyzing trace with hash 97319945, now seen corresponding path program 1 times [2025-02-05 17:40:36,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:36,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158836499] [2025-02-05 17:40:36,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:36,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:36,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:40:36,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:40:36,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:36,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:36,593 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:36,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:36,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158836499] [2025-02-05 17:40:36,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158836499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:36,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320078894] [2025-02-05 17:40:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:36,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:36,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:36,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:36,595 INFO L87 Difference]: Start difference. First operand 16461 states and 23581 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:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:36,763 INFO L93 Difference]: Finished difference Result 23537 states and 33567 transitions. [2025-02-05 17:40:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:36,764 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:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:36,787 INFO L225 Difference]: With dead ends: 23537 [2025-02-05 17:40:36,787 INFO L226 Difference]: Without dead ends: 9391 [2025-02-05 17:40:36,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:36,802 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 45 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3102 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:36,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3102 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:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9391 states. [2025-02-05 17:40:37,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9391 to 9389. [2025-02-05 17:40:37,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9389 states, 9387 states have (on average 1.4374134441248536) internal successors, (13493), 9388 states have internal predecessors, (13493), 0 states have call successors, (0), 0 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,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9389 states to 9389 states and 13493 transitions. [2025-02-05 17:40:37,080 INFO L78 Accepts]: Start accepts. Automaton has 9389 states and 13493 transitions. Word has length 80 [2025-02-05 17:40:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:37,081 INFO L471 AbstractCegarLoop]: Abstraction has 9389 states and 13493 transitions. [2025-02-05 17:40:37,082 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:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 9389 states and 13493 transitions. [2025-02-05 17:40:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 17:40:37,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:37,084 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:40:37,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:40:37,086 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:37,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash -755676880, now seen corresponding path program 1 times [2025-02-05 17:40:37,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:37,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795370087] [2025-02-05 17:40:37,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:37,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:37,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 17:40:37,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 17:40:37,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:37,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:37,186 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:37,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:37,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795370087] [2025-02-05 17:40:37,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795370087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:37,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:37,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:37,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629353499] [2025-02-05 17:40:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:37,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:37,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:37,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:37,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:37,188 INFO L87 Difference]: Start difference. First operand 9389 states and 13493 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:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:37,282 INFO L93 Difference]: Finished difference Result 12929 states and 18435 transitions. [2025-02-05 17:40:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:37,283 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:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:37,292 INFO L225 Difference]: With dead ends: 12929 [2025-02-05 17:40:37,292 INFO L226 Difference]: Without dead ends: 5855 [2025-02-05 17:40:37,300 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:37,300 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 42 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3087 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:37,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3087 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:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2025-02-05 17:40:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 5853. [2025-02-05 17:40:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 5851 states have (on average 1.4529140317894378) internal successors, (8501), 5852 states have internal predecessors, (8501), 0 states have call successors, (0), 0 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,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 8501 transitions. [2025-02-05 17:40:37,501 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 8501 transitions. Word has length 82 [2025-02-05 17:40:37,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:37,501 INFO L471 AbstractCegarLoop]: Abstraction has 5853 states and 8501 transitions. [2025-02-05 17:40:37,502 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:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 8501 transitions. [2025-02-05 17:40:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:40:37,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:37,503 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, 1, 1] [2025-02-05 17:40:37,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:40:37,504 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:37,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:37,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1816537225, now seen corresponding path program 1 times [2025-02-05 17:40:37,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:37,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32449695] [2025-02-05 17:40:37,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:37,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:37,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:40:37,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:40:37,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:37,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:37,592 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:37,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:37,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32449695] [2025-02-05 17:40:37,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32449695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:37,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:37,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:37,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697954449] [2025-02-05 17:40:37,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:37,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:37,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:37,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:37,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:37,596 INFO L87 Difference]: Start difference. First operand 5853 states and 8501 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:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:37,653 INFO L93 Difference]: Finished difference Result 7625 states and 10947 transitions. [2025-02-05 17:40:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:37,654 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:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:37,660 INFO L225 Difference]: With dead ends: 7625 [2025-02-05 17:40:37,660 INFO L226 Difference]: Without dead ends: 4087 [2025-02-05 17:40:37,666 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:37,667 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 39 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3072 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:37,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3072 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:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2025-02-05 17:40:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 4085. [2025-02-05 17:40:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4085 states, 4083 states have (on average 1.4771001714425667) internal successors, (6031), 4084 states have internal predecessors, (6031), 0 states have call successors, (0), 0 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,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 6031 transitions. [2025-02-05 17:40:37,738 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 6031 transitions. Word has length 84 [2025-02-05 17:40:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:37,740 INFO L471 AbstractCegarLoop]: Abstraction has 4085 states and 6031 transitions. [2025-02-05 17:40:37,740 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:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 6031 transitions. [2025-02-05 17:40:37,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 17:40:37,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:37,742 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, 1, 1] [2025-02-05 17:40:37,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:40:37,742 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:37,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:37,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1212344610, now seen corresponding path program 1 times [2025-02-05 17:40:37,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:37,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182054406] [2025-02-05 17:40:37,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:37,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:37,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 17:40:37,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 17:40:37,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:37,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:37,828 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:37,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:37,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182054406] [2025-02-05 17:40:37,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182054406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:40:37,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:40:37,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:40:37,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600311300] [2025-02-05 17:40:37,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:40:37,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:40:37,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:37,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:40:37,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:40:37,830 INFO L87 Difference]: Start difference. First operand 4085 states and 6031 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 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,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:37,870 INFO L93 Difference]: Finished difference Result 4973 states and 7242 transitions. [2025-02-05 17:40:37,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:40:37,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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:37,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:37,878 INFO L225 Difference]: With dead ends: 4973 [2025-02-05 17:40:37,879 INFO L226 Difference]: Without dead ends: 3203 [2025-02-05 17:40:37,881 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:37,883 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 36 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3057 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:37,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3057 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:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2025-02-05 17:40:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 3201. [2025-02-05 17:40:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3199 states have (on average 1.5032822757111597) internal successors, (4809), 3200 states have internal predecessors, (4809), 0 states have call successors, (0), 0 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,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4809 transitions. [2025-02-05 17:40:37,935 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4809 transitions. Word has length 86 [2025-02-05 17:40:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:37,935 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 4809 transitions. [2025-02-05 17:40:37,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 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,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4809 transitions. [2025-02-05 17:40:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 17:40:37,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:37,936 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, 1, 1] [2025-02-05 17:40:37,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:40:37,937 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:37,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash -705464475, now seen corresponding path program 1 times [2025-02-05 17:40:37,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:37,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315268621] [2025-02-05 17:40:37,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:37,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 17:40:37,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 17:40:37,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:37,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:40:38,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:38,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315268621] [2025-02-05 17:40:38,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315268621] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:40:38,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115258414] [2025-02-05 17:40:38,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:38,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:40:38,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:38,358 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:38,360 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:38,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 17:40:38,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 17:40:38,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:38,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:38,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 17:40:38,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:40:38,881 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:38,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:40:39,240 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:39,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115258414] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:40:39,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:40:39,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 19 [2025-02-05 17:40:39,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790770623] [2025-02-05 17:40:39,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:40:39,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 17:40:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:39,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 17:40:39,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-02-05 17:40:39,243 INFO L87 Difference]: Start difference. First operand 3201 states and 4809 transitions. Second operand has 19 states, 19 states have (on average 13.210526315789474) internal successors, (251), 19 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:42,337 INFO L93 Difference]: Finished difference Result 10251 states and 14126 transitions. [2025-02-05 17:40:42,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-05 17:40:42,337 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.210526315789474) internal successors, (251), 19 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-02-05 17:40:42,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:42,349 INFO L225 Difference]: With dead ends: 10251 [2025-02-05 17:40:42,350 INFO L226 Difference]: Without dead ends: 9279 [2025-02-05 17:40:42,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=913, Invalid=3509, Unknown=0, NotChecked=0, Total=4422 [2025-02-05 17:40:42,353 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 13289 mSDsluCounter, 8350 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13289 SdHoareTripleChecker+Valid, 9908 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:42,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13289 Valid, 9908 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 17:40:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9279 states. [2025-02-05 17:40:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9279 to 8669. [2025-02-05 17:40:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8669 states, 8667 states have (on average 1.374177916233991) internal successors, (11910), 8668 states have internal predecessors, (11910), 0 states have call successors, (0), 0 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:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8669 states to 8669 states and 11910 transitions. [2025-02-05 17:40:42,578 INFO L78 Accepts]: Start accepts. Automaton has 8669 states and 11910 transitions. Word has length 88 [2025-02-05 17:40:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:42,578 INFO L471 AbstractCegarLoop]: Abstraction has 8669 states and 11910 transitions. [2025-02-05 17:40:42,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.210526315789474) internal successors, (251), 19 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:40:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 8669 states and 11910 transitions. [2025-02-05 17:40:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 17:40:42,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:42,580 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:42,589 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:42,781 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:42,781 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:42,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1536780076, now seen corresponding path program 1 times [2025-02-05 17:40:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:42,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15011265] [2025-02-05 17:40:42,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:42,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:40:42,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:40:42,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:42,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:43,181 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:43,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:43,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15011265] [2025-02-05 17:40:43,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15011265] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:40:43,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929458680] [2025-02-05 17:40:43,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:43,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:40:43,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:43,185 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:43,186 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:43,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:40:43,314 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,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:43,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:43,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 17:40:43,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:40:44,021 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:44,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:40:45,086 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:45,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929458680] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:40:45,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:40:45,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-02-05 17:40:45,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021995750] [2025-02-05 17:40:45,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:40:45,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 17:40:45,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:45,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 17:40:45,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2025-02-05 17:40:45,088 INFO L87 Difference]: Start difference. First operand 8669 states and 11910 transitions. Second operand has 32 states, 32 states have (on average 6.84375) internal successors, (219), 32 states have internal predecessors, (219), 0 states have call successors, (0), 0 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:46,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:46,888 INFO L93 Difference]: Finished difference Result 19151 states and 25608 transitions. [2025-02-05 17:40:46,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 17:40:46,888 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.84375) internal successors, (219), 32 states have internal predecessors, (219), 0 states have call successors, (0), 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 89 [2025-02-05 17:40:46,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:46,901 INFO L225 Difference]: With dead ends: 19151 [2025-02-05 17:40:46,901 INFO L226 Difference]: Without dead ends: 12833 [2025-02-05 17:40:46,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=608, Invalid=2698, Unknown=0, NotChecked=0, Total=3306 [2025-02-05 17:40:46,908 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 19391 mSDsluCounter, 18370 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19391 SdHoareTripleChecker+Valid, 19874 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:46,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19391 Valid, 19874 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:40:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12833 states. [2025-02-05 17:40:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12833 to 11243. [2025-02-05 17:40:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11243 states, 11241 states have (on average 1.3460546214749578) internal successors, (15131), 11242 states have internal predecessors, (15131), 0 states have call successors, (0), 0 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:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11243 states to 11243 states and 15131 transitions. [2025-02-05 17:40:47,168 INFO L78 Accepts]: Start accepts. Automaton has 11243 states and 15131 transitions. Word has length 89 [2025-02-05 17:40:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:47,169 INFO L471 AbstractCegarLoop]: Abstraction has 11243 states and 15131 transitions. [2025-02-05 17:40:47,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.84375) internal successors, (219), 32 states have internal predecessors, (219), 0 states have call successors, (0), 0 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:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 11243 states and 15131 transitions. [2025-02-05 17:40:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:40:47,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:47,170 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, 1] [2025-02-05 17:40:47,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 17:40:47,370 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:47,370 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:47,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:47,371 INFO L85 PathProgramCache]: Analyzing trace with hash 196015673, now seen corresponding path program 1 times [2025-02-05 17:40:47,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:47,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444796670] [2025-02-05 17:40:47,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:47,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:47,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:40:47,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:40:47,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:47,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:47,698 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:47,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:47,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444796670] [2025-02-05 17:40:47,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444796670] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:40:47,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527882262] [2025-02-05 17:40:47,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:47,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:40:47,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:47,702 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:47,705 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:47,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:40:47,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:40:47,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:47,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:47,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 17:40:47,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:40:48,686 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:48,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:40:49,704 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:49,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527882262] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:40:49,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:40:49,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-02-05 17:40:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023166285] [2025-02-05 17:40:49,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:40:49,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 17:40:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:49,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 17:40:49,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-02-05 17:40:49,707 INFO L87 Difference]: Start difference. First operand 11243 states and 15131 transitions. Second operand has 29 states, 29 states have (on average 8.344827586206897) internal successors, (242), 29 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:50,876 INFO L93 Difference]: Finished difference Result 29719 states and 39105 transitions. [2025-02-05 17:40:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 17:40:50,876 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.344827586206897) internal successors, (242), 29 states have internal predecessors, (242), 0 states have call successors, (0), 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 90 [2025-02-05 17:40:50,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:50,897 INFO L225 Difference]: With dead ends: 29719 [2025-02-05 17:40:50,897 INFO L226 Difference]: Without dead ends: 20845 [2025-02-05 17:40:50,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=1455, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 17:40:50,906 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 19520 mSDsluCounter, 7872 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19520 SdHoareTripleChecker+Valid, 9385 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:50,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19520 Valid, 9385 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:40:50,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20845 states. [2025-02-05 17:40:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20845 to 20603. [2025-02-05 17:40:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20603 states, 20601 states have (on average 1.307557885539537) internal successors, (26937), 20602 states have internal predecessors, (26937), 0 states have call successors, (0), 0 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:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20603 states to 20603 states and 26937 transitions. [2025-02-05 17:40:51,562 INFO L78 Accepts]: Start accepts. Automaton has 20603 states and 26937 transitions. Word has length 90 [2025-02-05 17:40:51,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:51,562 INFO L471 AbstractCegarLoop]: Abstraction has 20603 states and 26937 transitions. [2025-02-05 17:40:51,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.344827586206897) internal successors, (242), 29 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 20603 states and 26937 transitions. [2025-02-05 17:40:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:40:51,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:51,563 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, 1] [2025-02-05 17:40:51,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 17:40:51,764 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:51,764 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:51,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash 773681241, now seen corresponding path program 1 times [2025-02-05 17:40:51,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:51,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965003338] [2025-02-05 17:40:51,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:51,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:51,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:40:51,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:40:51,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:51,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:52,063 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:52,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:40:52,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965003338] [2025-02-05 17:40:52,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965003338] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:40:52,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823610469] [2025-02-05 17:40:52,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:52,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:40:52,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:40:52,066 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:52,068 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:52,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:40:52,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:40:52,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:52,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:40:52,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:40:52,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:40:52,653 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:52,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:40:53,469 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:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823610469] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:40:53,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:40:53,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-02-05 17:40:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429075855] [2025-02-05 17:40:53,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:40:53,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 17:40:53,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:40:53,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 17:40:53,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-02-05 17:40:53,473 INFO L87 Difference]: Start difference. First operand 20603 states and 26937 transitions. Second operand has 25 states, 25 states have (on average 10.16) internal successors, (254), 24 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:40:56,891 INFO L93 Difference]: Finished difference Result 98133 states and 126399 transitions. [2025-02-05 17:40:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-05 17:40:56,892 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.16) internal successors, (254), 24 states have internal predecessors, (254), 0 states have call successors, (0), 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 90 [2025-02-05 17:40:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:40:56,971 INFO L225 Difference]: With dead ends: 98133 [2025-02-05 17:40:56,971 INFO L226 Difference]: Without dead ends: 80045 [2025-02-05 17:40:56,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=551, Invalid=2205, Unknown=0, NotChecked=0, Total=2756 [2025-02-05 17:40:56,986 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 17008 mSDsluCounter, 7266 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17008 SdHoareTripleChecker+Valid, 8815 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:40:56,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17008 Valid, 8815 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:40:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80045 states. [2025-02-05 17:40:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80045 to 79041. [2025-02-05 17:40:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79041 states, 79039 states have (on average 1.2575310922456002) internal successors, (99394), 79040 states have internal predecessors, (99394), 0 states have call successors, (0), 0 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:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79041 states to 79041 states and 99394 transitions. [2025-02-05 17:40:59,653 INFO L78 Accepts]: Start accepts. Automaton has 79041 states and 99394 transitions. Word has length 90 [2025-02-05 17:40:59,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:40:59,653 INFO L471 AbstractCegarLoop]: Abstraction has 79041 states and 99394 transitions. [2025-02-05 17:40:59,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.16) internal successors, (254), 24 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 79041 states and 99394 transitions. [2025-02-05 17:40:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 17:40:59,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:40:59,656 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, 1, 1, 1] [2025-02-05 17:40:59,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 17:40:59,857 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:59,857 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:40:59,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:40:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1009779006, now seen corresponding path program 1 times [2025-02-05 17:40:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:40:59,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987117647] [2025-02-05 17:40:59,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:40:59,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:40:59,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:40:59,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:40:59,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:40:59,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:00,911 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:41:00,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:41:00,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987117647] [2025-02-05 17:41:00,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987117647] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:41:00,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178232137] [2025-02-05 17:41:00,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:00,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:41:00,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:41:00,915 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:41:00,917 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:41:01,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:41:01,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:41:01,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:01,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:01,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 17:41:01,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:41:01,851 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:41:01,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:41:03,025 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:41:03,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178232137] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:41:03,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:41:03,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2025-02-05 17:41:03,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025902664] [2025-02-05 17:41:03,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:41:03,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 17:41:03,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:41:03,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 17:41:03,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2025-02-05 17:41:03,027 INFO L87 Difference]: Start difference. First operand 79041 states and 99394 transitions. Second operand has 30 states, 30 states have (on average 7.1) internal successors, (213), 30 states have internal predecessors, (213), 0 states have call successors, (0), 0 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:41:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:41:07,020 INFO L93 Difference]: Finished difference Result 135365 states and 169265 transitions. [2025-02-05 17:41:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 17:41:07,020 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.1) internal successors, (213), 30 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 17:41:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:41:07,129 INFO L225 Difference]: With dead ends: 135365 [2025-02-05 17:41:07,130 INFO L226 Difference]: Without dead ends: 110779 [2025-02-05 17:41:07,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=453, Invalid=1803, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 17:41:07,152 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 12922 mSDsluCounter, 14040 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12922 SdHoareTripleChecker+Valid, 15566 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:41:07,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12922 Valid, 15566 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:41:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110779 states. [2025-02-05 17:41:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110779 to 73517. [2025-02-05 17:41:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73517 states, 73515 states have (on average 1.2561246004216826) internal successors, (92344), 73516 states have internal predecessors, (92344), 0 states have call successors, (0), 0 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:41:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73517 states to 73517 states and 92344 transitions. [2025-02-05 17:41:09,983 INFO L78 Accepts]: Start accepts. Automaton has 73517 states and 92344 transitions. Word has length 92 [2025-02-05 17:41:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:41:09,983 INFO L471 AbstractCegarLoop]: Abstraction has 73517 states and 92344 transitions. [2025-02-05 17:41:09,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.1) internal successors, (213), 30 states have internal predecessors, (213), 0 states have call successors, (0), 0 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:41:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 73517 states and 92344 transitions. [2025-02-05 17:41:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 17:41:09,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:41:09,986 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, 1, 1, 1] [2025-02-05 17:41:09,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 17:41:10,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 17:41:10,187 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:41:10,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:41:10,187 INFO L85 PathProgramCache]: Analyzing trace with hash -201120643, now seen corresponding path program 1 times [2025-02-05 17:41:10,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:41:10,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491482887] [2025-02-05 17:41:10,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:10,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:41:10,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:41:10,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:41:10,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:10,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:11,138 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:41:11,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:41:11,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491482887] [2025-02-05 17:41:11,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491482887] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:41:11,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342979379] [2025-02-05 17:41:11,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:41:11,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:41:11,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:41:11,142 INFO L229 MonitoredProcess]: Starting monitored process 7 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:41:11,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 17:41:11,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:41:11,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:41:11,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:41:11,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:41:11,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-05 17:41:11,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:41:16,072 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:41:16,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:41:21,401 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:41:21,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342979379] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:41:21,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:41:21,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 32, 26] total 64 [2025-02-05 17:41:21,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194943361] [2025-02-05 17:41:21,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:41:21,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-02-05 17:41:21,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:41:21,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-02-05 17:41:21,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=3554, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 17:41:21,404 INFO L87 Difference]: Start difference. First operand 73517 states and 92344 transitions. Second operand has 64 states, 64 states have (on average 3.96875) internal successors, (254), 64 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)