./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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 62ddbd8e479b9a9ff0259307914371bc7c12caf38dd9ff6b9d8872f71f8db1de --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:41:39,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:41:39,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:41:39,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:41:39,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:41:39,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:41:39,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:41:39,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:41:39,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:41:39,696 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:41:39,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:41:39,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:41:39,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:41:39,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:41:39,696 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:41:39,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:41:39,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:41:39,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:41:39,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:41:39,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:41:39,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:41:39,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:41:39,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:41:39,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:41:39,697 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:41:39,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:41:39,697 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:41:39,697 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:41:39,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:41:39,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:41:39,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:41:39,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:41:39,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:41:39,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:41:39,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:41:39,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:41:39,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:41:39,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:41:39,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:41:39,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:41:39,699 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:41:39,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:41:39,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:41:39,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:41:39,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:41:39,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:41:39,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:41:39,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:41:39,699 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 -> 62ddbd8e479b9a9ff0259307914371bc7c12caf38dd9ff6b9d8872f71f8db1de [2025-01-09 04:41:39,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:41:39,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:41:39,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:41:39,971 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:41:39,972 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:41:39,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:41:41,268 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d476d682/39aecae826c24472b90ef72c604b92bc/FLAGb903fcfa6 [2025-01-09 04:41:41,636 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:41:41,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:41:41,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d476d682/39aecae826c24472b90ef72c604b92bc/FLAGb903fcfa6 [2025-01-09 04:41:41,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d476d682/39aecae826c24472b90ef72c604b92bc [2025-01-09 04:41:41,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:41:41,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:41:41,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:41:41,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:41:41,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:41:41,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:41:41" (1/1) ... [2025-01-09 04:41:41,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f326f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:41, skipping insertion in model container [2025-01-09 04:41:41,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:41:41" (1/1) ... [2025-01-09 04:41:41,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:41:42,062 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8125,8138] [2025-01-09 04:41:42,097 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14955,14968] [2025-01-09 04:41:42,104 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17042,17055] [2025-01-09 04:41:42,107 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18066,18079] [2025-01-09 04:41:42,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:41:42,245 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:41:42,309 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8125,8138] [2025-01-09 04:41:42,341 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14955,14968] [2025-01-09 04:41:42,353 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17042,17055] [2025-01-09 04:41:42,355 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18066,18079] [2025-01-09 04:41:42,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:41:42,449 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:41:42,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42 WrapperNode [2025-01-09 04:41:42,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:41:42,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:41:42,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:41:42,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:41:42,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,553 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2617 [2025-01-09 04:41:42,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:41:42,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:41:42,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:41:42,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:41:42,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,615 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 04:41:42,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:41:42,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:41:42,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:41:42,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:41:42,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (1/1) ... [2025-01-09 04:41:42,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:41:42,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:41:42,724 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 04:41:42,727 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 04:41:42,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:41:42,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:41:42,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:41:42,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:41:42,926 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:41:42,927 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:41:44,179 INFO L? ?]: Removed 426 outVars from TransFormulas that were not future-live. [2025-01-09 04:41:44,179 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:41:44,195 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:41:44,203 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:41:44,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:41:44 BoogieIcfgContainer [2025-01-09 04:41:44,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:41:44,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:41:44,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:41:44,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:41:44,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:41:41" (1/3) ... [2025-01-09 04:41:44,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ae38cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:41:44, skipping insertion in model container [2025-01-09 04:41:44,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:42" (2/3) ... [2025-01-09 04:41:44,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ae38cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:41:44, skipping insertion in model container [2025-01-09 04:41:44,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:41:44" (3/3) ... [2025-01-09 04:41:44,214 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:41:44,234 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:41:44,241 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 456 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-09 04:41:44,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:41:44,307 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;@38a524fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:41:44,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 04:41:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 456 states, 451 states have (on average 1.8492239467849223) internal successors, (834), 455 states have internal predecessors, (834), 0 states have call successors, (0), 0 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 04:41:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:41:44,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:44,321 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] [2025-01-09 04:41:44,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:44,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:44,327 INFO L85 PathProgramCache]: Analyzing trace with hash 26036561, now seen corresponding path program 1 times [2025-01-09 04:41:44,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:44,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62713374] [2025-01-09 04:41:44,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:44,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:44,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:41:44,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:41:44,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:44,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:44,847 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 04:41:44,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:44,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62713374] [2025-01-09 04:41:44,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62713374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:44,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:44,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:41:44,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130036587] [2025-01-09 04:41:44,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:44,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:41:44,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:44,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:41:44,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:41:44,889 INFO L87 Difference]: Start difference. First operand has 456 states, 451 states have (on average 1.8492239467849223) internal successors, (834), 455 states have internal predecessors, (834), 0 states have call successors, (0), 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 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 04:41:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:45,294 INFO L93 Difference]: Finished difference Result 833 states and 1472 transitions. [2025-01-09 04:41:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:41:45,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-01-09 04:41:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:45,306 INFO L225 Difference]: With dead ends: 833 [2025-01-09 04:41:45,306 INFO L226 Difference]: Without dead ends: 484 [2025-01-09 04:41:45,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:41:45,313 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 2299 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2299 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:45,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2299 Valid, 576 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:41:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-01-09 04:41:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 478. [2025-01-09 04:41:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 474 states have (on average 1.3755274261603376) internal successors, (652), 477 states have internal predecessors, (652), 0 states have call successors, (0), 0 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 04:41:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 652 transitions. [2025-01-09 04:41:45,363 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 652 transitions. Word has length 50 [2025-01-09 04:41:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:45,364 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 652 transitions. [2025-01-09 04:41:45,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 04:41:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 652 transitions. [2025-01-09 04:41:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:41:45,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:45,367 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] [2025-01-09 04:41:45,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:41:45,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:45,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:45,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1543870192, now seen corresponding path program 1 times [2025-01-09 04:41:45,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:45,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051879002] [2025-01-09 04:41:45,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:45,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:41:45,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:41:45,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:45,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:45,478 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 04:41:45,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:45,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051879002] [2025-01-09 04:41:45,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051879002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:45,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:45,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:45,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207447572] [2025-01-09 04:41:45,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:45,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:45,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:45,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:45,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:45,480 INFO L87 Difference]: Start difference. First operand 478 states and 652 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:41:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:45,535 INFO L93 Difference]: Finished difference Result 938 states and 1336 transitions. [2025-01-09 04:41:45,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:45,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-01-09 04:41:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:45,538 INFO L225 Difference]: With dead ends: 938 [2025-01-09 04:41:45,538 INFO L226 Difference]: Without dead ends: 684 [2025-01-09 04:41:45,542 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 04:41:45,542 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 272 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:45,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 860 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-01-09 04:41:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 678. [2025-01-09 04:41:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 674 states have (on average 1.4080118694362018) internal successors, (949), 677 states have internal predecessors, (949), 0 states have call successors, (0), 0 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 04:41:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 949 transitions. [2025-01-09 04:41:45,574 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 949 transitions. Word has length 51 [2025-01-09 04:41:45,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:45,575 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 949 transitions. [2025-01-09 04:41:45,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:41:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 949 transitions. [2025-01-09 04:41:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:41:45,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:45,576 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] [2025-01-09 04:41:45,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:41:45,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:45,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash -359372662, now seen corresponding path program 1 times [2025-01-09 04:41:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:45,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534774389] [2025-01-09 04:41:45,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:45,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:45,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:41:45,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:41:45,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:45,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:45,657 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 04:41:45,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534774389] [2025-01-09 04:41:45,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534774389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:45,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:45,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:45,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938206701] [2025-01-09 04:41:45,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:45,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:45,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:45,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:45,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:45,660 INFO L87 Difference]: Start difference. First operand 678 states and 949 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:41:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:45,703 INFO L93 Difference]: Finished difference Result 1307 states and 1856 transitions. [2025-01-09 04:41:45,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:45,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-01-09 04:41:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:45,707 INFO L225 Difference]: With dead ends: 1307 [2025-01-09 04:41:45,707 INFO L226 Difference]: Without dead ends: 917 [2025-01-09 04:41:45,708 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 04:41:45,709 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 366 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:45,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 932 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2025-01-09 04:41:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 907. [2025-01-09 04:41:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 903 states have (on average 1.3820598006644518) internal successors, (1248), 906 states have internal predecessors, (1248), 0 states have call successors, (0), 0 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 04:41:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1248 transitions. [2025-01-09 04:41:45,729 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1248 transitions. Word has length 51 [2025-01-09 04:41:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:45,730 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1248 transitions. [2025-01-09 04:41:45,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:41:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1248 transitions. [2025-01-09 04:41:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:41:45,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:45,732 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] [2025-01-09 04:41:45,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:41:45,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:45,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:45,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1979749037, now seen corresponding path program 1 times [2025-01-09 04:41:45,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:45,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841014447] [2025-01-09 04:41:45,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:45,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:41:45,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:41:45,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:45,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:45,802 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 04:41:45,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:45,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841014447] [2025-01-09 04:41:45,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841014447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:45,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:45,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:45,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292602091] [2025-01-09 04:41:45,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:45,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:45,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:45,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:45,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:45,804 INFO L87 Difference]: Start difference. First operand 907 states and 1248 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:41:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:45,863 INFO L93 Difference]: Finished difference Result 1892 states and 2673 transitions. [2025-01-09 04:41:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:45,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-01-09 04:41:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:45,867 INFO L225 Difference]: With dead ends: 1892 [2025-01-09 04:41:45,867 INFO L226 Difference]: Without dead ends: 1391 [2025-01-09 04:41:45,868 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 04:41:45,868 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 263 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:45,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 924 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-01-09 04:41:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1384. [2025-01-09 04:41:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1380 states have (on average 1.3898550724637682) internal successors, (1918), 1383 states have internal predecessors, (1918), 0 states have call successors, (0), 0 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 04:41:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1918 transitions. [2025-01-09 04:41:45,900 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1918 transitions. Word has length 51 [2025-01-09 04:41:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:45,900 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1918 transitions. [2025-01-09 04:41:45,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:41:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1918 transitions. [2025-01-09 04:41:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:41:45,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:45,903 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] [2025-01-09 04:41:45,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:41:45,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:45,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2124032919, now seen corresponding path program 1 times [2025-01-09 04:41:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:45,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692866343] [2025-01-09 04:41:45,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:45,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:45,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:41:45,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:41:45,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:45,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:46,007 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 04:41:46,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:46,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692866343] [2025-01-09 04:41:46,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692866343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:46,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:46,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:41:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676058853] [2025-01-09 04:41:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:46,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:41:46,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:46,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:41:46,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:41:46,009 INFO L87 Difference]: Start difference. First operand 1384 states and 1918 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:41:46,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:46,249 INFO L93 Difference]: Finished difference Result 2979 states and 4184 transitions. [2025-01-09 04:41:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:41:46,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-01-09 04:41:46,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:46,254 INFO L225 Difference]: With dead ends: 2979 [2025-01-09 04:41:46,254 INFO L226 Difference]: Without dead ends: 1766 [2025-01-09 04:41:46,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:41:46,256 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 1535 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:46,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1535 Valid, 371 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:41:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2025-01-09 04:41:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1754. [2025-01-09 04:41:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1750 states have (on average 1.3982857142857144) internal successors, (2447), 1753 states have internal predecessors, (2447), 0 states have call successors, (0), 0 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 04:41:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2447 transitions. [2025-01-09 04:41:46,284 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2447 transitions. Word has length 51 [2025-01-09 04:41:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:46,285 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2447 transitions. [2025-01-09 04:41:46,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:41:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2447 transitions. [2025-01-09 04:41:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:41:46,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:46,286 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] [2025-01-09 04:41:46,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:41:46,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:46,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:46,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1035105163, now seen corresponding path program 1 times [2025-01-09 04:41:46,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:46,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601104021] [2025-01-09 04:41:46,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:46,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:46,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:41:46,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:41:46,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:46,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:46,507 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 04:41:46,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601104021] [2025-01-09 04:41:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601104021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:46,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:41:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051306721] [2025-01-09 04:41:46,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:46,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:41:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:46,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:41:46,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:41:46,508 INFO L87 Difference]: Start difference. First operand 1754 states and 2447 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 04:41:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:46,828 INFO L93 Difference]: Finished difference Result 3899 states and 5482 transitions. [2025-01-09 04:41:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:41:46,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-01-09 04:41:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:46,834 INFO L225 Difference]: With dead ends: 3899 [2025-01-09 04:41:46,834 INFO L226 Difference]: Without dead ends: 2316 [2025-01-09 04:41:46,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:41:46,836 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 1382 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:46,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 340 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:41:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2025-01-09 04:41:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2300. [2025-01-09 04:41:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2300 states, 2296 states have (on average 1.3937282229965158) internal successors, (3200), 2299 states have internal predecessors, (3200), 0 states have call successors, (0), 0 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 04:41:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 2300 states and 3200 transitions. [2025-01-09 04:41:46,871 INFO L78 Accepts]: Start accepts. Automaton has 2300 states and 3200 transitions. Word has length 52 [2025-01-09 04:41:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:46,871 INFO L471 AbstractCegarLoop]: Abstraction has 2300 states and 3200 transitions. [2025-01-09 04:41:46,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 04:41:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2300 states and 3200 transitions. [2025-01-09 04:41:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:41:46,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:46,872 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] [2025-01-09 04:41:46,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:41:46,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:46,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash 825819079, now seen corresponding path program 1 times [2025-01-09 04:41:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:46,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731716729] [2025-01-09 04:41:46,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:46,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:46,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:41:46,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:41:46,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:46,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:47,048 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 04:41:47,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:47,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731716729] [2025-01-09 04:41:47,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731716729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:47,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:47,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:41:47,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185795697] [2025-01-09 04:41:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:47,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:41:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:47,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:41:47,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:41:47,050 INFO L87 Difference]: Start difference. First operand 2300 states and 3200 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 04:41:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:47,339 INFO L93 Difference]: Finished difference Result 4526 states and 6387 transitions. [2025-01-09 04:41:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:41:47,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-01-09 04:41:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:47,349 INFO L225 Difference]: With dead ends: 4526 [2025-01-09 04:41:47,349 INFO L226 Difference]: Without dead ends: 3496 [2025-01-09 04:41:47,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:41:47,352 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 1712 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:47,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 588 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:41:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2025-01-09 04:41:47,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 2314. [2025-01-09 04:41:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 2310 states have (on average 1.3930735930735931) internal successors, (3218), 2313 states have internal predecessors, (3218), 0 states have call successors, (0), 0 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 04:41:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3218 transitions. [2025-01-09 04:41:47,397 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3218 transitions. Word has length 53 [2025-01-09 04:41:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:47,398 INFO L471 AbstractCegarLoop]: Abstraction has 2314 states and 3218 transitions. [2025-01-09 04:41:47,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 04:41:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3218 transitions. [2025-01-09 04:41:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:41:47,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:47,399 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] [2025-01-09 04:41:47,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:41:47,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:47,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1519774840, now seen corresponding path program 1 times [2025-01-09 04:41:47,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:47,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189506236] [2025-01-09 04:41:47,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:47,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:47,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:41:47,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:41:47,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:47,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:47,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:47,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189506236] [2025-01-09 04:41:47,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189506236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:47,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:47,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:41:47,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756478128] [2025-01-09 04:41:47,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:47,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:41:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:47,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:41:47,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:41:47,614 INFO L87 Difference]: Start difference. First operand 2314 states and 3218 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 04:41:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:47,972 INFO L93 Difference]: Finished difference Result 4994 states and 7055 transitions. [2025-01-09 04:41:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:41:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-01-09 04:41:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:47,984 INFO L225 Difference]: With dead ends: 4994 [2025-01-09 04:41:47,984 INFO L226 Difference]: Without dead ends: 4151 [2025-01-09 04:41:47,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:41:47,986 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1837 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1837 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:47,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1837 Valid, 623 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:41:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4151 states. [2025-01-09 04:41:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4151 to 2336. [2025-01-09 04:41:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2332 states have (on average 1.3932246998284734) internal successors, (3249), 2335 states have internal predecessors, (3249), 0 states have call successors, (0), 0 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 04:41:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3249 transitions. [2025-01-09 04:41:48,039 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3249 transitions. Word has length 53 [2025-01-09 04:41:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:48,040 INFO L471 AbstractCegarLoop]: Abstraction has 2336 states and 3249 transitions. [2025-01-09 04:41:48,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 04:41:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3249 transitions. [2025-01-09 04:41:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:41:48,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:48,042 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] [2025-01-09 04:41:48,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:41:48,042 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:48,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:48,042 INFO L85 PathProgramCache]: Analyzing trace with hash -461927258, now seen corresponding path program 1 times [2025-01-09 04:41:48,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:48,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004488513] [2025-01-09 04:41:48,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:48,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:48,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:41:48,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:41:48,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:48,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:48,162 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 04:41:48,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:48,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004488513] [2025-01-09 04:41:48,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004488513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:48,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:48,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:41:48,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924040672] [2025-01-09 04:41:48,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:48,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:41:48,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:48,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:41:48,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:41:48,164 INFO L87 Difference]: Start difference. First operand 2336 states and 3249 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 04:41:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:48,488 INFO L93 Difference]: Finished difference Result 5751 states and 8136 transitions. [2025-01-09 04:41:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:41:48,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-01-09 04:41:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:48,499 INFO L225 Difference]: With dead ends: 5751 [2025-01-09 04:41:48,499 INFO L226 Difference]: Without dead ends: 4783 [2025-01-09 04:41:48,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:41:48,501 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1951 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:48,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 635 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:41:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2025-01-09 04:41:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 2370. [2025-01-09 04:41:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 2366 states have (on average 1.3918005071851225) internal successors, (3293), 2369 states have internal predecessors, (3293), 0 states have call successors, (0), 0 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 04:41:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3293 transitions. [2025-01-09 04:41:48,559 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3293 transitions. Word has length 53 [2025-01-09 04:41:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:48,559 INFO L471 AbstractCegarLoop]: Abstraction has 2370 states and 3293 transitions. [2025-01-09 04:41:48,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 04:41:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3293 transitions. [2025-01-09 04:41:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:41:48,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:48,561 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 04:41:48,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:41:48,561 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:48,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:48,562 INFO L85 PathProgramCache]: Analyzing trace with hash -719043471, now seen corresponding path program 1 times [2025-01-09 04:41:48,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:48,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391495580] [2025-01-09 04:41:48,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:48,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:41:48,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:41:48,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:48,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:48,886 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 04:41:48,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:48,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391495580] [2025-01-09 04:41:48,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391495580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:48,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:48,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:41:48,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853187610] [2025-01-09 04:41:48,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:48,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:41:48,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:48,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:41:48,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:41:48,887 INFO L87 Difference]: Start difference. First operand 2370 states and 3293 transitions. Second operand has 8 states, 8 states have (on average 6.75) 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 04:41:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:49,554 INFO L93 Difference]: Finished difference Result 4787 states and 6792 transitions. [2025-01-09 04:41:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:41:49,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) 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 04:41:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:49,562 INFO L225 Difference]: With dead ends: 4787 [2025-01-09 04:41:49,563 INFO L226 Difference]: Without dead ends: 3249 [2025-01-09 04:41:49,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:41:49,565 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 1974 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1974 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:49,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1974 Valid, 776 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:41:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2025-01-09 04:41:49,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 2280. [2025-01-09 04:41:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 2276 states have (on average 1.390597539543058) internal successors, (3165), 2279 states have internal predecessors, (3165), 0 states have call successors, (0), 0 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 04:41:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3165 transitions. [2025-01-09 04:41:49,617 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3165 transitions. Word has length 54 [2025-01-09 04:41:49,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:49,617 INFO L471 AbstractCegarLoop]: Abstraction has 2280 states and 3165 transitions. [2025-01-09 04:41:49,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) 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 04:41:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3165 transitions. [2025-01-09 04:41:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:41:49,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:49,619 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 04:41:49,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:41:49,619 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:49,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:49,620 INFO L85 PathProgramCache]: Analyzing trace with hash 465454059, now seen corresponding path program 1 times [2025-01-09 04:41:49,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:49,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877956660] [2025-01-09 04:41:49,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:49,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:49,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:41:49,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:41:49,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:49,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:49,905 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 04:41:49,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:49,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877956660] [2025-01-09 04:41:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877956660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:49,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:49,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:41:49,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456350514] [2025-01-09 04:41:49,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:49,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:41:49,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:49,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:41:49,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:41:49,907 INFO L87 Difference]: Start difference. First operand 2280 states and 3165 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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 04:41:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:50,552 INFO L93 Difference]: Finished difference Result 4880 states and 6895 transitions. [2025-01-09 04:41:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:41:50,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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 04:41:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:50,567 INFO L225 Difference]: With dead ends: 4880 [2025-01-09 04:41:50,569 INFO L226 Difference]: Without dead ends: 3502 [2025-01-09 04:41:50,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:41:50,572 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 1766 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:50,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 1272 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:41:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2025-01-09 04:41:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 2251. [2025-01-09 04:41:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2251 states, 2247 states have (on average 1.3902981753449044) internal successors, (3124), 2250 states have internal predecessors, (3124), 0 states have call successors, (0), 0 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 04:41:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 3124 transitions. [2025-01-09 04:41:50,617 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 3124 transitions. Word has length 54 [2025-01-09 04:41:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:50,617 INFO L471 AbstractCegarLoop]: Abstraction has 2251 states and 3124 transitions. [2025-01-09 04:41:50,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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 04:41:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 3124 transitions. [2025-01-09 04:41:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:41:50,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:50,618 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 04:41:50,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:41:50,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:50,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:50,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1085167472, now seen corresponding path program 1 times [2025-01-09 04:41:50,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:50,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307229332] [2025-01-09 04:41:50,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:50,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:50,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:41:50,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:41:50,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:50,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:50,840 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 04:41:50,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:50,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307229332] [2025-01-09 04:41:50,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307229332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:50,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:50,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:41:50,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056805544] [2025-01-09 04:41:50,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:50,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:41:50,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:50,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:41:50,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:41:50,842 INFO L87 Difference]: Start difference. First operand 2251 states and 3124 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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 04:41:51,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:51,310 INFO L93 Difference]: Finished difference Result 3344 states and 4665 transitions. [2025-01-09 04:41:51,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:41:51,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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 04:41:51,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:51,318 INFO L225 Difference]: With dead ends: 3344 [2025-01-09 04:41:51,318 INFO L226 Difference]: Without dead ends: 3339 [2025-01-09 04:41:51,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:41:51,319 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 2048 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2048 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:51,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2048 Valid, 1079 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:41:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2025-01-09 04:41:51,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2251. [2025-01-09 04:41:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2251 states, 2247 states have (on average 1.3894080996884735) internal successors, (3122), 2250 states have internal predecessors, (3122), 0 states have call successors, (0), 0 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 04:41:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 3122 transitions. [2025-01-09 04:41:51,348 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 3122 transitions. Word has length 54 [2025-01-09 04:41:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:51,348 INFO L471 AbstractCegarLoop]: Abstraction has 2251 states and 3122 transitions. [2025-01-09 04:41:51,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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 04:41:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 3122 transitions. [2025-01-09 04:41:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:41:51,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:51,350 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] [2025-01-09 04:41:51,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:41:51,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:51,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:51,350 INFO L85 PathProgramCache]: Analyzing trace with hash -344500623, now seen corresponding path program 1 times [2025-01-09 04:41:51,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:51,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510754265] [2025-01-09 04:41:51,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:51,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:51,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:41:51,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:41:51,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:51,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:51,391 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 04:41:51,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:51,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510754265] [2025-01-09 04:41:51,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510754265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:51,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:51,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179938828] [2025-01-09 04:41:51,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:51,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:51,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:51,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:51,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:51,393 INFO L87 Difference]: Start difference. First operand 2251 states and 3122 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:41:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:51,425 INFO L93 Difference]: Finished difference Result 3193 states and 4471 transitions. [2025-01-09 04:41:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:51,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-09 04:41:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:51,432 INFO L225 Difference]: With dead ends: 3193 [2025-01-09 04:41:51,432 INFO L226 Difference]: Without dead ends: 2258 [2025-01-09 04:41:51,434 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 04:41:51,434 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 224 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:51,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 798 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2025-01-09 04:41:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2251. [2025-01-09 04:41:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2251 states, 2247 states have (on average 1.3760569648420116) internal successors, (3092), 2250 states have internal predecessors, (3092), 0 states have call successors, (0), 0 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 04:41:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 3092 transitions. [2025-01-09 04:41:51,453 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 3092 transitions. Word has length 55 [2025-01-09 04:41:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:51,453 INFO L471 AbstractCegarLoop]: Abstraction has 2251 states and 3092 transitions. [2025-01-09 04:41:51,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:41:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 3092 transitions. [2025-01-09 04:41:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:41:51,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:51,455 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] [2025-01-09 04:41:51,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:41:51,455 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:51,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:51,456 INFO L85 PathProgramCache]: Analyzing trace with hash 29096373, now seen corresponding path program 1 times [2025-01-09 04:41:51,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:51,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652162271] [2025-01-09 04:41:51,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:51,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:51,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:41:51,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:41:51,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:51,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:51,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 04:41:51,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:51,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652162271] [2025-01-09 04:41:51,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652162271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:51,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:51,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:51,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692268531] [2025-01-09 04:41:51,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:51,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:51,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:51,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:51,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:51,510 INFO L87 Difference]: Start difference. First operand 2251 states and 3092 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:41:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:51,533 INFO L93 Difference]: Finished difference Result 3252 states and 4507 transitions. [2025-01-09 04:41:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:51,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-09 04:41:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:51,536 INFO L225 Difference]: With dead ends: 3252 [2025-01-09 04:41:51,536 INFO L226 Difference]: Without dead ends: 2257 [2025-01-09 04:41:51,537 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 04:41:51,538 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 240 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:51,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 799 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-01-09 04:41:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2251. [2025-01-09 04:41:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2251 states, 2247 states have (on average 1.3635959056519804) internal successors, (3064), 2250 states have internal predecessors, (3064), 0 states have call successors, (0), 0 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 04:41:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 3064 transitions. [2025-01-09 04:41:51,561 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 3064 transitions. Word has length 55 [2025-01-09 04:41:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:51,561 INFO L471 AbstractCegarLoop]: Abstraction has 2251 states and 3064 transitions. [2025-01-09 04:41:51,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:41:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 3064 transitions. [2025-01-09 04:41:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:41:51,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:51,563 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] [2025-01-09 04:41:51,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:41:51,563 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:51,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1813019801, now seen corresponding path program 1 times [2025-01-09 04:41:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:51,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925962015] [2025-01-09 04:41:51,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:51,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:41:51,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:41:51,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:51,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:51,606 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 04:41:51,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:51,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925962015] [2025-01-09 04:41:51,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925962015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:51,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:51,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:51,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544975796] [2025-01-09 04:41:51,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:51,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:51,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:51,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:51,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:51,608 INFO L87 Difference]: Start difference. First operand 2251 states and 3064 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:41:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:51,633 INFO L93 Difference]: Finished difference Result 3332 states and 4570 transitions. [2025-01-09 04:41:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:51,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-09 04:41:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:51,636 INFO L225 Difference]: With dead ends: 3332 [2025-01-09 04:41:51,637 INFO L226 Difference]: Without dead ends: 2242 [2025-01-09 04:41:51,638 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 04:41:51,639 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 259 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:51,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 814 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2025-01-09 04:41:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2236. [2025-01-09 04:41:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2232 states have (on average 1.3440860215053763) internal successors, (3000), 2235 states have internal predecessors, (3000), 0 states have call successors, (0), 0 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 04:41:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 3000 transitions. [2025-01-09 04:41:51,663 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 3000 transitions. Word has length 55 [2025-01-09 04:41:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:51,663 INFO L471 AbstractCegarLoop]: Abstraction has 2236 states and 3000 transitions. [2025-01-09 04:41:51,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:41:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 3000 transitions. [2025-01-09 04:41:51,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:41:51,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:51,666 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 04:41:51,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:41:51,667 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:51,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:51,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1260356730, now seen corresponding path program 1 times [2025-01-09 04:41:51,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:51,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788823119] [2025-01-09 04:41:51,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:51,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:51,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:41:51,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:41:51,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:51,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:51,711 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 04:41:51,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:51,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788823119] [2025-01-09 04:41:51,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788823119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:51,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:51,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941467355] [2025-01-09 04:41:51,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:51,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:51,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:51,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:51,712 INFO L87 Difference]: Start difference. First operand 2236 states and 3000 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 04:41:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:51,759 INFO L93 Difference]: Finished difference Result 3997 states and 5436 transitions. [2025-01-09 04:41:51,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:51,760 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 04:41:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:51,763 INFO L225 Difference]: With dead ends: 3997 [2025-01-09 04:41:51,764 INFO L226 Difference]: Without dead ends: 2740 [2025-01-09 04:41:51,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 04:41:51,765 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 348 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:51,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 540 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2025-01-09 04:41:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2054. [2025-01-09 04:41:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2050 states have (on average 1.3482926829268294) internal successors, (2764), 2053 states have internal predecessors, (2764), 0 states have call successors, (0), 0 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 04:41:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2764 transitions. [2025-01-09 04:41:51,783 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2764 transitions. Word has length 56 [2025-01-09 04:41:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:51,784 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 2764 transitions. [2025-01-09 04:41:51,784 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 04:41:51,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2764 transitions. [2025-01-09 04:41:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:41:51,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:51,785 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 04:41:51,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:41:51,785 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:51,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash -171160754, now seen corresponding path program 1 times [2025-01-09 04:41:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:51,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838536770] [2025-01-09 04:41:51,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:51,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:51,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:41:51,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:41:51,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:51,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:51,831 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 04:41:51,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:51,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838536770] [2025-01-09 04:41:51,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838536770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:51,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:51,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:51,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336863638] [2025-01-09 04:41:51,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:51,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:51,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:51,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:51,832 INFO L87 Difference]: Start difference. First operand 2054 states and 2764 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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 04:41:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:51,891 INFO L93 Difference]: Finished difference Result 3721 states and 5059 transitions. [2025-01-09 04:41:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:51,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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 04:41:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:51,895 INFO L225 Difference]: With dead ends: 3721 [2025-01-09 04:41:51,895 INFO L226 Difference]: Without dead ends: 2477 [2025-01-09 04:41:51,896 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 04:41:51,896 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 300 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:51,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 458 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-01-09 04:41:51,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1932. [2025-01-09 04:41:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1928 states have (on average 1.3526970954356847) internal successors, (2608), 1931 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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 04:41:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2608 transitions. [2025-01-09 04:41:51,912 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2608 transitions. Word has length 57 [2025-01-09 04:41:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:51,912 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2608 transitions. [2025-01-09 04:41:51,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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 04:41:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2608 transitions. [2025-01-09 04:41:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:41:51,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:51,914 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 04:41:51,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:41:51,914 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:51,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:51,914 INFO L85 PathProgramCache]: Analyzing trace with hash -544179575, now seen corresponding path program 1 times [2025-01-09 04:41:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:51,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727002167] [2025-01-09 04:41:51,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:51,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:51,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:41:51,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:41:51,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:51,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:52,843 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 04:41:52,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:52,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727002167] [2025-01-09 04:41:52,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727002167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:52,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:52,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 04:41:52,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195147264] [2025-01-09 04:41:52,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:52,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 04:41:52,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:52,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 04:41:52,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:41:52,844 INFO L87 Difference]: Start difference. First operand 1932 states and 2608 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 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 04:41:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:54,472 INFO L93 Difference]: Finished difference Result 3365 states and 4573 transitions. [2025-01-09 04:41:54,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 04:41:54,473 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 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 04:41:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:54,479 INFO L225 Difference]: With dead ends: 3365 [2025-01-09 04:41:54,479 INFO L226 Difference]: Without dead ends: 3361 [2025-01-09 04:41:54,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 04:41:54,481 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 3825 mSDsluCounter, 3113 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3825 SdHoareTripleChecker+Valid, 3413 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:54,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3825 Valid, 3413 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:41:54,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2025-01-09 04:41:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 1944. [2025-01-09 04:41:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1940 states have (on average 1.3530927835051547) internal successors, (2625), 1943 states have internal predecessors, (2625), 0 states have call successors, (0), 0 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 04:41:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 2625 transitions. [2025-01-09 04:41:54,500 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 2625 transitions. Word has length 57 [2025-01-09 04:41:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:54,500 INFO L471 AbstractCegarLoop]: Abstraction has 1944 states and 2625 transitions. [2025-01-09 04:41:54,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 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 04:41:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2625 transitions. [2025-01-09 04:41:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:41:54,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:54,502 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 04:41:54,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:41:54,502 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:54,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:54,502 INFO L85 PathProgramCache]: Analyzing trace with hash 303331698, now seen corresponding path program 1 times [2025-01-09 04:41:54,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:54,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079041653] [2025-01-09 04:41:54,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:54,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:54,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:41:54,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:41:54,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:54,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:54,854 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 04:41:54,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:54,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079041653] [2025-01-09 04:41:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079041653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:54,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:54,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:41:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346333396] [2025-01-09 04:41:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:54,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:41:54,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:54,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:41:54,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:41:54,856 INFO L87 Difference]: Start difference. First operand 1944 states and 2625 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 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 04:41:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:55,294 INFO L93 Difference]: Finished difference Result 3846 states and 5260 transitions. [2025-01-09 04:41:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:41:55,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 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 04:41:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:55,299 INFO L225 Difference]: With dead ends: 3846 [2025-01-09 04:41:55,300 INFO L226 Difference]: Without dead ends: 3620 [2025-01-09 04:41:55,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:41:55,301 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 2692 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2692 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:55,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2692 Valid, 1077 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:41:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2025-01-09 04:41:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 1881. [2025-01-09 04:41:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1879 states have (on average 1.3565726450239488) internal successors, (2549), 1880 states have internal predecessors, (2549), 0 states have call successors, (0), 0 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 04:41:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2549 transitions. [2025-01-09 04:41:55,336 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2549 transitions. Word has length 57 [2025-01-09 04:41:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:55,336 INFO L471 AbstractCegarLoop]: Abstraction has 1881 states and 2549 transitions. [2025-01-09 04:41:55,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 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 04:41:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2549 transitions. [2025-01-09 04:41:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 04:41:55,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:55,338 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 04:41:55,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:41:55,338 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:55,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash 114355337, now seen corresponding path program 1 times [2025-01-09 04:41:55,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:55,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308385156] [2025-01-09 04:41:55,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:55,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 04:41:55,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 04:41:55,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:55,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:55,940 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 04:41:55,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:55,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308385156] [2025-01-09 04:41:55,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308385156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:55,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 04:41:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655191981] [2025-01-09 04:41:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:55,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 04:41:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:55,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 04:41:55,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:41:55,941 INFO L87 Difference]: Start difference. First operand 1881 states and 2549 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 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 04:41:56,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:56,859 INFO L93 Difference]: Finished difference Result 3120 states and 4265 transitions. [2025-01-09 04:41:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:41:56,860 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 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 04:41:56,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:56,864 INFO L225 Difference]: With dead ends: 3120 [2025-01-09 04:41:56,864 INFO L226 Difference]: Without dead ends: 3042 [2025-01-09 04:41:56,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:41:56,865 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1094 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:56,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 2521 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:41:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2025-01-09 04:41:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 1872. [2025-01-09 04:41:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.3559593800106895) internal successors, (2537), 1871 states have internal predecessors, (2537), 0 states have call successors, (0), 0 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 04:41:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2537 transitions. [2025-01-09 04:41:56,900 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2537 transitions. Word has length 58 [2025-01-09 04:41:56,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:56,900 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 2537 transitions. [2025-01-09 04:41:56,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 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 04:41:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2537 transitions. [2025-01-09 04:41:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:41:56,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:56,903 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] [2025-01-09 04:41:56,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:41:56,904 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:56,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:56,904 INFO L85 PathProgramCache]: Analyzing trace with hash 485032383, now seen corresponding path program 1 times [2025-01-09 04:41:56,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:56,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175375714] [2025-01-09 04:41:56,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:56,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:56,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:41:56,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:41:56,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:56,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:56,966 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 04:41:56,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:56,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175375714] [2025-01-09 04:41:56,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175375714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:56,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:56,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:41:56,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810640392] [2025-01-09 04:41:56,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:56,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:41:56,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:56,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:41:56,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:41:56,968 INFO L87 Difference]: Start difference. First operand 1872 states and 2537 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:41:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:57,024 INFO L93 Difference]: Finished difference Result 4307 states and 5997 transitions. [2025-01-09 04:41:57,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:41:57,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:41:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:57,029 INFO L225 Difference]: With dead ends: 4307 [2025-01-09 04:41:57,029 INFO L226 Difference]: Without dead ends: 3189 [2025-01-09 04:41:57,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:41:57,031 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 1075 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:57,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 685 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:57,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2025-01-09 04:41:57,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2804. [2025-01-09 04:41:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2804 states, 2803 states have (on average 1.3585444166963967) internal successors, (3808), 2803 states have internal predecessors, (3808), 0 states have call successors, (0), 0 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 04:41:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 3808 transitions. [2025-01-09 04:41:57,054 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 3808 transitions. Word has length 66 [2025-01-09 04:41:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:57,054 INFO L471 AbstractCegarLoop]: Abstraction has 2804 states and 3808 transitions. [2025-01-09 04:41:57,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:41:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 3808 transitions. [2025-01-09 04:41:57,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:41:57,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:57,058 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 04:41:57,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:41:57,059 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:57,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:57,059 INFO L85 PathProgramCache]: Analyzing trace with hash -656464105, now seen corresponding path program 1 times [2025-01-09 04:41:57,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:57,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852745036] [2025-01-09 04:41:57,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:57,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:57,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:41:57,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:41:57,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:57,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:57,134 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 04:41:57,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:57,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852745036] [2025-01-09 04:41:57,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852745036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:57,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:57,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:41:57,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391995263] [2025-01-09 04:41:57,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:57,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:41:57,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:57,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:41:57,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:41:57,136 INFO L87 Difference]: Start difference. First operand 2804 states and 3808 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 04:41:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:57,191 INFO L93 Difference]: Finished difference Result 2810 states and 3811 transitions. [2025-01-09 04:41:57,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:41:57,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 04:41:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:57,198 INFO L225 Difference]: With dead ends: 2810 [2025-01-09 04:41:57,198 INFO L226 Difference]: Without dead ends: 2339 [2025-01-09 04:41:57,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:41:57,200 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 694 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:57,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 813 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2025-01-09 04:41:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2335. [2025-01-09 04:41:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2334 states have (on average 1.361610968294773) internal successors, (3178), 2334 states have internal predecessors, (3178), 0 states have call successors, (0), 0 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 04:41:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3178 transitions. [2025-01-09 04:41:57,220 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3178 transitions. Word has length 67 [2025-01-09 04:41:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:57,220 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3178 transitions. [2025-01-09 04:41:57,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 04:41:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3178 transitions. [2025-01-09 04:41:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:41:57,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:57,223 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, 1] [2025-01-09 04:41:57,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:41:57,224 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:57,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:57,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1272488439, now seen corresponding path program 1 times [2025-01-09 04:41:57,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:57,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693531366] [2025-01-09 04:41:57,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:57,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:57,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:41:57,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:41:57,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:57,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:57,291 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 04:41:57,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:57,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693531366] [2025-01-09 04:41:57,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693531366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:57,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:57,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:57,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718772141] [2025-01-09 04:41:57,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:57,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:57,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:57,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:57,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:57,293 INFO L87 Difference]: Start difference. First operand 2335 states and 3178 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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 04:41:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:57,334 INFO L93 Difference]: Finished difference Result 5431 states and 7502 transitions. [2025-01-09 04:41:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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 68 [2025-01-09 04:41:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:57,340 INFO L225 Difference]: With dead ends: 5431 [2025-01-09 04:41:57,340 INFO L226 Difference]: Without dead ends: 3813 [2025-01-09 04:41:57,341 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 04:41:57,342 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 136 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:57,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 571 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:57,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2025-01-09 04:41:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3563. [2025-01-09 04:41:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.369455362156092) internal successors, (4878), 3562 states have internal predecessors, (4878), 0 states have call successors, (0), 0 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 04:41:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4878 transitions. [2025-01-09 04:41:57,381 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 4878 transitions. Word has length 68 [2025-01-09 04:41:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:57,381 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 4878 transitions. [2025-01-09 04:41:57,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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 04:41:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 4878 transitions. [2025-01-09 04:41:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:41:57,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:57,384 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, 1, 1, 1] [2025-01-09 04:41:57,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:41:57,384 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:57,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:57,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1794430615, now seen corresponding path program 1 times [2025-01-09 04:41:57,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:57,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130110467] [2025-01-09 04:41:57,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:57,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:57,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:41:57,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:41:57,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:57,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:57,465 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 04:41:57,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:57,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130110467] [2025-01-09 04:41:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130110467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:57,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:57,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:57,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113910042] [2025-01-09 04:41:57,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:57,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:57,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:57,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:57,467 INFO L87 Difference]: Start difference. First operand 3563 states and 4878 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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 04:41:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:57,499 INFO L93 Difference]: Finished difference Result 8823 states and 12160 transitions. [2025-01-09 04:41:57,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:57,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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 70 [2025-01-09 04:41:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:57,508 INFO L225 Difference]: With dead ends: 8823 [2025-01-09 04:41:57,508 INFO L226 Difference]: Without dead ends: 5827 [2025-01-09 04:41:57,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 04:41:57,512 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 132 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:57,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 567 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5827 states. [2025-01-09 04:41:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5827 to 5409. [2025-01-09 04:41:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5409 states, 5408 states have (on average 1.3594674556213018) internal successors, (7352), 5408 states have internal predecessors, (7352), 0 states have call successors, (0), 0 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 04:41:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5409 states to 5409 states and 7352 transitions. [2025-01-09 04:41:57,569 INFO L78 Accepts]: Start accepts. Automaton has 5409 states and 7352 transitions. Word has length 70 [2025-01-09 04:41:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:57,569 INFO L471 AbstractCegarLoop]: Abstraction has 5409 states and 7352 transitions. [2025-01-09 04:41:57,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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 04:41:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 5409 states and 7352 transitions. [2025-01-09 04:41:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:41:57,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:57,572 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, 1, 1, 1] [2025-01-09 04:41:57,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:41:57,572 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:57,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash -530798665, now seen corresponding path program 1 times [2025-01-09 04:41:57,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:57,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172570282] [2025-01-09 04:41:57,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:57,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:41:57,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:41:57,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:57,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:57,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:57,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172570282] [2025-01-09 04:41:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172570282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:57,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:57,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:57,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749386658] [2025-01-09 04:41:57,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:57,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:57,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:57,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:57,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:57,640 INFO L87 Difference]: Start difference. First operand 5409 states and 7352 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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 04:41:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:57,688 INFO L93 Difference]: Finished difference Result 14533 states and 19882 transitions. [2025-01-09 04:41:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:57,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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 70 [2025-01-09 04:41:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:57,703 INFO L225 Difference]: With dead ends: 14533 [2025-01-09 04:41:57,703 INFO L226 Difference]: Without dead ends: 9691 [2025-01-09 04:41:57,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:57,710 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 101 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:57,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 548 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2025-01-09 04:41:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 8857. [2025-01-09 04:41:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8857 states, 8856 states have (on average 1.3563685636856369) internal successors, (12012), 8856 states have internal predecessors, (12012), 0 states have call successors, (0), 0 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 04:41:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8857 states to 8857 states and 12012 transitions. [2025-01-09 04:41:57,824 INFO L78 Accepts]: Start accepts. Automaton has 8857 states and 12012 transitions. Word has length 70 [2025-01-09 04:41:57,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:57,825 INFO L471 AbstractCegarLoop]: Abstraction has 8857 states and 12012 transitions. [2025-01-09 04:41:57,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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 04:41:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 8857 states and 12012 transitions. [2025-01-09 04:41:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:41:57,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:57,827 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, 1, 1, 1, 1, 1] [2025-01-09 04:41:57,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:41:57,827 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:57,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:57,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1176069985, now seen corresponding path program 1 times [2025-01-09 04:41:57,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:57,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420140946] [2025-01-09 04:41:57,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:57,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:57,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:41:57,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:41:57,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:57,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:57,965 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 04:41:57,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420140946] [2025-01-09 04:41:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420140946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:57,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:57,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:41:57,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187854108] [2025-01-09 04:41:57,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:57,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:41:57,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:57,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:41:57,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:41:57,967 INFO L87 Difference]: Start difference. First operand 8857 states and 12012 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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 04:41:58,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:58,001 INFO L93 Difference]: Finished difference Result 9771 states and 13229 transitions. [2025-01-09 04:41:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:41:58,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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 72 [2025-01-09 04:41:58,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:58,014 INFO L225 Difference]: With dead ends: 9771 [2025-01-09 04:41:58,015 INFO L226 Difference]: Without dead ends: 9769 [2025-01-09 04:41:58,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:41:58,018 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:58,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1365 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2025-01-09 04:41:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 9769. [2025-01-09 04:41:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9769 states, 9768 states have (on average 1.3230958230958232) internal successors, (12924), 9768 states have internal predecessors, (12924), 0 states have call successors, (0), 0 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 04:41:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9769 states to 9769 states and 12924 transitions. [2025-01-09 04:41:58,140 INFO L78 Accepts]: Start accepts. Automaton has 9769 states and 12924 transitions. Word has length 72 [2025-01-09 04:41:58,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:58,140 INFO L471 AbstractCegarLoop]: Abstraction has 9769 states and 12924 transitions. [2025-01-09 04:41:58,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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 04:41:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 9769 states and 12924 transitions. [2025-01-09 04:41:58,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:41:58,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:58,143 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, 1, 1, 1, 1, 1, 1] [2025-01-09 04:41:58,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:41:58,143 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:58,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash 406807320, now seen corresponding path program 1 times [2025-01-09 04:41:58,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:58,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685532129] [2025-01-09 04:41:58,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:58,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:58,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:41:58,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:41:58,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:58,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:58,181 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 04:41:58,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:58,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685532129] [2025-01-09 04:41:58,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685532129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:58,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:58,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:58,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17484718] [2025-01-09 04:41:58,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:58,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:58,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:58,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:58,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:58,183 INFO L87 Difference]: Start difference. First operand 9769 states and 12924 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 04:41:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:58,253 INFO L93 Difference]: Finished difference Result 23633 states and 31330 transitions. [2025-01-09 04:41:58,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:58,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-01-09 04:41:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:58,272 INFO L225 Difference]: With dead ends: 23633 [2025-01-09 04:41:58,273 INFO L226 Difference]: Without dead ends: 14431 [2025-01-09 04:41:58,281 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 04:41:58,281 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 194 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:58,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 403 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14431 states. [2025-01-09 04:41:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14431 to 14277. [2025-01-09 04:41:58,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14277 states, 14276 states have (on average 1.3034463435135892) internal successors, (18608), 14276 states have internal predecessors, (18608), 0 states have call successors, (0), 0 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 04:41:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14277 states to 14277 states and 18608 transitions. [2025-01-09 04:41:58,401 INFO L78 Accepts]: Start accepts. Automaton has 14277 states and 18608 transitions. Word has length 73 [2025-01-09 04:41:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:58,401 INFO L471 AbstractCegarLoop]: Abstraction has 14277 states and 18608 transitions. [2025-01-09 04:41:58,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 04:41:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 14277 states and 18608 transitions. [2025-01-09 04:41:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:41:58,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:58,404 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:41:58,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:41:58,404 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:58,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1519050461, now seen corresponding path program 1 times [2025-01-09 04:41:58,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:58,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246694420] [2025-01-09 04:41:58,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:58,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:58,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:41:58,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:41:58,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:58,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:58,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:58,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246694420] [2025-01-09 04:41:58,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246694420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:58,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:58,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:41:58,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296792611] [2025-01-09 04:41:58,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:58,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:41:58,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:58,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:41:58,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:41:58,522 INFO L87 Difference]: Start difference. First operand 14277 states and 18608 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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 04:41:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:58,611 INFO L93 Difference]: Finished difference Result 20795 states and 27257 transitions. [2025-01-09 04:41:58,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:41:58,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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 74 [2025-01-09 04:41:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:58,638 INFO L225 Difference]: With dead ends: 20795 [2025-01-09 04:41:58,639 INFO L226 Difference]: Without dead ends: 17319 [2025-01-09 04:41:58,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:41:58,648 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 656 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:58,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 812 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:58,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17319 states. [2025-01-09 04:41:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17319 to 16143. [2025-01-09 04:41:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16143 states, 16142 states have (on average 1.2995291785404535) internal successors, (20977), 16142 states have internal predecessors, (20977), 0 states have call successors, (0), 0 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 04:41:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16143 states to 16143 states and 20977 transitions. [2025-01-09 04:41:58,791 INFO L78 Accepts]: Start accepts. Automaton has 16143 states and 20977 transitions. Word has length 74 [2025-01-09 04:41:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:58,791 INFO L471 AbstractCegarLoop]: Abstraction has 16143 states and 20977 transitions. [2025-01-09 04:41:58,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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 04:41:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 16143 states and 20977 transitions. [2025-01-09 04:41:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:41:58,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:58,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:41:58,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:41:58,794 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:58,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:58,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1077353059, now seen corresponding path program 1 times [2025-01-09 04:41:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:58,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465791046] [2025-01-09 04:41:58,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:58,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:58,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:41:58,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:41:58,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:58,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:58,891 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 04:41:58,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:58,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465791046] [2025-01-09 04:41:58,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465791046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:58,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:58,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:41:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456604948] [2025-01-09 04:41:58,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:58,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:41:58,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:58,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:41:58,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:41:58,893 INFO L87 Difference]: Start difference. First operand 16143 states and 20977 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:41:58,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:58,981 INFO L93 Difference]: Finished difference Result 21791 states and 28461 transitions. [2025-01-09 04:41:58,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:41:58,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 04:41:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:59,008 INFO L225 Difference]: With dead ends: 21791 [2025-01-09 04:41:59,008 INFO L226 Difference]: Without dead ends: 18387 [2025-01-09 04:41:59,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:41:59,015 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 669 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:59,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 800 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:59,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18387 states. [2025-01-09 04:41:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18387 to 17977. [2025-01-09 04:41:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17977 states, 17976 states have (on average 1.2962283044058744) internal successors, (23301), 17976 states have internal predecessors, (23301), 0 states have call successors, (0), 0 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 04:41:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17977 states to 17977 states and 23301 transitions. [2025-01-09 04:41:59,213 INFO L78 Accepts]: Start accepts. Automaton has 17977 states and 23301 transitions. Word has length 76 [2025-01-09 04:41:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:59,213 INFO L471 AbstractCegarLoop]: Abstraction has 17977 states and 23301 transitions. [2025-01-09 04:41:59,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:41:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 17977 states and 23301 transitions. [2025-01-09 04:41:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:41:59,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:59,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:41:59,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:41:59,220 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:59,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:59,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1899335398, now seen corresponding path program 1 times [2025-01-09 04:41:59,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:59,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744935747] [2025-01-09 04:41:59,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:59,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:59,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:41:59,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:41:59,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:59,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:41:59,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:59,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744935747] [2025-01-09 04:41:59,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744935747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:59,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:59,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:41:59,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894524423] [2025-01-09 04:41:59,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:59,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:41:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:59,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:41:59,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:41:59,442 INFO L87 Difference]: Start difference. First operand 17977 states and 23301 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 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 04:41:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:59,926 INFO L93 Difference]: Finished difference Result 37782 states and 48847 transitions. [2025-01-09 04:41:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:41:59,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 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 92 [2025-01-09 04:41:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:59,971 INFO L225 Difference]: With dead ends: 37782 [2025-01-09 04:41:59,972 INFO L226 Difference]: Without dead ends: 28784 [2025-01-09 04:41:59,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:41:59,987 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 1236 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:59,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 978 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:42:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28784 states. [2025-01-09 04:42:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28784 to 17919. [2025-01-09 04:42:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17919 states, 17918 states have (on average 1.296461658667262) internal successors, (23230), 17918 states have internal predecessors, (23230), 0 states have call successors, (0), 0 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 04:42:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17919 states to 17919 states and 23230 transitions. [2025-01-09 04:42:00,242 INFO L78 Accepts]: Start accepts. Automaton has 17919 states and 23230 transitions. Word has length 92 [2025-01-09 04:42:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:00,242 INFO L471 AbstractCegarLoop]: Abstraction has 17919 states and 23230 transitions. [2025-01-09 04:42:00,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 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 04:42:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 17919 states and 23230 transitions. [2025-01-09 04:42:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:42:00,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:00,248 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:00,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:42:00,248 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:00,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1332578409, now seen corresponding path program 1 times [2025-01-09 04:42:00,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:00,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135090045] [2025-01-09 04:42:00,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:00,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:00,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:42:00,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:42:00,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:00,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:00,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:00,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135090045] [2025-01-09 04:42:00,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135090045] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:42:00,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77766783] [2025-01-09 04:42:00,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:00,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:00,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:00,487 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 04:42:00,490 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 04:42:00,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:42:00,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:42:00,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:00,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:00,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:42:00,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:42:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:01,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:42:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77766783] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:42:02,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:42:02,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-01-09 04:42:02,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380023513] [2025-01-09 04:42:02,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:42:02,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 04:42:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:02,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 04:42:02,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:42:02,104 INFO L87 Difference]: Start difference. First operand 17919 states and 23230 transitions. Second operand has 26 states, 26 states have (on average 9.0) internal successors, (234), 25 states have internal predecessors, (234), 0 states have call successors, (0), 0 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 04:42:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:03,265 INFO L93 Difference]: Finished difference Result 51844 states and 67174 transitions. [2025-01-09 04:42:03,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 04:42:03,266 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.0) internal successors, (234), 25 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 04:42:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:03,318 INFO L225 Difference]: With dead ends: 51844 [2025-01-09 04:42:03,318 INFO L226 Difference]: Without dead ends: 42388 [2025-01-09 04:42:03,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=542, Invalid=1714, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 04:42:03,337 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 2733 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:03,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 1997 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:42:03,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42388 states. [2025-01-09 04:42:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42388 to 31793. [2025-01-09 04:42:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31793 states, 31792 states have (on average 1.295137141419225) internal successors, (41175), 31792 states have internal predecessors, (41175), 0 states have call successors, (0), 0 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 04:42:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31793 states to 31793 states and 41175 transitions. [2025-01-09 04:42:03,690 INFO L78 Accepts]: Start accepts. Automaton has 31793 states and 41175 transitions. Word has length 92 [2025-01-09 04:42:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:03,690 INFO L471 AbstractCegarLoop]: Abstraction has 31793 states and 41175 transitions. [2025-01-09 04:42:03,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.0) internal successors, (234), 25 states have internal predecessors, (234), 0 states have call successors, (0), 0 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 04:42:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 31793 states and 41175 transitions. [2025-01-09 04:42:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:42:03,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:03,699 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:42:03,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:42:03,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:03,904 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:03,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:03,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1785022088, now seen corresponding path program 1 times [2025-01-09 04:42:03,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:03,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305320389] [2025-01-09 04:42:03,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:03,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:03,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:42:03,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:42:03,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:03,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:04,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:04,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305320389] [2025-01-09 04:42:04,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305320389] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:42:04,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878749193] [2025-01-09 04:42:04,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:04,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:04,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:04,086 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 04:42:04,088 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 04:42:04,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:42:04,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:42:04,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:04,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:04,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 04:42:04,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:42:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:05,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:42:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:06,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878749193] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:42:06,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:42:06,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-01-09 04:42:06,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805667083] [2025-01-09 04:42:06,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:42:06,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 04:42:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:06,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 04:42:06,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:42:06,278 INFO L87 Difference]: Start difference. First operand 31793 states and 41175 transitions. Second operand has 30 states, 30 states have (on average 7.766666666666667) internal successors, (233), 29 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:13,961 INFO L93 Difference]: Finished difference Result 157604 states and 201483 transitions. [2025-01-09 04:42:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2025-01-09 04:42:13,961 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.766666666666667) internal successors, (233), 29 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 04:42:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:14,361 INFO L225 Difference]: With dead ends: 157604 [2025-01-09 04:42:14,361 INFO L226 Difference]: Without dead ends: 143258 [2025-01-09 04:42:14,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7391 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4110, Invalid=17352, Unknown=0, NotChecked=0, Total=21462 [2025-01-09 04:42:14,458 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 5320 mSDsluCounter, 5948 mSDsCounter, 0 mSdLazyCounter, 5787 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5320 SdHoareTripleChecker+Valid, 6358 SdHoareTripleChecker+Invalid, 5910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 5787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:14,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5320 Valid, 6358 Invalid, 5910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 5787 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 04:42:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143258 states. [2025-01-09 04:42:15,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143258 to 32883. [2025-01-09 04:42:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32883 states, 32882 states have (on average 1.2929870445836629) internal successors, (42516), 32882 states have internal predecessors, (42516), 0 states have call successors, (0), 0 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 04:42:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32883 states to 32883 states and 42516 transitions. [2025-01-09 04:42:15,520 INFO L78 Accepts]: Start accepts. Automaton has 32883 states and 42516 transitions. Word has length 93 [2025-01-09 04:42:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:15,520 INFO L471 AbstractCegarLoop]: Abstraction has 32883 states and 42516 transitions. [2025-01-09 04:42:15,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.766666666666667) internal successors, (233), 29 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 32883 states and 42516 transitions. [2025-01-09 04:42:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:42:15,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:15,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:42:15,537 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 04:42:15,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:15,730 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:15,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:15,731 INFO L85 PathProgramCache]: Analyzing trace with hash 85404025, now seen corresponding path program 1 times [2025-01-09 04:42:15,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:15,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350676583] [2025-01-09 04:42:15,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:15,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:15,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:42:15,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:42:15,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:15,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:16,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:16,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350676583] [2025-01-09 04:42:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350676583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:16,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:16,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:42:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335876408] [2025-01-09 04:42:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:16,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:42:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:16,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:42:16,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:42:16,033 INFO L87 Difference]: Start difference. First operand 32883 states and 42516 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 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 04:42:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:16,632 INFO L93 Difference]: Finished difference Result 76366 states and 98364 transitions. [2025-01-09 04:42:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:42:16,632 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 04:42:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:16,703 INFO L225 Difference]: With dead ends: 76366 [2025-01-09 04:42:16,703 INFO L226 Difference]: Without dead ends: 60113 [2025-01-09 04:42:16,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:42:16,727 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 1148 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:16,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 1030 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:42:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60113 states. [2025-01-09 04:42:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60113 to 51716. [2025-01-09 04:42:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51716 states, 51715 states have (on average 1.2920622643333655) internal successors, (66819), 51715 states have internal predecessors, (66819), 0 states have call successors, (0), 0 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 04:42:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51716 states to 51716 states and 66819 transitions. [2025-01-09 04:42:17,400 INFO L78 Accepts]: Start accepts. Automaton has 51716 states and 66819 transitions. Word has length 93 [2025-01-09 04:42:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:17,400 INFO L471 AbstractCegarLoop]: Abstraction has 51716 states and 66819 transitions. [2025-01-09 04:42:17,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 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 04:42:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 51716 states and 66819 transitions. [2025-01-09 04:42:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:42:17,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:17,411 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:17,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:42:17,412 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:17,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:17,412 INFO L85 PathProgramCache]: Analyzing trace with hash -182703358, now seen corresponding path program 1 times [2025-01-09 04:42:17,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:17,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052736344] [2025-01-09 04:42:17,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:17,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:17,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:42:17,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:42:17,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:17,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:17,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:17,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052736344] [2025-01-09 04:42:17,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052736344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:17,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:17,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:17,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646641354] [2025-01-09 04:42:17,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:17,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:17,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:17,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:17,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:17,464 INFO L87 Difference]: Start difference. First operand 51716 states and 66819 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 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 04:42:17,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:17,664 INFO L93 Difference]: Finished difference Result 101299 states and 131089 transitions. [2025-01-09 04:42:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:17,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 04:42:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:17,722 INFO L225 Difference]: With dead ends: 101299 [2025-01-09 04:42:17,723 INFO L226 Difference]: Without dead ends: 51718 [2025-01-09 04:42:17,755 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 04:42:17,756 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 129 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:17,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 477 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51718 states. [2025-01-09 04:42:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51718 to 49967. [2025-01-09 04:42:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49967 states, 49966 states have (on average 1.2731857663210984) internal successors, (63616), 49966 states have internal predecessors, (63616), 0 states have call successors, (0), 0 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 04:42:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49967 states to 49967 states and 63616 transitions. [2025-01-09 04:42:18,624 INFO L78 Accepts]: Start accepts. Automaton has 49967 states and 63616 transitions. Word has length 93 [2025-01-09 04:42:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:18,624 INFO L471 AbstractCegarLoop]: Abstraction has 49967 states and 63616 transitions. [2025-01-09 04:42:18,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 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 04:42:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 49967 states and 63616 transitions. [2025-01-09 04:42:18,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:42:18,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:18,641 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:42:18,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:42:18,641 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:18,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:18,642 INFO L85 PathProgramCache]: Analyzing trace with hash 458653883, now seen corresponding path program 1 times [2025-01-09 04:42:18,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:18,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542389381] [2025-01-09 04:42:18,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:18,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:42:18,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:42:18,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:18,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:42:18,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542389381] [2025-01-09 04:42:18,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542389381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:18,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:18,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:42:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692813026] [2025-01-09 04:42:18,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:18,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:42:18,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:18,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:42:18,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:42:18,876 INFO L87 Difference]: Start difference. First operand 49967 states and 63616 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 04:42:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:19,371 INFO L93 Difference]: Finished difference Result 85359 states and 108443 transitions. [2025-01-09 04:42:19,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:42:19,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 93 [2025-01-09 04:42:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:19,428 INFO L225 Difference]: With dead ends: 85359 [2025-01-09 04:42:19,429 INFO L226 Difference]: Without dead ends: 50784 [2025-01-09 04:42:19,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:42:19,459 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1105 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:19,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 749 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:42:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50784 states. [2025-01-09 04:42:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50784 to 49887. [2025-01-09 04:42:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49887 states, 49886 states have (on average 1.2733031311389968) internal successors, (63520), 49886 states have internal predecessors, (63520), 0 states have call successors, (0), 0 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 04:42:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49887 states to 49887 states and 63520 transitions. [2025-01-09 04:42:20,335 INFO L78 Accepts]: Start accepts. Automaton has 49887 states and 63520 transitions. Word has length 93 [2025-01-09 04:42:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:20,335 INFO L471 AbstractCegarLoop]: Abstraction has 49887 states and 63520 transitions. [2025-01-09 04:42:20,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 04:42:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 49887 states and 63520 transitions. [2025-01-09 04:42:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:42:20,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:20,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:42:20,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:42:20,343 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:20,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1283755961, now seen corresponding path program 1 times [2025-01-09 04:42:20,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:20,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435243624] [2025-01-09 04:42:20,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:20,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:42:20,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:42:20,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:20,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:42:20,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:20,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435243624] [2025-01-09 04:42:20,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435243624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:20,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:20,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:20,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105086158] [2025-01-09 04:42:20,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:20,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:20,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:20,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:20,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:20,377 INFO L87 Difference]: Start difference. First operand 49887 states and 63520 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 04:42:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:20,628 INFO L93 Difference]: Finished difference Result 97553 states and 124462 transitions. [2025-01-09 04:42:20,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:20,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 94 [2025-01-09 04:42:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:20,685 INFO L225 Difference]: With dead ends: 97553 [2025-01-09 04:42:20,686 INFO L226 Difference]: Without dead ends: 49425 [2025-01-09 04:42:20,910 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 04:42:20,911 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 204 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:20,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 269 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:20,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49425 states. [2025-01-09 04:42:21,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49425 to 49425. [2025-01-09 04:42:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49425 states, 49424 states have (on average 1.2607842343800584) internal successors, (62313), 49424 states have internal predecessors, (62313), 0 states have call successors, (0), 0 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 04:42:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49425 states to 49425 states and 62313 transitions. [2025-01-09 04:42:21,550 INFO L78 Accepts]: Start accepts. Automaton has 49425 states and 62313 transitions. Word has length 94 [2025-01-09 04:42:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:21,550 INFO L471 AbstractCegarLoop]: Abstraction has 49425 states and 62313 transitions. [2025-01-09 04:42:21,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 04:42:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 49425 states and 62313 transitions. [2025-01-09 04:42:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:42:21,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:21,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:42:21,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:42:21,560 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:21,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1271165246, now seen corresponding path program 1 times [2025-01-09 04:42:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:21,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178005394] [2025-01-09 04:42:21,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:21,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:21,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:42:21,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:42:21,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:21,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:21,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:21,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178005394] [2025-01-09 04:42:21,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178005394] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:42:21,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45511862] [2025-01-09 04:42:21,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:21,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:21,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:21,750 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 04:42:21,755 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 04:42:22,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:42:22,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:42:22,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:22,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:22,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:42:22,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:42:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:22,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:42:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:22,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45511862] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:42:22,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:42:22,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 04:42:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943304076] [2025-01-09 04:42:22,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:42:22,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:42:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:22,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:42:22,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:42:22,380 INFO L87 Difference]: Start difference. First operand 49425 states and 62313 transitions. Second operand has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:22,648 INFO L93 Difference]: Finished difference Result 142601 states and 178600 transitions. [2025-01-09 04:42:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:42:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 04:42:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:22,757 INFO L225 Difference]: With dead ends: 142601 [2025-01-09 04:42:22,757 INFO L226 Difference]: Without dead ends: 95117 [2025-01-09 04:42:22,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:42:22,802 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 770 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:22,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1096 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:23,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95117 states. [2025-01-09 04:42:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95117 to 74015. [2025-01-09 04:42:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74015 states, 74014 states have (on average 1.2528305455724593) internal successors, (92727), 74014 states have internal predecessors, (92727), 0 states have call successors, (0), 0 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 04:42:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74015 states to 74015 states and 92727 transitions. [2025-01-09 04:42:23,846 INFO L78 Accepts]: Start accepts. Automaton has 74015 states and 92727 transitions. Word has length 94 [2025-01-09 04:42:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:23,847 INFO L471 AbstractCegarLoop]: Abstraction has 74015 states and 92727 transitions. [2025-01-09 04:42:23,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 74015 states and 92727 transitions. [2025-01-09 04:42:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:42:23,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:23,854 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:23,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:42:24,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:24,057 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:24,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1318361125, now seen corresponding path program 1 times [2025-01-09 04:42:24,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:24,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972047101] [2025-01-09 04:42:24,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:24,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:24,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:42:24,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:42:24,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:24,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:24,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:24,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972047101] [2025-01-09 04:42:24,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972047101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:24,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:24,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:42:24,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357326602] [2025-01-09 04:42:24,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:24,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:24,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:24,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:24,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:24,325 INFO L87 Difference]: Start difference. First operand 74015 states and 92727 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 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 04:42:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:24,847 INFO L93 Difference]: Finished difference Result 140944 states and 176572 transitions. [2025-01-09 04:42:24,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:42:24,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-09 04:42:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:24,927 INFO L225 Difference]: With dead ends: 140944 [2025-01-09 04:42:24,927 INFO L226 Difference]: Without dead ends: 68156 [2025-01-09 04:42:24,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:24,947 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 468 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:24,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 486 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:42:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68156 states. [2025-01-09 04:42:25,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68156 to 67151. [2025-01-09 04:42:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67151 states, 67150 states have (on average 1.228577810871184) internal successors, (82499), 67150 states have internal predecessors, (82499), 0 states have call successors, (0), 0 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 04:42:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67151 states to 67151 states and 82499 transitions. [2025-01-09 04:42:25,688 INFO L78 Accepts]: Start accepts. Automaton has 67151 states and 82499 transitions. Word has length 95 [2025-01-09 04:42:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:25,688 INFO L471 AbstractCegarLoop]: Abstraction has 67151 states and 82499 transitions. [2025-01-09 04:42:25,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 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 04:42:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 67151 states and 82499 transitions. [2025-01-09 04:42:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:42:25,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:25,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:25,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:42:25,697 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:25,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:25,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1373598289, now seen corresponding path program 1 times [2025-01-09 04:42:25,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:25,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236997858] [2025-01-09 04:42:25,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:25,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:25,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:42:25,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:42:25,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:25,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:25,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:25,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236997858] [2025-01-09 04:42:25,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236997858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:25,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:25,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:42:25,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277535887] [2025-01-09 04:42:25,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:25,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:25,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:25,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:25,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:25,911 INFO L87 Difference]: Start difference. First operand 67151 states and 82499 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 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 04:42:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:26,082 INFO L93 Difference]: Finished difference Result 80956 states and 99967 transitions. [2025-01-09 04:42:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:26,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:42:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:26,162 INFO L225 Difference]: With dead ends: 80956 [2025-01-09 04:42:26,162 INFO L226 Difference]: Without dead ends: 74453 [2025-01-09 04:42:26,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:26,188 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 568 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:26,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 835 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74453 states. [2025-01-09 04:42:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74453 to 72391. [2025-01-09 04:42:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72391 states, 72390 states have (on average 1.2281392457521758) internal successors, (88905), 72390 states have internal predecessors, (88905), 0 states have call successors, (0), 0 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 04:42:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72391 states to 72391 states and 88905 transitions. [2025-01-09 04:42:26,936 INFO L78 Accepts]: Start accepts. Automaton has 72391 states and 88905 transitions. Word has length 99 [2025-01-09 04:42:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:26,937 INFO L471 AbstractCegarLoop]: Abstraction has 72391 states and 88905 transitions. [2025-01-09 04:42:26,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 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 04:42:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 72391 states and 88905 transitions. [2025-01-09 04:42:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:42:27,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:27,062 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:27,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:42:27,063 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:27,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:27,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1074075595, now seen corresponding path program 1 times [2025-01-09 04:42:27,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:27,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300375866] [2025-01-09 04:42:27,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:27,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:42:27,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:42:27,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:27,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:42:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300375866] [2025-01-09 04:42:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300375866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:27,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:27,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987862138] [2025-01-09 04:42:27,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:27,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:27,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:27,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:27,104 INFO L87 Difference]: Start difference. First operand 72391 states and 88905 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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 04:42:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:27,368 INFO L93 Difference]: Finished difference Result 136693 states and 168032 transitions. [2025-01-09 04:42:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:27,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 99 [2025-01-09 04:42:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:27,446 INFO L225 Difference]: With dead ends: 136693 [2025-01-09 04:42:27,446 INFO L226 Difference]: Without dead ends: 65506 [2025-01-09 04:42:27,491 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 04:42:27,492 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 200 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:27,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 244 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65506 states. [2025-01-09 04:42:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65506 to 63955. [2025-01-09 04:42:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63955 states, 63954 states have (on average 1.2099946836788942) internal successors, (77384), 63954 states have internal predecessors, (77384), 0 states have call successors, (0), 0 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 04:42:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63955 states to 63955 states and 77384 transitions. [2025-01-09 04:42:28,300 INFO L78 Accepts]: Start accepts. Automaton has 63955 states and 77384 transitions. Word has length 99 [2025-01-09 04:42:28,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:28,300 INFO L471 AbstractCegarLoop]: Abstraction has 63955 states and 77384 transitions. [2025-01-09 04:42:28,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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 04:42:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 63955 states and 77384 transitions. [2025-01-09 04:42:28,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:42:28,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:28,313 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:28,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 04:42:28,313 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:28,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:28,317 INFO L85 PathProgramCache]: Analyzing trace with hash 499763754, now seen corresponding path program 1 times [2025-01-09 04:42:28,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916210676] [2025-01-09 04:42:28,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:28,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:42:28,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:42:28,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:28,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:28,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:28,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916210676] [2025-01-09 04:42:28,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916210676] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:42:28,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76196435] [2025-01-09 04:42:28,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:28,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:28,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:28,451 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 04:42:28,453 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 04:42:28,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:42:28,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:42:28,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:28,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:28,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:42:28,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:42:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:29,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:42:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:29,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76196435] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:42:29,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:42:29,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-01-09 04:42:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721321737] [2025-01-09 04:42:29,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:42:29,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:42:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:29,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:42:29,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:42:29,117 INFO L87 Difference]: Start difference. First operand 63955 states and 77384 transitions. Second operand has 14 states, 14 states have (on average 19.0) internal successors, (266), 14 states have internal predecessors, (266), 0 states have call successors, (0), 0 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 04:42:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:29,630 INFO L93 Difference]: Finished difference Result 130188 states and 157166 transitions. [2025-01-09 04:42:29,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:42:29,631 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.0) internal successors, (266), 14 states have internal predecessors, (266), 0 states have call successors, (0), 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 100 [2025-01-09 04:42:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:29,715 INFO L225 Difference]: With dead ends: 130188 [2025-01-09 04:42:29,715 INFO L226 Difference]: Without dead ends: 80684 [2025-01-09 04:42:29,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:42:29,755 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 2010 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:29,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 978 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:42:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80684 states. [2025-01-09 04:42:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80684 to 67871. [2025-01-09 04:42:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67871 states, 67870 states have (on average 1.206807131280389) internal successors, (81906), 67870 states have internal predecessors, (81906), 0 states have call successors, (0), 0 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 04:42:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67871 states to 67871 states and 81906 transitions. [2025-01-09 04:42:30,490 INFO L78 Accepts]: Start accepts. Automaton has 67871 states and 81906 transitions. Word has length 100 [2025-01-09 04:42:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:30,490 INFO L471 AbstractCegarLoop]: Abstraction has 67871 states and 81906 transitions. [2025-01-09 04:42:30,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.0) internal successors, (266), 14 states have internal predecessors, (266), 0 states have call successors, (0), 0 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 04:42:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 67871 states and 81906 transitions. [2025-01-09 04:42:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 04:42:30,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:30,499 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:30,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 04:42:30,702 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,SelfDestructingSolverStorable40 [2025-01-09 04:42:30,703 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:30,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash 584387519, now seen corresponding path program 1 times [2025-01-09 04:42:30,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:30,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944782420] [2025-01-09 04:42:30,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:30,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:30,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 04:42:30,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 04:42:30,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:30,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:42:30,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:30,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944782420] [2025-01-09 04:42:30,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944782420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:30,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:30,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:42:30,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604777297] [2025-01-09 04:42:30,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:30,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:42:30,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:30,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:42:30,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:30,773 INFO L87 Difference]: Start difference. First operand 67871 states and 81906 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 04:42:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:31,303 INFO L93 Difference]: Finished difference Result 99379 states and 118203 transitions. [2025-01-09 04:42:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:42:31,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 102 [2025-01-09 04:42:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:31,381 INFO L225 Difference]: With dead ends: 99379 [2025-01-09 04:42:31,382 INFO L226 Difference]: Without dead ends: 86425 [2025-01-09 04:42:31,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:42:31,406 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1263 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:31,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 474 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:42:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86425 states. [2025-01-09 04:42:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86425 to 67921. [2025-01-09 04:42:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67921 states, 67920 states have (on average 1.2067432273262662) internal successors, (81962), 67920 states have internal predecessors, (81962), 0 states have call successors, (0), 0 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 04:42:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67921 states to 67921 states and 81962 transitions. [2025-01-09 04:42:32,221 INFO L78 Accepts]: Start accepts. Automaton has 67921 states and 81962 transitions. Word has length 102 [2025-01-09 04:42:32,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:32,222 INFO L471 AbstractCegarLoop]: Abstraction has 67921 states and 81962 transitions. [2025-01-09 04:42:32,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 04:42:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 67921 states and 81962 transitions. [2025-01-09 04:42:32,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:42:32,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:32,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:32,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:42:32,231 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:32,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash 12009594, now seen corresponding path program 1 times [2025-01-09 04:42:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943447032] [2025-01-09 04:42:32,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:32,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:42:32,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:42:32,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:32,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:32,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:32,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943447032] [2025-01-09 04:42:32,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943447032] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:42:32,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338136787] [2025-01-09 04:42:32,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:32,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:32,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:32,316 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 04:42:32,318 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 04:42:32,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:42:32,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:42:32,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:32,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:32,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:42:32,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:42:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:32,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:42:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:32,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338136787] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:42:32,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:42:32,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-01-09 04:42:32,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986798173] [2025-01-09 04:42:32,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:42:32,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:42:32,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:32,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:42:32,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:42:32,876 INFO L87 Difference]: Start difference. First operand 67921 states and 81962 transitions. Second operand has 14 states, 14 states have (on average 20.214285714285715) internal successors, (283), 14 states have internal predecessors, (283), 0 states have call successors, (0), 0 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 04:42:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:33,803 INFO L93 Difference]: Finished difference Result 153360 states and 183800 transitions. [2025-01-09 04:42:33,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:42:33,804 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.214285714285715) internal successors, (283), 14 states have internal predecessors, (283), 0 states have call successors, (0), 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 103 [2025-01-09 04:42:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:33,926 INFO L225 Difference]: With dead ends: 153360 [2025-01-09 04:42:33,927 INFO L226 Difference]: Without dead ends: 87058 [2025-01-09 04:42:33,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:42:33,948 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1534 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:33,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 885 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:42:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87058 states. [2025-01-09 04:42:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87058 to 74528. [2025-01-09 04:42:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74528 states, 74527 states have (on average 1.1963046949427725) internal successors, (89157), 74527 states have internal predecessors, (89157), 0 states have call successors, (0), 0 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 04:42:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74528 states to 74528 states and 89157 transitions. [2025-01-09 04:42:35,093 INFO L78 Accepts]: Start accepts. Automaton has 74528 states and 89157 transitions. Word has length 103 [2025-01-09 04:42:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:35,093 INFO L471 AbstractCegarLoop]: Abstraction has 74528 states and 89157 transitions. [2025-01-09 04:42:35,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.214285714285715) internal successors, (283), 14 states have internal predecessors, (283), 0 states have call successors, (0), 0 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 04:42:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 74528 states and 89157 transitions. [2025-01-09 04:42:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:42:35,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:35,100 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:35,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 04:42:35,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:35,301 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:35,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:35,302 INFO L85 PathProgramCache]: Analyzing trace with hash -630948367, now seen corresponding path program 1 times [2025-01-09 04:42:35,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:35,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343253350] [2025-01-09 04:42:35,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:35,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:35,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:42:35,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:42:35,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:35,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:35,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:35,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343253350] [2025-01-09 04:42:35,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343253350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:35,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:35,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:35,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435391824] [2025-01-09 04:42:35,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:35,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:35,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:35,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:35,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:35,335 INFO L87 Difference]: Start difference. First operand 74528 states and 89157 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 04:42:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:35,611 INFO L93 Difference]: Finished difference Result 136875 states and 163873 transitions. [2025-01-09 04:42:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:35,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2025-01-09 04:42:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:35,743 INFO L225 Difference]: With dead ends: 136875 [2025-01-09 04:42:35,743 INFO L226 Difference]: Without dead ends: 104213 [2025-01-09 04:42:35,784 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 04:42:35,784 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 112 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:35,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 602 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104213 states. [2025-01-09 04:42:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104213 to 72048. [2025-01-09 04:42:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72048 states, 72047 states have (on average 1.188349272002998) internal successors, (85617), 72047 states have internal predecessors, (85617), 0 states have call successors, (0), 0 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 04:42:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72048 states to 72048 states and 85617 transitions. [2025-01-09 04:42:36,720 INFO L78 Accepts]: Start accepts. Automaton has 72048 states and 85617 transitions. Word has length 103 [2025-01-09 04:42:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:36,720 INFO L471 AbstractCegarLoop]: Abstraction has 72048 states and 85617 transitions. [2025-01-09 04:42:36,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 04:42:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 72048 states and 85617 transitions. [2025-01-09 04:42:36,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:42:36,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:36,727 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:36,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 04:42:36,727 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:36,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:36,728 INFO L85 PathProgramCache]: Analyzing trace with hash 912530642, now seen corresponding path program 1 times [2025-01-09 04:42:36,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:36,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802956724] [2025-01-09 04:42:36,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:36,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:36,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:42:36,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:42:36,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:36,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:42:36,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:36,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802956724] [2025-01-09 04:42:36,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802956724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:36,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:36,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:42:36,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410459312] [2025-01-09 04:42:36,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:36,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:42:36,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:36,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:42:36,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:42:36,773 INFO L87 Difference]: Start difference. First operand 72048 states and 85617 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 04:42:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:37,392 INFO L93 Difference]: Finished difference Result 121470 states and 143781 transitions. [2025-01-09 04:42:37,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:37,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 105 [2025-01-09 04:42:37,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:37,522 INFO L225 Difference]: With dead ends: 121470 [2025-01-09 04:42:37,523 INFO L226 Difference]: Without dead ends: 101721 [2025-01-09 04:42:37,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:37,546 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 151 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:37,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 653 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101721 states. [2025-01-09 04:42:38,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101721 to 81012. [2025-01-09 04:42:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81012 states, 81011 states have (on average 1.1882460406611448) internal successors, (96261), 81011 states have internal predecessors, (96261), 0 states have call successors, (0), 0 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 04:42:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81012 states to 81012 states and 96261 transitions. [2025-01-09 04:42:38,777 INFO L78 Accepts]: Start accepts. Automaton has 81012 states and 96261 transitions. Word has length 105 [2025-01-09 04:42:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:38,777 INFO L471 AbstractCegarLoop]: Abstraction has 81012 states and 96261 transitions. [2025-01-09 04:42:38,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 04:42:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 81012 states and 96261 transitions. [2025-01-09 04:42:38,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:42:38,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:38,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:38,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 04:42:38,785 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:38,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:38,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1549092557, now seen corresponding path program 1 times [2025-01-09 04:42:38,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:38,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967900800] [2025-01-09 04:42:38,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:38,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:38,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:42:38,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:42:38,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:38,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:39,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:39,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967900800] [2025-01-09 04:42:39,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967900800] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:42:39,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896790041] [2025-01-09 04:42:39,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:39,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:39,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:39,121 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:42:39,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:42:39,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:42:39,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:42:39,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:39,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:39,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:42:39,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:42:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:40,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:42:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896790041] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:42:40,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:42:40,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 33 [2025-01-09 04:42:40,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224191874] [2025-01-09 04:42:40,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:42:40,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 04:42:40,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:40,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 04:42:40,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 04:42:40,847 INFO L87 Difference]: Start difference. First operand 81012 states and 96261 transitions. Second operand has 33 states, 33 states have (on average 7.606060606060606) internal successors, (251), 33 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:42,969 INFO L93 Difference]: Finished difference Result 147316 states and 175030 transitions. [2025-01-09 04:42:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 04:42:42,970 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.606060606060606) internal successors, (251), 33 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-01-09 04:42:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:43,188 INFO L225 Difference]: With dead ends: 147316 [2025-01-09 04:42:43,189 INFO L226 Difference]: Without dead ends: 135078 [2025-01-09 04:42:43,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=509, Invalid=2353, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 04:42:43,228 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 2360 mSDsluCounter, 7056 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2360 SdHoareTripleChecker+Valid, 7486 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:43,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2360 Valid, 7486 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:42:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135078 states. [2025-01-09 04:42:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135078 to 81042. [2025-01-09 04:42:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81042 states, 81041 states have (on average 1.1881763551782432) internal successors, (96291), 81041 states have internal predecessors, (96291), 0 states have call successors, (0), 0 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 04:42:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81042 states to 81042 states and 96291 transitions. [2025-01-09 04:42:44,333 INFO L78 Accepts]: Start accepts. Automaton has 81042 states and 96291 transitions. Word has length 105 [2025-01-09 04:42:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:44,333 INFO L471 AbstractCegarLoop]: Abstraction has 81042 states and 96291 transitions. [2025-01-09 04:42:44,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.606060606060606) internal successors, (251), 33 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 81042 states and 96291 transitions. [2025-01-09 04:42:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:42:44,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:44,341 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:44,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 04:42:44,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-01-09 04:42:44,542 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:44,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:44,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1657592835, now seen corresponding path program 1 times [2025-01-09 04:42:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:44,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626748080] [2025-01-09 04:42:44,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:44,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:44,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:42:44,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:42:44,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:44,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:44,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:44,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626748080] [2025-01-09 04:42:44,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626748080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:44,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:44,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:44,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134936533] [2025-01-09 04:42:44,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:44,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:44,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:44,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:44,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:44,601 INFO L87 Difference]: Start difference. First operand 81042 states and 96291 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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 04:42:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:44,834 INFO L93 Difference]: Finished difference Result 111414 states and 132424 transitions. [2025-01-09 04:42:44,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:44,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-01-09 04:42:44,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:44,868 INFO L225 Difference]: With dead ends: 111414 [2025-01-09 04:42:44,868 INFO L226 Difference]: Without dead ends: 31933 [2025-01-09 04:42:44,910 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 04:42:44,911 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 127 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 411 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 04:42:44,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 411 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31933 states. [2025-01-09 04:42:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31933 to 31505. [2025-01-09 04:42:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31505 states, 31504 states have (on average 1.1672168613509395) internal successors, (36772), 31504 states have internal predecessors, (36772), 0 states have call successors, (0), 0 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 04:42:45,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31505 states to 31505 states and 36772 transitions. [2025-01-09 04:42:45,470 INFO L78 Accepts]: Start accepts. Automaton has 31505 states and 36772 transitions. Word has length 105 [2025-01-09 04:42:45,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:45,471 INFO L471 AbstractCegarLoop]: Abstraction has 31505 states and 36772 transitions. [2025-01-09 04:42:45,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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 04:42:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 31505 states and 36772 transitions. [2025-01-09 04:42:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:42:45,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:45,477 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:45,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 04:42:45,477 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:45,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:45,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1975472615, now seen corresponding path program 1 times [2025-01-09 04:42:45,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:45,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706907122] [2025-01-09 04:42:45,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:45,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:45,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:42:45,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:42:45,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:45,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:42:45,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:45,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706907122] [2025-01-09 04:42:45,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706907122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:45,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:45,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:45,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099160905] [2025-01-09 04:42:45,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:45,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:45,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:45,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:45,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:45,526 INFO L87 Difference]: Start difference. First operand 31505 states and 36772 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 04:42:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:45,625 INFO L93 Difference]: Finished difference Result 40179 states and 46990 transitions. [2025-01-09 04:42:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:45,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 105 [2025-01-09 04:42:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:45,652 INFO L225 Difference]: With dead ends: 40179 [2025-01-09 04:42:45,653 INFO L226 Difference]: Without dead ends: 28662 [2025-01-09 04:42:45,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:45,666 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 203 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:45,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 363 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28662 states. [2025-01-09 04:42:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28662 to 28660. [2025-01-09 04:42:45,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28660 states, 28659 states have (on average 1.1635786314944694) internal successors, (33347), 28659 states have internal predecessors, (33347), 0 states have call successors, (0), 0 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 04:42:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28660 states to 28660 states and 33347 transitions. [2025-01-09 04:42:45,985 INFO L78 Accepts]: Start accepts. Automaton has 28660 states and 33347 transitions. Word has length 105 [2025-01-09 04:42:45,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:45,985 INFO L471 AbstractCegarLoop]: Abstraction has 28660 states and 33347 transitions. [2025-01-09 04:42:45,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 04:42:45,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28660 states and 33347 transitions. [2025-01-09 04:42:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:42:45,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:45,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:45,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 04:42:45,991 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:45,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:45,991 INFO L85 PathProgramCache]: Analyzing trace with hash -446747820, now seen corresponding path program 1 times [2025-01-09 04:42:45,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:45,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122943007] [2025-01-09 04:42:45,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:45,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:46,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:42:46,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:42:46,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:46,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:46,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:46,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122943007] [2025-01-09 04:42:46,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122943007] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:42:46,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717641586] [2025-01-09 04:42:46,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:46,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:46,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:46,591 INFO L229 MonitoredProcess]: Starting monitored process 8 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 04:42:46,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 04:42:46,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:42:46,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:42:46,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:46,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:46,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 04:42:46,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:42:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:48,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:42:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:49,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717641586] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:42:49,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:42:49,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 39 [2025-01-09 04:42:49,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142213669] [2025-01-09 04:42:49,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:42:49,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 04:42:49,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:49,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 04:42:49,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 04:42:49,051 INFO L87 Difference]: Start difference. First operand 28660 states and 33347 transitions. Second operand has 39 states, 39 states have (on average 7.282051282051282) internal successors, (284), 39 states have internal predecessors, (284), 0 states have call successors, (0), 0 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 04:42:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:51,343 INFO L93 Difference]: Finished difference Result 40923 states and 47573 transitions. [2025-01-09 04:42:51,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-09 04:42:51,343 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.282051282051282) internal successors, (284), 39 states have internal predecessors, (284), 0 states have call successors, (0), 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 105 [2025-01-09 04:42:51,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:51,378 INFO L225 Difference]: With dead ends: 40923 [2025-01-09 04:42:51,379 INFO L226 Difference]: Without dead ends: 35389 [2025-01-09 04:42:51,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1515 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1348, Invalid=5624, Unknown=0, NotChecked=0, Total=6972 [2025-01-09 04:42:51,393 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 2589 mSDsluCounter, 7150 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2589 SdHoareTripleChecker+Valid, 7603 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:51,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2589 Valid, 7603 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2362 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:42:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35389 states. [2025-01-09 04:42:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35389 to 29130. [2025-01-09 04:42:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29130 states, 29129 states have (on average 1.162415462254111) internal successors, (33860), 29129 states have internal predecessors, (33860), 0 states have call successors, (0), 0 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 04:42:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29130 states to 29130 states and 33860 transitions. [2025-01-09 04:42:51,693 INFO L78 Accepts]: Start accepts. Automaton has 29130 states and 33860 transitions. Word has length 105 [2025-01-09 04:42:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:51,693 INFO L471 AbstractCegarLoop]: Abstraction has 29130 states and 33860 transitions. [2025-01-09 04:42:51,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.282051282051282) internal successors, (284), 39 states have internal predecessors, (284), 0 states have call successors, (0), 0 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 04:42:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 29130 states and 33860 transitions. [2025-01-09 04:42:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 04:42:51,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:51,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:51,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 04:42:51,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:51,900 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:51,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:51,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1780532348, now seen corresponding path program 1 times [2025-01-09 04:42:51,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:51,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785380146] [2025-01-09 04:42:51,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:51,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:51,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 04:42:51,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 04:42:51,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:51,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:42:52,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:52,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785380146] [2025-01-09 04:42:52,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785380146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:52,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:52,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:42:52,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027619838] [2025-01-09 04:42:52,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:52,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:42:52,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:52,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:42:52,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:42:52,325 INFO L87 Difference]: Start difference. First operand 29130 states and 33860 transitions. Second operand has 10 states, 10 states have (on average 10.1) internal successors, (101), 10 states have internal predecessors, (101), 0 states have call successors, (0), 0 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 04:42:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:52,680 INFO L93 Difference]: Finished difference Result 46245 states and 53879 transitions. [2025-01-09 04:42:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:42:52,680 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 10 states have internal predecessors, (101), 0 states have call successors, (0), 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 106 [2025-01-09 04:42:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:52,724 INFO L225 Difference]: With dead ends: 46245 [2025-01-09 04:42:52,725 INFO L226 Difference]: Without dead ends: 42328 [2025-01-09 04:42:52,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:42:52,740 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 429 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:52,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1515 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:42:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42328 states. [2025-01-09 04:42:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42328 to 28411. [2025-01-09 04:42:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28411 states, 28410 states have (on average 1.1624428018303414) internal successors, (33025), 28410 states have internal predecessors, (33025), 0 states have call successors, (0), 0 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 04:42:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28411 states to 28411 states and 33025 transitions. [2025-01-09 04:42:53,255 INFO L78 Accepts]: Start accepts. Automaton has 28411 states and 33025 transitions. Word has length 106 [2025-01-09 04:42:53,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:53,255 INFO L471 AbstractCegarLoop]: Abstraction has 28411 states and 33025 transitions. [2025-01-09 04:42:53,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 10 states have internal predecessors, (101), 0 states have call successors, (0), 0 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 04:42:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 28411 states and 33025 transitions. [2025-01-09 04:42:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 04:42:53,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:53,258 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:53,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 04:42:53,259 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:53,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash 336668883, now seen corresponding path program 1 times [2025-01-09 04:42:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188178797] [2025-01-09 04:42:53,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:53,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 04:42:53,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 04:42:53,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:53,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:42:53,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:53,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188178797] [2025-01-09 04:42:53,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188178797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:53,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:53,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:42:53,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076594050] [2025-01-09 04:42:53,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:53,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:42:53,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:53,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:42:53,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:42:53,304 INFO L87 Difference]: Start difference. First operand 28411 states and 33025 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 04:42:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:53,468 INFO L93 Difference]: Finished difference Result 46192 states and 53398 transitions. [2025-01-09 04:42:53,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:53,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 106 [2025-01-09 04:42:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:53,505 INFO L225 Difference]: With dead ends: 46192 [2025-01-09 04:42:53,505 INFO L226 Difference]: Without dead ends: 35691 [2025-01-09 04:42:53,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:53,519 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 132 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:53,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 528 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35691 states. [2025-01-09 04:42:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35691 to 28238. [2025-01-09 04:42:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28238 states, 28237 states have (on average 1.1619860466763465) internal successors, (32811), 28237 states have internal predecessors, (32811), 0 states have call successors, (0), 0 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 04:42:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28238 states to 28238 states and 32811 transitions. [2025-01-09 04:42:53,768 INFO L78 Accepts]: Start accepts. Automaton has 28238 states and 32811 transitions. Word has length 106 [2025-01-09 04:42:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:53,768 INFO L471 AbstractCegarLoop]: Abstraction has 28238 states and 32811 transitions. [2025-01-09 04:42:53,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 04:42:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 28238 states and 32811 transitions. [2025-01-09 04:42:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 04:42:53,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:53,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:53,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 04:42:53,772 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:42:53,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash 973230798, now seen corresponding path program 1 times [2025-01-09 04:42:53,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:53,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192835112] [2025-01-09 04:42:53,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:53,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:53,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 04:42:53,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 04:42:53,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:53,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:54,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:54,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192835112] [2025-01-09 04:42:54,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192835112] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:42:54,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440487208] [2025-01-09 04:42:54,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:54,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:54,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:54,042 INFO L229 MonitoredProcess]: Starting monitored process 9 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 04:42:54,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 04:42:54,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 04:42:54,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 04:42:54,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:54,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:54,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 04:42:54,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:42:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:55,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:42:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:55,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440487208] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:42:55,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:42:55,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 10] total 31 [2025-01-09 04:42:55,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474549206] [2025-01-09 04:42:55,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:42:55,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 04:42:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:55,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 04:42:55,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2025-01-09 04:42:55,457 INFO L87 Difference]: Start difference. First operand 28238 states and 32811 transitions. Second operand has 31 states, 31 states have (on average 9.612903225806452) internal successors, (298), 31 states have internal predecessors, (298), 0 states have call successors, (0), 0 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 04:43:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:01,660 INFO L93 Difference]: Finished difference Result 63642 states and 73950 transitions. [2025-01-09 04:43:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-01-09 04:43:01,660 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.612903225806452) internal successors, (298), 31 states have internal predecessors, (298), 0 states have call successors, (0), 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 106 [2025-01-09 04:43:01,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:01,733 INFO L225 Difference]: With dead ends: 63642 [2025-01-09 04:43:01,733 INFO L226 Difference]: Without dead ends: 59391 [2025-01-09 04:43:01,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4104 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2386, Invalid=12376, Unknown=0, NotChecked=0, Total=14762 [2025-01-09 04:43:01,819 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 4903 mSDsluCounter, 5154 mSDsCounter, 0 mSdLazyCounter, 4688 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4903 SdHoareTripleChecker+Valid, 5457 SdHoareTripleChecker+Invalid, 4832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 4688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:01,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 5457 Invalid, 4832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 4688 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 04:43:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59391 states. [2025-01-09 04:43:02,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59391 to 29020. [2025-01-09 04:43:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29020 states, 29019 states have (on average 1.1609979668493056) internal successors, (33691), 29019 states have internal predecessors, (33691), 0 states have call successors, (0), 0 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 04:43:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29020 states to 29020 states and 33691 transitions. [2025-01-09 04:43:02,141 INFO L78 Accepts]: Start accepts. Automaton has 29020 states and 33691 transitions. Word has length 106 [2025-01-09 04:43:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:02,142 INFO L471 AbstractCegarLoop]: Abstraction has 29020 states and 33691 transitions. [2025-01-09 04:43:02,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.612903225806452) internal successors, (298), 31 states have internal predecessors, (298), 0 states have call successors, (0), 0 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 04:43:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 29020 states and 33691 transitions. [2025-01-09 04:43:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 04:43:02,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:02,145 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:02,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 04:43:02,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:43:02,346 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:43:02,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1435687535, now seen corresponding path program 1 times [2025-01-09 04:43:02,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:02,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619669797] [2025-01-09 04:43:02,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:02,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:02,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 04:43:02,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 04:43:02,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:02,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:43:02,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:02,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619669797] [2025-01-09 04:43:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619669797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:02,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:02,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:43:02,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147287197] [2025-01-09 04:43:02,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:02,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:43:02,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:02,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:43:02,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:43:02,392 INFO L87 Difference]: Start difference. First operand 29020 states and 33691 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 04:43:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:02,550 INFO L93 Difference]: Finished difference Result 46526 states and 54222 transitions. [2025-01-09 04:43:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:43:02,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 106 [2025-01-09 04:43:02,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:02,598 INFO L225 Difference]: With dead ends: 46526 [2025-01-09 04:43:02,598 INFO L226 Difference]: Without dead ends: 38342 [2025-01-09 04:43:02,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:43:02,618 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 147 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:02,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 522 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38342 states.