./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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.ufo.UNBOUNDED.pals+Problem12_label09.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 0bbf22098def83a979a93dd8fa66adb7d528ee9621686d1c01784de1384e9197 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:52:05,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:52:05,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:52:05,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:52:05,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:52:05,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:52:05,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:52:05,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:52:05,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:52:05,916 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:52:05,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:52:05,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:52:05,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:52:05,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:52:05,917 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:52:05,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:52:05,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:52:05,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:52:05,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:52:05,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:52:05,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:52:05,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:52:05,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:52:05,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:52:05,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:52:05,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:52:05,919 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:52:05,919 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:52:05,919 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:52:05,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:52:05,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:52:05,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:52:05,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:52:05,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:52:05,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:52:05,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:52:05,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:52:05,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:52:05,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:52:05,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:52:05,920 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:52:05,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:52:05,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:52:05,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:52:05,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:52:05,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:52:05,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:52:05,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:52:05,921 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 -> 0bbf22098def83a979a93dd8fa66adb7d528ee9621686d1c01784de1384e9197 [2025-01-09 05:52:06,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:52:06,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:52:06,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:52:06,184 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:52:06,184 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:52:06,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-01-09 05:52:07,429 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66a0cb371/709397175af04a21b7c8a2df0af31a48/FLAG5e16b806f [2025-01-09 05:52:07,940 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:52:07,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-01-09 05:52:07,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66a0cb371/709397175af04a21b7c8a2df0af31a48/FLAG5e16b806f [2025-01-09 05:52:07,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66a0cb371/709397175af04a21b7c8a2df0af31a48 [2025-01-09 05:52:07,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:52:07,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:52:07,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:52:07,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:52:07,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:52:07,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:52:07" (1/1) ... [2025-01-09 05:52:08,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337d037e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:07, skipping insertion in model container [2025-01-09 05:52:08,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:52:07" (1/1) ... [2025-01-09 05:52:08,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:52:08,428 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.ufo.UNBOUNDED.pals+Problem12_label09.c[11668,11681] [2025-01-09 05:52:08,490 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.ufo.UNBOUNDED.pals+Problem12_label09.c[19416,19429] [2025-01-09 05:52:08,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:52:08,990 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:52:09,013 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.ufo.UNBOUNDED.pals+Problem12_label09.c[11668,11681] [2025-01-09 05:52:09,021 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.ufo.UNBOUNDED.pals+Problem12_label09.c[19416,19429] [2025-01-09 05:52:09,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:52:09,311 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:52:09,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09 WrapperNode [2025-01-09 05:52:09,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:52:09,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:52:09,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:52:09,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:52:09,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:09,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:09,653 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5091 [2025-01-09 05:52:09,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:52:09,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:52:09,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:52:09,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:52:09,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:09,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:09,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:09,923 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-01-09 05:52:09,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:09,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:10,040 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:10,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:10,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:10,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:10,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:10,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:52:10,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:52:10,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:52:10,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:52:10,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (1/1) ... [2025-01-09 05:52:10,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:52:10,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:52:10,249 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-01-09 05:52:10,261 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-01-09 05:52:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:52:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:52:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:52:10,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:52:10,390 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:52:10,391 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:52:14,184 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-01-09 05:52:14,184 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:52:14,208 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:52:14,208 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:52:14,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:52:14 BoogieIcfgContainer [2025-01-09 05:52:14,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:52:14,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:52:14,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:52:14,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:52:14,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:52:07" (1/3) ... [2025-01-09 05:52:14,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e09125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:52:14, skipping insertion in model container [2025-01-09 05:52:14,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:52:09" (2/3) ... [2025-01-09 05:52:14,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e09125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:52:14, skipping insertion in model container [2025-01-09 05:52:14,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:52:14" (3/3) ... [2025-01-09 05:52:14,221 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-01-09 05:52:14,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:52:14,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label09.c that has 1 procedures, 900 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:52:14,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:52:14,295 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;@3008ccf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:52:14,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:52:14,301 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-01-09 05:52:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 05:52:14,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:14,306 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-01-09 05:52:14,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:14,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:14,315 INFO L85 PathProgramCache]: Analyzing trace with hash 147233052, now seen corresponding path program 1 times [2025-01-09 05:52:14,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:14,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661160916] [2025-01-09 05:52:14,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:14,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:14,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 05:52:14,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 05:52:14,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:14,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:14,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:14,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661160916] [2025-01-09 05:52:14,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661160916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:14,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:14,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:52:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637774023] [2025-01-09 05:52:14,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:14,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:52:14,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:14,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:52:14,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:52:14,530 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-01-09 05:52:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:14,603 INFO L93 Difference]: Finished difference Result 1762 states and 3343 transitions. [2025-01-09 05:52:14,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:52:14,607 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-01-09 05:52:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:14,616 INFO L225 Difference]: With dead ends: 1762 [2025-01-09 05:52:14,617 INFO L226 Difference]: Without dead ends: 835 [2025-01-09 05:52:14,621 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-01-09 05:52:14,624 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-01-09 05:52:14,625 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-01-09 05:52:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-01-09 05:52:14,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-01-09 05:52:14,678 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-01-09 05:52:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1577 transitions. [2025-01-09 05:52:14,683 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1577 transitions. Word has length 24 [2025-01-09 05:52:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:14,684 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1577 transitions. [2025-01-09 05:52:14,684 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-01-09 05:52:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1577 transitions. [2025-01-09 05:52:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 05:52:14,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:14,685 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-01-09 05:52:14,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:52:14,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:14,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1846911654, now seen corresponding path program 1 times [2025-01-09 05:52:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:14,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033485634] [2025-01-09 05:52:14,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:14,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:14,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 05:52:14,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 05:52:14,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:14,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:14,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:14,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033485634] [2025-01-09 05:52:14,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033485634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:14,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:14,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:52:14,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084189802] [2025-01-09 05:52:14,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:14,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:52:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:14,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:52:14,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:52:14,898 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-01-09 05:52:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:15,088 INFO L93 Difference]: Finished difference Result 883 states and 1651 transitions. [2025-01-09 05:52:15,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:52:15,088 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-01-09 05:52:15,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:15,091 INFO L225 Difference]: With dead ends: 883 [2025-01-09 05:52:15,091 INFO L226 Difference]: Without dead ends: 835 [2025-01-09 05:52:15,092 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-01-09 05:52:15,092 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-01-09 05:52:15,093 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-01-09 05:52:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-01-09 05:52:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-01-09 05:52:15,106 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-01-09 05:52:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1546 transitions. [2025-01-09 05:52:15,108 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1546 transitions. Word has length 24 [2025-01-09 05:52:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:15,109 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1546 transitions. [2025-01-09 05:52:15,109 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-01-09 05:52:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1546 transitions. [2025-01-09 05:52:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:52:15,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:15,110 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-01-09 05:52:15,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:52:15,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:15,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash 427928945, now seen corresponding path program 1 times [2025-01-09 05:52:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370564156] [2025-01-09 05:52:15,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:15,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:52:15,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:52:15,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:15,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:15,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:15,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370564156] [2025-01-09 05:52:15,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370564156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:15,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:15,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:52:15,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414287623] [2025-01-09 05:52:15,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:15,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:52:15,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:15,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:52:15,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:52:15,268 INFO L87 Difference]: Start difference. First operand 835 states and 1546 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-01-09 05:52:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:15,514 INFO L93 Difference]: Finished difference Result 1275 states and 2246 transitions. [2025-01-09 05:52:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 05:52:15,515 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-01-09 05:52:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:15,519 INFO L225 Difference]: With dead ends: 1275 [2025-01-09 05:52:15,519 INFO L226 Difference]: Without dead ends: 1231 [2025-01-09 05:52:15,519 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-01-09 05:52:15,520 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-01-09 05:52:15,520 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-01-09 05:52:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-01-09 05:52:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 877. [2025-01-09 05:52:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 875 states have (on average 1.8434285714285714) internal successors, (1613), 876 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1613 transitions. [2025-01-09 05:52:15,538 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1613 transitions. Word has length 54 [2025-01-09 05:52:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:15,538 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1613 transitions. [2025-01-09 05:52:15,538 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-01-09 05:52:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1613 transitions. [2025-01-09 05:52:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:52:15,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:15,539 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-01-09 05:52:15,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:52:15,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:15,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:15,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1802126305, now seen corresponding path program 1 times [2025-01-09 05:52:15,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:15,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543347739] [2025-01-09 05:52:15,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:15,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:15,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:52:15,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:52:15,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:15,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:15,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:15,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543347739] [2025-01-09 05:52:15,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543347739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:15,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:15,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:52:15,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203111082] [2025-01-09 05:52:15,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:15,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:52:15,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:15,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:52:15,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:15,611 INFO L87 Difference]: Start difference. First operand 877 states and 1613 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-01-09 05:52:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:15,640 INFO L93 Difference]: Finished difference Result 1038 states and 1868 transitions. [2025-01-09 05:52:15,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:52:15,640 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-01-09 05:52:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:15,644 INFO L225 Difference]: With dead ends: 1038 [2025-01-09 05:52:15,644 INFO L226 Difference]: Without dead ends: 952 [2025-01-09 05:52:15,645 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-01-09 05:52:15,645 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-01-09 05:52:15,645 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-01-09 05:52:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-01-09 05:52:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 948. [2025-01-09 05:52:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1723 transitions. [2025-01-09 05:52:15,663 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1723 transitions. Word has length 56 [2025-01-09 05:52:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:15,663 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1723 transitions. [2025-01-09 05:52:15,664 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-01-09 05:52:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1723 transitions. [2025-01-09 05:52:15,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:52:15,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:15,665 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-01-09 05:52:15,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:52:15,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:15,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:15,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1868619817, now seen corresponding path program 1 times [2025-01-09 05:52:15,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:15,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080259987] [2025-01-09 05:52:15,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:15,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:15,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:52:15,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:52:15,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:15,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:15,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:15,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080259987] [2025-01-09 05:52:15,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080259987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:15,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:15,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:52:15,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327324671] [2025-01-09 05:52:15,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:15,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:52:15,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:15,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:52:15,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:52:15,901 INFO L87 Difference]: Start difference. First operand 948 states and 1723 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-01-09 05:52:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:16,047 INFO L93 Difference]: Finished difference Result 1107 states and 1971 transitions. [2025-01-09 05:52:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:52:16,048 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-01-09 05:52:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:16,051 INFO L225 Difference]: With dead ends: 1107 [2025-01-09 05:52:16,051 INFO L226 Difference]: Without dead ends: 950 [2025-01-09 05:52:16,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:52:16,053 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 5976 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5976 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:52:16,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5976 Valid, 1804 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:52:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-01-09 05:52:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 948. [2025-01-09 05:52:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1721 transitions. [2025-01-09 05:52:16,071 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1721 transitions. Word has length 56 [2025-01-09 05:52:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:16,071 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1721 transitions. [2025-01-09 05:52:16,072 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-01-09 05:52:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1721 transitions. [2025-01-09 05:52:16,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 05:52:16,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:16,073 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-01-09 05:52:16,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:52:16,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:16,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:16,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1677916402, now seen corresponding path program 1 times [2025-01-09 05:52:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:16,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426863088] [2025-01-09 05:52:16,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:16,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 05:52:16,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 05:52:16,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:16,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:16,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:16,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426863088] [2025-01-09 05:52:16,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426863088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:16,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:16,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:52:16,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959707249] [2025-01-09 05:52:16,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:16,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:52:16,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:16,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:52:16,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:52:16,352 INFO L87 Difference]: Start difference. First operand 948 states and 1721 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-01-09 05:52:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:16,415 INFO L93 Difference]: Finished difference Result 956 states and 1730 transitions. [2025-01-09 05:52:16,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:52:16,415 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-01-09 05:52:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:16,419 INFO L225 Difference]: With dead ends: 956 [2025-01-09 05:52:16,419 INFO L226 Difference]: Without dead ends: 954 [2025-01-09 05:52:16,420 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-01-09 05:52:16,420 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-01-09 05:52:16,421 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-01-09 05:52:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-01-09 05:52:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2025-01-09 05:52:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 952 states have (on average 1.8130252100840336) internal successors, (1726), 953 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1726 transitions. [2025-01-09 05:52:16,439 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1726 transitions. Word has length 57 [2025-01-09 05:52:16,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:16,439 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1726 transitions. [2025-01-09 05:52:16,439 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-01-09 05:52:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1726 transitions. [2025-01-09 05:52:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:52:16,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:16,440 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-01-09 05:52:16,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:52:16,440 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:16,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:16,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1113103913, now seen corresponding path program 1 times [2025-01-09 05:52:16,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:16,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284635920] [2025-01-09 05:52:16,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:16,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:16,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:52:16,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:52:16,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:16,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:16,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:16,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284635920] [2025-01-09 05:52:16,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284635920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:16,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:16,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:52:16,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585082831] [2025-01-09 05:52:16,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:16,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:52:16,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:16,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:52:16,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:16,486 INFO L87 Difference]: Start difference. First operand 954 states and 1726 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-01-09 05:52:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:16,507 INFO L93 Difference]: Finished difference Result 1264 states and 2198 transitions. [2025-01-09 05:52:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:52:16,507 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-01-09 05:52:16,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:16,511 INFO L225 Difference]: With dead ends: 1264 [2025-01-09 05:52:16,511 INFO L226 Difference]: Without dead ends: 1101 [2025-01-09 05:52:16,512 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-01-09 05:52:16,512 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-01-09 05:52:16,512 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-01-09 05:52:16,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-01-09 05:52:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1099. [2025-01-09 05:52:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1097 states have (on average 1.7711941659070192) internal successors, (1943), 1098 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1943 transitions. [2025-01-09 05:52:16,533 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1943 transitions. Word has length 58 [2025-01-09 05:52:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:16,533 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1943 transitions. [2025-01-09 05:52:16,533 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-01-09 05:52:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1943 transitions. [2025-01-09 05:52:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:52:16,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:16,538 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-01-09 05:52:16,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:52:16,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1943601367, now seen corresponding path program 1 times [2025-01-09 05:52:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:16,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337348628] [2025-01-09 05:52:16,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:16,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:52:16,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:52:16,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:16,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:16,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:16,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337348628] [2025-01-09 05:52:16,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337348628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:16,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:16,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:52:16,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888422353] [2025-01-09 05:52:16,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:16,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:52:16,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:16,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:52:16,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:16,584 INFO L87 Difference]: Start difference. First operand 1099 states and 1943 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-01-09 05:52:16,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:16,605 INFO L93 Difference]: Finished difference Result 1683 states and 2821 transitions. [2025-01-09 05:52:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:52:16,606 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-01-09 05:52:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:16,610 INFO L225 Difference]: With dead ends: 1683 [2025-01-09 05:52:16,610 INFO L226 Difference]: Without dead ends: 1375 [2025-01-09 05:52:16,611 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-01-09 05:52:16,611 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-01-09 05:52:16,611 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-01-09 05:52:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-01-09 05:52:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1373. [2025-01-09 05:52:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1371 states have (on average 1.7104303428154632) internal successors, (2345), 1372 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:16,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2345 transitions. [2025-01-09 05:52:16,635 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2345 transitions. Word has length 58 [2025-01-09 05:52:16,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:16,635 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 2345 transitions. [2025-01-09 05:52:16,635 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-01-09 05:52:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2345 transitions. [2025-01-09 05:52:16,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:52:16,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:16,636 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-01-09 05:52:16,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:52:16,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:16,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash 135897129, now seen corresponding path program 1 times [2025-01-09 05:52:16,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:16,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639416416] [2025-01-09 05:52:16,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:16,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:16,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:52:16,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:52:16,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:16,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:16,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:16,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639416416] [2025-01-09 05:52:16,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639416416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:16,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:16,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:52:16,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389964181] [2025-01-09 05:52:16,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:16,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:52:16,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:16,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:52:16,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:16,675 INFO L87 Difference]: Start difference. First operand 1373 states and 2345 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-01-09 05:52:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:16,730 INFO L93 Difference]: Finished difference Result 2473 states and 3971 transitions. [2025-01-09 05:52:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:52:16,731 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-01-09 05:52:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:16,736 INFO L225 Difference]: With dead ends: 2473 [2025-01-09 05:52:16,736 INFO L226 Difference]: Without dead ends: 1891 [2025-01-09 05:52:16,737 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-01-09 05:52:16,737 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-01-09 05:52:16,738 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-01-09 05:52:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2025-01-09 05:52:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1889. [2025-01-09 05:52:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1887 states have (on average 1.634870164281929) internal successors, (3085), 1888 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 3085 transitions. [2025-01-09 05:52:16,767 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 3085 transitions. Word has length 58 [2025-01-09 05:52:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:16,767 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 3085 transitions. [2025-01-09 05:52:16,768 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-01-09 05:52:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 3085 transitions. [2025-01-09 05:52:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:52:16,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:16,768 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-01-09 05:52:16,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:52:16,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:16,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1916829993, now seen corresponding path program 1 times [2025-01-09 05:52:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:16,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190443185] [2025-01-09 05:52:16,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:16,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:16,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:52:16,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:52:16,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:16,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:16,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:16,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190443185] [2025-01-09 05:52:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190443185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:16,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:52:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241668741] [2025-01-09 05:52:16,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:16,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:52:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:16,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:52:16,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:16,807 INFO L87 Difference]: Start difference. First operand 1889 states and 3085 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-01-09 05:52:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:16,845 INFO L93 Difference]: Finished difference Result 3957 states and 6079 transitions. [2025-01-09 05:52:16,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:52:16,845 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-01-09 05:52:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:16,853 INFO L225 Difference]: With dead ends: 3957 [2025-01-09 05:52:16,853 INFO L226 Difference]: Without dead ends: 2859 [2025-01-09 05:52:16,855 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-01-09 05:52:16,855 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-01-09 05:52:16,855 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-01-09 05:52:16,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2025-01-09 05:52:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2025-01-09 05:52:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2855 states have (on average 1.5541155866900176) internal successors, (4437), 2856 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4437 transitions. [2025-01-09 05:52:16,910 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4437 transitions. Word has length 58 [2025-01-09 05:52:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:16,910 INFO L471 AbstractCegarLoop]: Abstraction has 2857 states and 4437 transitions. [2025-01-09 05:52:16,910 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-01-09 05:52:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4437 transitions. [2025-01-09 05:52:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 05:52:16,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:16,911 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-01-09 05:52:16,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:52:16,911 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:16,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash -275603324, now seen corresponding path program 1 times [2025-01-09 05:52:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:16,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337534881] [2025-01-09 05:52:16,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:16,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:52:16,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:52:16,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:16,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:16,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337534881] [2025-01-09 05:52:16,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337534881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:16,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:16,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:52:16,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622174806] [2025-01-09 05:52:16,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:16,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:52:16,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:16,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:52:16,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:16,947 INFO L87 Difference]: Start difference. First operand 2857 states and 4437 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-01-09 05:52:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:16,989 INFO L93 Difference]: Finished difference Result 5040 states and 7611 transitions. [2025-01-09 05:52:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:52:16,989 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-01-09 05:52:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:16,999 INFO L225 Difference]: With dead ends: 5040 [2025-01-09 05:52:16,999 INFO L226 Difference]: Without dead ends: 3853 [2025-01-09 05:52:17,001 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-01-09 05:52:17,001 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-01-09 05:52:17,002 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-01-09 05:52:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2025-01-09 05:52:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2025-01-09 05:52:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.5149389451805664) internal successors, (5831), 3850 states have internal predecessors, (5831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5831 transitions. [2025-01-09 05:52:17,068 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5831 transitions. Word has length 60 [2025-01-09 05:52:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:17,068 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5831 transitions. [2025-01-09 05:52:17,069 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-01-09 05:52:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5831 transitions. [2025-01-09 05:52:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:52:17,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:17,069 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:52:17,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:52:17,070 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:17,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:17,070 INFO L85 PathProgramCache]: Analyzing trace with hash -947352998, now seen corresponding path program 1 times [2025-01-09 05:52:17,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:17,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282566410] [2025-01-09 05:52:17,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:17,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:17,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:52:17,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:52:17,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:17,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:17,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:17,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282566410] [2025-01-09 05:52:17,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282566410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:17,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:17,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:52:17,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011303770] [2025-01-09 05:52:17,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:17,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:52:17,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:17,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:52:17,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:17,114 INFO L87 Difference]: Start difference. First operand 3851 states and 5831 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:19,970 INFO L93 Difference]: Finished difference Result 5355 states and 8704 transitions. [2025-01-09 05:52:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:52:19,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-01-09 05:52:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:19,986 INFO L225 Difference]: With dead ends: 5355 [2025-01-09 05:52:19,986 INFO L226 Difference]: Without dead ends: 4602 [2025-01-09 05:52:19,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:19,989 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 841 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:52:19,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 582 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 05:52:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2025-01-09 05:52:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4602. [2025-01-09 05:52:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4602 states, 4600 states have (on average 1.4804347826086957) internal successors, (6810), 4601 states have internal predecessors, (6810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6810 transitions. [2025-01-09 05:52:20,096 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6810 transitions. Word has length 67 [2025-01-09 05:52:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:20,096 INFO L471 AbstractCegarLoop]: Abstraction has 4602 states and 6810 transitions. [2025-01-09 05:52:20,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:20,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6810 transitions. [2025-01-09 05:52:20,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:52:20,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:20,098 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-01-09 05:52:20,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:52:20,098 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:20,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:20,099 INFO L85 PathProgramCache]: Analyzing trace with hash -925514908, now seen corresponding path program 1 times [2025-01-09 05:52:20,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:20,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331831044] [2025-01-09 05:52:20,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:20,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:52:20,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:52:20,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:20,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:52:20,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:20,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331831044] [2025-01-09 05:52:20,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331831044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:20,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:20,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:52:20,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132117487] [2025-01-09 05:52:20,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:20,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:52:20,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:20,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:52:20,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:52:20,239 INFO L87 Difference]: Start difference. First operand 4602 states and 6810 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-01-09 05:52:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:20,539 INFO L93 Difference]: Finished difference Result 20550 states and 29472 transitions. [2025-01-09 05:52:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:52:20,539 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-01-09 05:52:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:20,580 INFO L225 Difference]: With dead ends: 20550 [2025-01-09 05:52:20,581 INFO L226 Difference]: Without dead ends: 17492 [2025-01-09 05:52:20,589 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-01-09 05:52:20,590 INFO L435 NwaCegarLoop]: 1612 mSDtfsCounter, 6329 mSDsluCounter, 2046 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6329 SdHoareTripleChecker+Valid, 3658 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:52:20,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6329 Valid, 3658 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:52:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17492 states. [2025-01-09 05:52:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17492 to 7658. [2025-01-09 05:52:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7658 states, 7656 states have (on average 1.4516718913270636) internal successors, (11114), 7657 states have internal predecessors, (11114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7658 states to 7658 states and 11114 transitions. [2025-01-09 05:52:20,933 INFO L78 Accepts]: Start accepts. Automaton has 7658 states and 11114 transitions. Word has length 77 [2025-01-09 05:52:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:20,933 INFO L471 AbstractCegarLoop]: Abstraction has 7658 states and 11114 transitions. [2025-01-09 05:52:20,934 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-01-09 05:52:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 7658 states and 11114 transitions. [2025-01-09 05:52:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:52:20,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:20,935 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-01-09 05:52:20,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:52:20,936 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:20,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:20,937 INFO L85 PathProgramCache]: Analyzing trace with hash 312747108, now seen corresponding path program 1 times [2025-01-09 05:52:20,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:20,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609457315] [2025-01-09 05:52:20,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:20,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:20,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:52:20,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:52:20,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:20,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:52:21,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:21,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609457315] [2025-01-09 05:52:21,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609457315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:21,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:21,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:52:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769753437] [2025-01-09 05:52:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:21,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:52:21,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:21,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:52:21,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:52:21,056 INFO L87 Difference]: Start difference. First operand 7658 states and 11114 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-01-09 05:52:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:21,335 INFO L93 Difference]: Finished difference Result 23606 states and 33776 transitions. [2025-01-09 05:52:21,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:52:21,335 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-01-09 05:52:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:21,364 INFO L225 Difference]: With dead ends: 23606 [2025-01-09 05:52:21,365 INFO L226 Difference]: Without dead ends: 20548 [2025-01-09 05:52:21,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:52:21,372 INFO L435 NwaCegarLoop]: 1609 mSDtfsCounter, 6354 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6354 SdHoareTripleChecker+Valid, 3586 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:52:21,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6354 Valid, 3586 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:52:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20548 states. [2025-01-09 05:52:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20548 to 12250. [2025-01-09 05:52:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12250 states, 12248 states have (on average 1.4312540822991509) internal successors, (17530), 12249 states have internal predecessors, (17530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12250 states to 12250 states and 17530 transitions. [2025-01-09 05:52:21,721 INFO L78 Accepts]: Start accepts. Automaton has 12250 states and 17530 transitions. Word has length 77 [2025-01-09 05:52:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:21,721 INFO L471 AbstractCegarLoop]: Abstraction has 12250 states and 17530 transitions. [2025-01-09 05:52:21,721 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-01-09 05:52:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 12250 states and 17530 transitions. [2025-01-09 05:52:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:52:21,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:21,723 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-01-09 05:52:21,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:52:21,723 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:21,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1902721692, now seen corresponding path program 1 times [2025-01-09 05:52:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356134020] [2025-01-09 05:52:21,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:21,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:52:21,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:52:21,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:21,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:52:21,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:21,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356134020] [2025-01-09 05:52:21,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356134020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:21,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:21,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:52:21,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273286778] [2025-01-09 05:52:21,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:21,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:52:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:21,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:52:21,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:52:21,865 INFO L87 Difference]: Start difference. First operand 12250 states and 17530 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-01-09 05:52:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:22,307 INFO L93 Difference]: Finished difference Result 26662 states and 38080 transitions. [2025-01-09 05:52:22,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:52:22,308 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-01-09 05:52:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:22,358 INFO L225 Difference]: With dead ends: 26662 [2025-01-09 05:52:22,358 INFO L226 Difference]: Without dead ends: 23604 [2025-01-09 05:52:22,367 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-01-09 05:52:22,369 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6401 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6401 SdHoareTripleChecker+Valid, 3558 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-01-09 05:52:22,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6401 Valid, 3558 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:52:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23604 states. [2025-01-09 05:52:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23604 to 15306. [2025-01-09 05:52:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15306 states, 15304 states have (on average 1.4266858337689492) internal successors, (21834), 15305 states have internal predecessors, (21834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15306 states to 15306 states and 21834 transitions. [2025-01-09 05:52:22,912 INFO L78 Accepts]: Start accepts. Automaton has 15306 states and 21834 transitions. Word has length 77 [2025-01-09 05:52:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:22,912 INFO L471 AbstractCegarLoop]: Abstraction has 15306 states and 21834 transitions. [2025-01-09 05:52:22,912 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-01-09 05:52:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 15306 states and 21834 transitions. [2025-01-09 05:52:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:52:22,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:22,915 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-01-09 05:52:22,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:52:22,915 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:22,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash -121788828, now seen corresponding path program 1 times [2025-01-09 05:52:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:22,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501749003] [2025-01-09 05:52:22,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:22,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:52:22,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:52:22,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:22,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:52:23,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:23,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501749003] [2025-01-09 05:52:23,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501749003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:23,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:23,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:52:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928239175] [2025-01-09 05:52:23,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:23,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:52:23,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:23,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:52:23,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:52:23,059 INFO L87 Difference]: Start difference. First operand 15306 states and 21834 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-01-09 05:52:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:23,553 INFO L93 Difference]: Finished difference Result 29718 states and 42384 transitions. [2025-01-09 05:52:23,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:52:23,554 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-01-09 05:52:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:23,595 INFO L225 Difference]: With dead ends: 29718 [2025-01-09 05:52:23,596 INFO L226 Difference]: Without dead ends: 26660 [2025-01-09 05:52:23,604 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-01-09 05:52:23,605 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-01-09 05:52:23,605 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-01-09 05:52:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26660 states. [2025-01-09 05:52:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26660 to 18362. [2025-01-09 05:52:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18362 states, 18360 states have (on average 1.4236383442265794) internal successors, (26138), 18361 states have internal predecessors, (26138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18362 states to 18362 states and 26138 transitions. [2025-01-09 05:52:24,279 INFO L78 Accepts]: Start accepts. Automaton has 18362 states and 26138 transitions. Word has length 77 [2025-01-09 05:52:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:24,280 INFO L471 AbstractCegarLoop]: Abstraction has 18362 states and 26138 transitions. [2025-01-09 05:52:24,280 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-01-09 05:52:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 18362 states and 26138 transitions. [2025-01-09 05:52:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:52:24,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:24,284 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-01-09 05:52:24,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:52:24,284 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:24,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:24,285 INFO L85 PathProgramCache]: Analyzing trace with hash -883203329, now seen corresponding path program 1 times [2025-01-09 05:52:24,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:24,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549266711] [2025-01-09 05:52:24,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:24,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:24,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:52:24,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:52:24,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:24,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:52:24,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:24,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549266711] [2025-01-09 05:52:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549266711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:24,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:52:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110865546] [2025-01-09 05:52:24,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:24,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:52:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:24,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:52:24,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:52:24,456 INFO L87 Difference]: Start difference. First operand 18362 states and 26138 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-01-09 05:52:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:24,891 INFO L93 Difference]: Finished difference Result 31014 states and 44256 transitions. [2025-01-09 05:52:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:52:24,892 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-01-09 05:52:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:24,924 INFO L225 Difference]: With dead ends: 31014 [2025-01-09 05:52:24,924 INFO L226 Difference]: Without dead ends: 28836 [2025-01-09 05:52:24,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:52:24,933 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 6324 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6324 SdHoareTripleChecker+Valid, 3756 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:52:24,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6324 Valid, 3756 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:52:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28836 states. [2025-01-09 05:52:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28836 to 20538. [2025-01-09 05:52:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20538 states, 20536 states have (on average 1.4239384495520062) internal successors, (29242), 20537 states have internal predecessors, (29242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20538 states to 20538 states and 29242 transitions. [2025-01-09 05:52:25,384 INFO L78 Accepts]: Start accepts. Automaton has 20538 states and 29242 transitions. Word has length 79 [2025-01-09 05:52:25,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:25,384 INFO L471 AbstractCegarLoop]: Abstraction has 20538 states and 29242 transitions. [2025-01-09 05:52:25,384 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-01-09 05:52:25,384 INFO L276 IsEmpty]: Start isEmpty. Operand 20538 states and 29242 transitions. [2025-01-09 05:52:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:52:25,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:25,388 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-01-09 05:52:25,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:52:25,388 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:25,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:25,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1710799524, now seen corresponding path program 1 times [2025-01-09 05:52:25,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:25,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372259934] [2025-01-09 05:52:25,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:25,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:25,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:52:25,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:52:25,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:25,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:25,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372259934] [2025-01-09 05:52:25,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372259934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:25,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:25,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:52:25,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025200155] [2025-01-09 05:52:25,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:25,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:52:25,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:25,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:52:25,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:25,458 INFO L87 Difference]: Start difference. First operand 20538 states and 29242 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-01-09 05:52:25,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:25,778 INFO L93 Difference]: Finished difference Result 34706 states and 49441 transitions. [2025-01-09 05:52:25,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:52:25,785 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-01-09 05:52:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:25,834 INFO L225 Difference]: With dead ends: 34706 [2025-01-09 05:52:25,835 INFO L226 Difference]: Without dead ends: 15712 [2025-01-09 05:52:25,869 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-01-09 05:52:25,870 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-01-09 05:52:25,870 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-01-09 05:52:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15712 states. [2025-01-09 05:52:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15712 to 15710. [2025-01-09 05:52:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15710 states, 15708 states have (on average 1.4289533995416348) internal successors, (22446), 15709 states have internal predecessors, (22446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15710 states to 15710 states and 22446 transitions. [2025-01-09 05:52:26,430 INFO L78 Accepts]: Start accepts. Automaton has 15710 states and 22446 transitions. Word has length 79 [2025-01-09 05:52:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:26,430 INFO L471 AbstractCegarLoop]: Abstraction has 15710 states and 22446 transitions. [2025-01-09 05:52:26,430 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-01-09 05:52:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states and 22446 transitions. [2025-01-09 05:52:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 05:52:26,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:26,432 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-01-09 05:52:26,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:52:26,433 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:26,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -594113331, now seen corresponding path program 1 times [2025-01-09 05:52:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866633796] [2025-01-09 05:52:26,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:26,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:26,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 05:52:26,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 05:52:26,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:26,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:26,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:26,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866633796] [2025-01-09 05:52:26,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866633796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:26,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:26,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:52:26,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533249976] [2025-01-09 05:52:26,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:26,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:52:26,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:26,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:52:26,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:26,502 INFO L87 Difference]: Start difference. First operand 15710 states and 22446 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-01-09 05:52:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:26,598 INFO L93 Difference]: Finished difference Result 22786 states and 32432 transitions. [2025-01-09 05:52:26,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:52:26,598 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-01-09 05:52:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:26,609 INFO L225 Difference]: With dead ends: 22786 [2025-01-09 05:52:26,609 INFO L226 Difference]: Without dead ends: 8640 [2025-01-09 05:52:26,620 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-01-09 05:52:26,621 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-01-09 05:52:26,621 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-01-09 05:52:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8640 states. [2025-01-09 05:52:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8640 to 8638. [2025-01-09 05:52:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8638 states, 8636 states have (on average 1.4309865678554887) internal successors, (12358), 8637 states have internal predecessors, (12358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8638 states to 8638 states and 12358 transitions. [2025-01-09 05:52:26,854 INFO L78 Accepts]: Start accepts. Automaton has 8638 states and 12358 transitions. Word has length 80 [2025-01-09 05:52:26,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:26,855 INFO L471 AbstractCegarLoop]: Abstraction has 8638 states and 12358 transitions. [2025-01-09 05:52:26,856 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-01-09 05:52:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 8638 states and 12358 transitions. [2025-01-09 05:52:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 05:52:26,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:26,857 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-01-09 05:52:26,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:52:26,858 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:26,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:26,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1560227327, now seen corresponding path program 1 times [2025-01-09 05:52:26,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:26,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629610703] [2025-01-09 05:52:26,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:26,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:26,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 05:52:26,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 05:52:26,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:26,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:26,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629610703] [2025-01-09 05:52:26,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629610703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:26,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:26,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:52:26,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876571960] [2025-01-09 05:52:26,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:26,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:52:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:26,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:52:26,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:26,921 INFO L87 Difference]: Start difference. First operand 8638 states and 12358 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-01-09 05:52:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:26,978 INFO L93 Difference]: Finished difference Result 12178 states and 17300 transitions. [2025-01-09 05:52:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:52:26,979 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-01-09 05:52:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:26,984 INFO L225 Difference]: With dead ends: 12178 [2025-01-09 05:52:26,984 INFO L226 Difference]: Without dead ends: 5104 [2025-01-09 05:52:26,989 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-01-09 05:52:26,991 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-01-09 05:52:26,991 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-01-09 05:52:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2025-01-09 05:52:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 5102. [2025-01-09 05:52:27,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5102 states, 5100 states have (on average 1.444313725490196) internal successors, (7366), 5101 states have internal predecessors, (7366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5102 states to 5102 states and 7366 transitions. [2025-01-09 05:52:27,060 INFO L78 Accepts]: Start accepts. Automaton has 5102 states and 7366 transitions. Word has length 82 [2025-01-09 05:52:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:27,061 INFO L471 AbstractCegarLoop]: Abstraction has 5102 states and 7366 transitions. [2025-01-09 05:52:27,061 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-01-09 05:52:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 5102 states and 7366 transitions. [2025-01-09 05:52:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 05:52:27,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:27,063 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-01-09 05:52:27,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:52:27,065 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:27,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:27,065 INFO L85 PathProgramCache]: Analyzing trace with hash -370457167, now seen corresponding path program 1 times [2025-01-09 05:52:27,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:27,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866919152] [2025-01-09 05:52:27,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:27,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:27,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 05:52:27,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 05:52:27,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:27,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:27,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:27,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866919152] [2025-01-09 05:52:27,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866919152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:27,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:27,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:52:27,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697067728] [2025-01-09 05:52:27,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:27,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:52:27,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:27,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:52:27,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:27,261 INFO L87 Difference]: Start difference. First operand 5102 states and 7366 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-01-09 05:52:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:27,381 INFO L93 Difference]: Finished difference Result 6874 states and 9812 transitions. [2025-01-09 05:52:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:52:27,382 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-01-09 05:52:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:27,391 INFO L225 Difference]: With dead ends: 6874 [2025-01-09 05:52:27,391 INFO L226 Difference]: Without dead ends: 3336 [2025-01-09 05:52:27,400 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-01-09 05:52:27,400 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-01-09 05:52:27,400 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-01-09 05:52:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2025-01-09 05:52:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3334. [2025-01-09 05:52:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 3332 states have (on average 1.469387755102041) internal successors, (4896), 3333 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4896 transitions. [2025-01-09 05:52:27,576 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4896 transitions. Word has length 84 [2025-01-09 05:52:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:27,576 INFO L471 AbstractCegarLoop]: Abstraction has 3334 states and 4896 transitions. [2025-01-09 05:52:27,577 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-01-09 05:52:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4896 transitions. [2025-01-09 05:52:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 05:52:27,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:27,579 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-01-09 05:52:27,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:52:27,581 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:27,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:27,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1277561885, now seen corresponding path program 1 times [2025-01-09 05:52:27,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:27,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203261105] [2025-01-09 05:52:27,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:27,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:27,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 05:52:27,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 05:52:27,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:27,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:27,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203261105] [2025-01-09 05:52:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203261105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:52:27,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:52:27,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:52:27,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303559446] [2025-01-09 05:52:27,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:52:27,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:52:27,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:27,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:52:27,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:52:27,708 INFO L87 Difference]: Start difference. First operand 3334 states and 4896 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-01-09 05:52:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:27,758 INFO L93 Difference]: Finished difference Result 4222 states and 6107 transitions. [2025-01-09 05:52:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:52:27,758 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-01-09 05:52:27,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:27,763 INFO L225 Difference]: With dead ends: 4222 [2025-01-09 05:52:27,763 INFO L226 Difference]: Without dead ends: 2452 [2025-01-09 05:52:27,765 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-01-09 05:52:27,768 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-01-09 05:52:27,769 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-01-09 05:52:27,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-01-09 05:52:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2450. [2025-01-09 05:52:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 1.5008169934640523) internal successors, (3674), 2449 states have internal predecessors, (3674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3674 transitions. [2025-01-09 05:52:27,822 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3674 transitions. Word has length 86 [2025-01-09 05:52:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:27,823 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3674 transitions. [2025-01-09 05:52:27,823 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-01-09 05:52:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3674 transitions. [2025-01-09 05:52:27,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 05:52:27,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:27,824 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-01-09 05:52:27,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 05:52:27,825 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:27,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1236424853, now seen corresponding path program 1 times [2025-01-09 05:52:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:27,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191634391] [2025-01-09 05:52:27,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:27,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:27,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 05:52:27,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 05:52:27,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:27,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:28,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:28,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191634391] [2025-01-09 05:52:28,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191634391] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:52:28,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422294809] [2025-01-09 05:52:28,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:28,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:52:28,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:52:28,520 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-01-09 05:52:28,556 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-01-09 05:52:28,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 05:52:28,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 05:52:28,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:28,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:28,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:52:28,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:52:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:29,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:52:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:30,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422294809] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:52:30,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:52:30,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 05:52:30,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145036066] [2025-01-09 05:52:30,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:52:30,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 05:52:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:30,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 05:52:30,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2025-01-09 05:52:30,081 INFO L87 Difference]: Start difference. First operand 2450 states and 3674 transitions. Second operand has 28 states, 28 states have (on average 7.785714285714286) internal successors, (218), 27 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:31,317 INFO L93 Difference]: Finished difference Result 6208 states and 8738 transitions. [2025-01-09 05:52:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 05:52:31,318 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.785714285714286) internal successors, (218), 27 states have internal predecessors, (218), 0 states have call successors, (0), 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-01-09 05:52:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:31,324 INFO L225 Difference]: With dead ends: 6208 [2025-01-09 05:52:31,324 INFO L226 Difference]: Without dead ends: 5322 [2025-01-09 05:52:31,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=657, Invalid=2423, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 05:52:31,326 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 14399 mSDsluCounter, 6329 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14399 SdHoareTripleChecker+Valid, 7831 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:52:31,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14399 Valid, 7831 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:52:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2025-01-09 05:52:31,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5284. [2025-01-09 05:52:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5284 states, 5282 states have (on average 1.4117758424839075) internal successors, (7457), 5283 states have internal predecessors, (7457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5284 states to 5284 states and 7457 transitions. [2025-01-09 05:52:31,410 INFO L78 Accepts]: Start accepts. Automaton has 5284 states and 7457 transitions. Word has length 88 [2025-01-09 05:52:31,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:31,410 INFO L471 AbstractCegarLoop]: Abstraction has 5284 states and 7457 transitions. [2025-01-09 05:52:31,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.785714285714286) internal successors, (218), 27 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:31,411 INFO L276 IsEmpty]: Start isEmpty. Operand 5284 states and 7457 transitions. [2025-01-09 05:52:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:52:31,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:31,412 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, 1] [2025-01-09 05:52:31,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:52:31,612 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-01-09 05:52:31,613 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:31,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:31,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1008908801, now seen corresponding path program 1 times [2025-01-09 05:52:31,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:31,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120212308] [2025-01-09 05:52:31,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:31,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:31,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:52:31,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:52:31,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:31,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:31,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:31,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120212308] [2025-01-09 05:52:31,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120212308] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:52:31,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330224024] [2025-01-09 05:52:31,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:31,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:52:31,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:52:31,854 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-01-09 05:52:31,858 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-01-09 05:52:31,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:52:31,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:52:31,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:31,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:31,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 05:52:31,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:52:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:52:32,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:52:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:52:32,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330224024] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:52:32,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:52:32,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 16 [2025-01-09 05:52:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93221635] [2025-01-09 05:52:32,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:52:32,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 05:52:32,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:32,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 05:52:32,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-01-09 05:52:32,255 INFO L87 Difference]: Start difference. First operand 5284 states and 7457 transitions. Second operand has 16 states, 16 states have (on average 15.625) internal successors, (250), 16 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:33,891 INFO L93 Difference]: Finished difference Result 28358 states and 37918 transitions. [2025-01-09 05:52:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 05:52:33,891 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.625) internal successors, (250), 16 states have internal predecessors, (250), 0 states have call successors, (0), 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-01-09 05:52:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:33,915 INFO L225 Difference]: With dead ends: 28358 [2025-01-09 05:52:33,915 INFO L226 Difference]: Without dead ends: 24638 [2025-01-09 05:52:33,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=578, Invalid=2178, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 05:52:33,922 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 11637 mSDsluCounter, 7983 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11637 SdHoareTripleChecker+Valid, 9529 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:52:33,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11637 Valid, 9529 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:52:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24638 states. [2025-01-09 05:52:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24638 to 24512. [2025-01-09 05:52:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24512 states, 24510 states have (on average 1.2789473684210526) internal successors, (31347), 24511 states have internal predecessors, (31347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24512 states to 24512 states and 31347 transitions. [2025-01-09 05:52:34,563 INFO L78 Accepts]: Start accepts. Automaton has 24512 states and 31347 transitions. Word has length 89 [2025-01-09 05:52:34,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:34,564 INFO L471 AbstractCegarLoop]: Abstraction has 24512 states and 31347 transitions. [2025-01-09 05:52:34,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.625) internal successors, (250), 16 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 24512 states and 31347 transitions. [2025-01-09 05:52:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:52:34,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:34,574 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-01-09 05:52:34,586 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-01-09 05:52:34,779 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-01-09 05:52:34,779 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:34,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash -472155423, now seen corresponding path program 1 times [2025-01-09 05:52:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:34,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109593451] [2025-01-09 05:52:34,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:34,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:52:34,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:52:34,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:34,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:35,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109593451] [2025-01-09 05:52:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109593451] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:52:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486065929] [2025-01-09 05:52:35,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:35,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:52:35,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:52:35,263 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-01-09 05:52:35,264 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-01-09 05:52:35,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:52:35,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:52:35,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:35,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:35,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:52:35,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:52:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:35,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:52:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:36,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486065929] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:52:36,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:52:36,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-01-09 05:52:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236371751] [2025-01-09 05:52:36,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:52:36,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 05:52:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:36,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 05:52:36,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-01-09 05:52:36,369 INFO L87 Difference]: Start difference. First operand 24512 states and 31347 transitions. Second operand has 22 states, 22 states have (on average 9.5) internal successors, (209), 21 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:37,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:37,694 INFO L93 Difference]: Finished difference Result 70014 states and 89003 transitions. [2025-01-09 05:52:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:52:37,695 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 21 states have internal predecessors, (209), 0 states have call successors, (0), 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-01-09 05:52:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:37,757 INFO L225 Difference]: With dead ends: 70014 [2025-01-09 05:52:37,757 INFO L226 Difference]: Without dead ends: 48227 [2025-01-09 05:52:37,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2025-01-09 05:52:37,776 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 9247 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9247 SdHoareTripleChecker+Valid, 4785 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:52:37,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9247 Valid, 4785 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:52:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48227 states. [2025-01-09 05:52:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48227 to 47631. [2025-01-09 05:52:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47631 states, 47629 states have (on average 1.2555795838669719) internal successors, (59802), 47630 states have internal predecessors, (59802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47631 states to 47631 states and 59802 transitions. [2025-01-09 05:52:39,428 INFO L78 Accepts]: Start accepts. Automaton has 47631 states and 59802 transitions. Word has length 89 [2025-01-09 05:52:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:39,428 INFO L471 AbstractCegarLoop]: Abstraction has 47631 states and 59802 transitions. [2025-01-09 05:52:39,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 21 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 47631 states and 59802 transitions. [2025-01-09 05:52:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:52:39,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:39,431 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-01-09 05:52:39,441 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-01-09 05:52:39,632 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-01-09 05:52:39,632 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:39,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1755296695, now seen corresponding path program 1 times [2025-01-09 05:52:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:39,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716575643] [2025-01-09 05:52:39,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:39,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:39,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:52:39,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:52:39,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:39,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:39,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:39,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716575643] [2025-01-09 05:52:39,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716575643] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:52:39,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041119391] [2025-01-09 05:52:39,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:39,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:52:39,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:52:39,960 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-01-09 05:52:39,962 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-01-09 05:52:40,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:52:40,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:52:40,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:40,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:40,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:52:40,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:52:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:40,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:52:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:41,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041119391] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:52:41,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:52:41,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-01-09 05:52:41,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369123276] [2025-01-09 05:52:41,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:52:41,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 05:52:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:52:41,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 05:52:41,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:52:41,563 INFO L87 Difference]: Start difference. First operand 47631 states and 59802 transitions. Second operand has 23 states, 23 states have (on average 9.521739130434783) internal successors, (219), 22 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-01-09 05:52:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:52:43,969 INFO L93 Difference]: Finished difference Result 133463 states and 167319 transitions. [2025-01-09 05:52:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:52:43,970 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.521739130434783) internal successors, (219), 22 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 90 [2025-01-09 05:52:43,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:52:44,072 INFO L225 Difference]: With dead ends: 133463 [2025-01-09 05:52:44,072 INFO L226 Difference]: Without dead ends: 94782 [2025-01-09 05:52:44,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 05:52:44,103 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 18349 mSDsluCounter, 4830 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18349 SdHoareTripleChecker+Valid, 6351 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:52:44,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18349 Valid, 6351 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:52:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94782 states. [2025-01-09 05:52:47,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94782 to 93594. [2025-01-09 05:52:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93594 states, 93592 states have (on average 1.2366548422942132) internal successors, (115741), 93593 states have internal predecessors, (115741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:52:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93594 states to 93594 states and 115741 transitions. [2025-01-09 05:52:47,241 INFO L78 Accepts]: Start accepts. Automaton has 93594 states and 115741 transitions. Word has length 90 [2025-01-09 05:52:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:52:47,242 INFO L471 AbstractCegarLoop]: Abstraction has 93594 states and 115741 transitions. [2025-01-09 05:52:47,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.521739130434783) internal successors, (219), 22 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-01-09 05:52:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 93594 states and 115741 transitions. [2025-01-09 05:52:47,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 05:52:47,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:52:47,249 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] [2025-01-09 05:52:47,265 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-01-09 05:52:47,449 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-01-09 05:52:47,450 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:52:47,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:52:47,450 INFO L85 PathProgramCache]: Analyzing trace with hash 14662161, now seen corresponding path program 1 times [2025-01-09 05:52:47,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:52:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283377761] [2025-01-09 05:52:47,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:52:47,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:52:47,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:52:47,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:47,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:52:47,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:52:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283377761] [2025-01-09 05:52:47,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283377761] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:52:47,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050704698] [2025-01-09 05:52:47,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:52:47,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:52:47,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:52:47,735 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-01-09 05:52:47,736 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-01-09 05:52:47,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:52:47,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:52:47,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:52:47,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:52:47,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-01-09 05:52:47,861 INFO L279 TraceCheckSpWp]: Computing forward predicates...