./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+sep-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+sep-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 52ea16d32fee186339e754b295bffdbf40567dcb9eb1871e1f81ccc6c9f03c9b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:41:43,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:41:43,879 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:43,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:41:43,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:41:43,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:41:43,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:41:43,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:41:43,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:41:43,899 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:41:43,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:41:43,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:41:43,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:41:43,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:41:43,899 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:41:43,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:41:43,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:41:43,899 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:41:43,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:41:43,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:41:43,900 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:41:43,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:41:43,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:41:43,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:41:43,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:41:43,901 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:41:43,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:41:43,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:41:43,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:41:43,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:41:43,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:41:43,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:41:43,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:41:43,901 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 -> 52ea16d32fee186339e754b295bffdbf40567dcb9eb1871e1f81ccc6c9f03c9b [2025-01-09 04:41:44,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:41:44,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:41:44,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:41:44,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:41:44,094 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:41:44,095 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+sep-reducer.c [2025-01-09 04:41:45,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/833e13d43/3b733f80102246c3a1a096a63453ab1e/FLAGc0e8bbc94 [2025-01-09 04:41:45,671 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:41:45,672 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+sep-reducer.c [2025-01-09 04:41:45,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/833e13d43/3b733f80102246c3a1a096a63453ab1e/FLAGc0e8bbc94 [2025-01-09 04:41:45,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/833e13d43/3b733f80102246c3a1a096a63453ab1e [2025-01-09 04:41:45,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:41:45,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:41:45,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:41:45,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:41:45,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:41:45,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:41:45" (1/1) ... [2025-01-09 04:41:45,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f59f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:45, skipping insertion in model container [2025-01-09 04:41:45,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:41:45" (1/1) ... [2025-01-09 04:41:45,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:41:45,967 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+sep-reducer.c[7184,7197] [2025-01-09 04:41:45,984 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+sep-reducer.c[11285,11298] [2025-01-09 04:41:46,006 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+sep-reducer.c[18315,18328] [2025-01-09 04:41:46,026 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+sep-reducer.c[24747,24760] [2025-01-09 04:41:46,072 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+sep-reducer.c[43722,43735] [2025-01-09 04:41:46,123 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+sep-reducer.c[71504,71517] [2025-01-09 04:41:46,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:41:46,270 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:41:46,305 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+sep-reducer.c[7184,7197] [2025-01-09 04:41:46,316 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+sep-reducer.c[11285,11298] [2025-01-09 04:41:46,325 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+sep-reducer.c[18315,18328] [2025-01-09 04:41:46,335 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+sep-reducer.c[24747,24760] [2025-01-09 04:41:46,372 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+sep-reducer.c[43722,43735] [2025-01-09 04:41:46,414 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+sep-reducer.c[71504,71517] [2025-01-09 04:41:46,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:41:46,522 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:41:46,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:46 WrapperNode [2025-01-09 04:41:46,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:41:46,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:41:46,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:41:46,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:41:46,531 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:46" (1/1) ... [2025-01-09 04:41:46,566 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:46" (1/1) ... [2025-01-09 04:41:46,740 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6039 [2025-01-09 04:41:46,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:41:46,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:41:46,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:41:46,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:41:46,748 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:46" (1/1) ... [2025-01-09 04:41:46,749 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:46" (1/1) ... [2025-01-09 04:41:46,770 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:46" (1/1) ... [2025-01-09 04:41:46,822 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:46,822 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:46" (1/1) ... [2025-01-09 04:41:46,823 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:46" (1/1) ... [2025-01-09 04:41:46,867 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:46" (1/1) ... [2025-01-09 04:41:46,883 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:46" (1/1) ... [2025-01-09 04:41:46,905 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:46" (1/1) ... [2025-01-09 04:41:46,924 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:46" (1/1) ... [2025-01-09 04:41:46,937 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:46" (1/1) ... [2025-01-09 04:41:46,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:41:46,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:41:46,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:41:46,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:41:46,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:46" (1/1) ... [2025-01-09 04:41:46,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:41:46,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:41:46,990 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:46,998 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:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:41:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:41:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:41:47,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:41:47,239 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:41:47,240 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:41:49,703 INFO L? ?]: Removed 1041 outVars from TransFormulas that were not future-live. [2025-01-09 04:41:49,704 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:41:49,776 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:41:49,776 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:41:49,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:41:49 BoogieIcfgContainer [2025-01-09 04:41:49,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:41:49,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:41:49,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:41:49,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:41:49,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:41:45" (1/3) ... [2025-01-09 04:41:49,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a51234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:41:49, skipping insertion in model container [2025-01-09 04:41:49,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:46" (2/3) ... [2025-01-09 04:41:49,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a51234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:41:49, skipping insertion in model container [2025-01-09 04:41:49,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:41:49" (3/3) ... [2025-01-09 04:41:49,786 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-01-09 04:41:49,798 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:41:49,801 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 1254 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-01-09 04:41:49,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:41:49,903 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;@1f7d6d52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:41:49,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 04:41:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 1254 states, 1247 states have (on average 1.8043303929430634) internal successors, (2250), 1253 states have internal predecessors, (2250), 0 states have call successors, (0), 0 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,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:41:49,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:49,940 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:49,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:41:49,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:49,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1061871762, now seen corresponding path program 1 times [2025-01-09 04:41:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:49,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395570081] [2025-01-09 04:41:49,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:49,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:50,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:41:50,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:41:50,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:50,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:50,417 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,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:50,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395570081] [2025-01-09 04:41:50,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395570081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:50,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:50,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:41:50,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173152089] [2025-01-09 04:41:50,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:50,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:41:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:50,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:41:50,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:41:50,451 INFO L87 Difference]: Start difference. First operand has 1254 states, 1247 states have (on average 1.8043303929430634) internal successors, (2250), 1253 states have internal predecessors, (2250), 0 states have call successors, (0), 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.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:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:52,036 INFO L93 Difference]: Finished difference Result 2467 states and 4323 transitions. [2025-01-09 04:41:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:41:52,040 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:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:52,063 INFO L225 Difference]: With dead ends: 2467 [2025-01-09 04:41:52,063 INFO L226 Difference]: Without dead ends: 1550 [2025-01-09 04:41:52,075 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:52,081 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 7057 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7057 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:52,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7057 Valid, 1491 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 04:41:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2025-01-09 04:41:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1544. [2025-01-09 04:41:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1538 states have (on average 1.3563068920676202) internal successors, (2086), 1543 states have internal predecessors, (2086), 0 states have call successors, (0), 0 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:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2086 transitions. [2025-01-09 04:41:52,201 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2086 transitions. Word has length 51 [2025-01-09 04:41:52,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:52,205 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2086 transitions. [2025-01-09 04:41:52,205 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:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2086 transitions. [2025-01-09 04:41:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:41:52,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:52,207 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:52,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:41:52,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:41:52,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1625759521, now seen corresponding path program 1 times [2025-01-09 04:41:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:52,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350096719] [2025-01-09 04:41:52,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:52,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:41:52,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:41:52,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:52,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:52,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:52,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350096719] [2025-01-09 04:41:52,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350096719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:52,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:52,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:41:52,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058574762] [2025-01-09 04:41:52,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:52,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:41:52,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:52,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:41:52,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:41:52,378 INFO L87 Difference]: Start difference. First operand 1544 states and 2086 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:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:53,167 INFO L93 Difference]: Finished difference Result 3169 states and 4338 transitions. [2025-01-09 04:41:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:41:53,168 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:53,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:53,174 INFO L225 Difference]: With dead ends: 3169 [2025-01-09 04:41:53,175 INFO L226 Difference]: Without dead ends: 2189 [2025-01-09 04:41:53,176 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:53,177 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 5058 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5058 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:53,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5058 Valid, 1030 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:41:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2025-01-09 04:41:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2177. [2025-01-09 04:41:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 2171 states have (on average 1.3754030400736987) internal successors, (2986), 2176 states have internal predecessors, (2986), 0 states have call successors, (0), 0 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:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 2986 transitions. [2025-01-09 04:41:53,256 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 2986 transitions. Word has length 52 [2025-01-09 04:41:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:53,256 INFO L471 AbstractCegarLoop]: Abstraction has 2177 states and 2986 transitions. [2025-01-09 04:41:53,256 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:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 2986 transitions. [2025-01-09 04:41:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:41:53,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:53,259 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:53,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:41:53,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:41:53,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:53,260 INFO L85 PathProgramCache]: Analyzing trace with hash 299183278, now seen corresponding path program 1 times [2025-01-09 04:41:53,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:53,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574375896] [2025-01-09 04:41:53,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:53,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:41:53,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:41:53,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:53,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:53,447 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:53,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:53,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574375896] [2025-01-09 04:41:53,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574375896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:53,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:53,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:41:53,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713461267] [2025-01-09 04:41:53,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:53,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:41:53,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:53,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:41:53,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:41:53,450 INFO L87 Difference]: Start difference. First operand 2177 states and 2986 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:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:54,129 INFO L93 Difference]: Finished difference Result 4520 states and 6280 transitions. [2025-01-09 04:41:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:41:54,130 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:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:54,138 INFO L225 Difference]: With dead ends: 4520 [2025-01-09 04:41:54,138 INFO L226 Difference]: Without dead ends: 3045 [2025-01-09 04:41:54,140 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:54,140 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 4477 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:54,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 884 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:41:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2025-01-09 04:41:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 3035. [2025-01-09 04:41:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3029 states have (on average 1.3766919775503466) internal successors, (4170), 3034 states have internal predecessors, (4170), 0 states have call successors, (0), 0 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,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4170 transitions. [2025-01-09 04:41:54,184 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4170 transitions. Word has length 52 [2025-01-09 04:41:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:54,184 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 4170 transitions. [2025-01-09 04:41:54,184 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:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4170 transitions. [2025-01-09 04:41:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:41:54,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:54,186 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:54,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:41:54,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:41:54,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:54,187 INFO L85 PathProgramCache]: Analyzing trace with hash 448762372, now seen corresponding path program 1 times [2025-01-09 04:41:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174228886] [2025-01-09 04:41:54,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:54,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:54,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:41:54,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:41:54,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:54,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:54,773 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,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:54,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174228886] [2025-01-09 04:41:54,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174228886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:54,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:54,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:41:54,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62604465] [2025-01-09 04:41:54,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:54,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:41:54,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:54,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:41:54,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:41:54,779 INFO L87 Difference]: Start difference. First operand 3035 states and 4170 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:56,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:56,427 INFO L93 Difference]: Finished difference Result 5165 states and 7240 transitions. [2025-01-09 04:41:56,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:41:56,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:56,440 INFO L225 Difference]: With dead ends: 5165 [2025-01-09 04:41:56,440 INFO L226 Difference]: Without dead ends: 4608 [2025-01-09 04:41:56,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:41:56,442 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 5175 mSDsluCounter, 2129 mSDsCounter, 0 mSdLazyCounter, 3052 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5175 SdHoareTripleChecker+Valid, 2789 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:56,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5175 Valid, 2789 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3052 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 04:41:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2025-01-09 04:41:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 3035. [2025-01-09 04:41:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3029 states have (on average 1.3763618355893035) internal successors, (4169), 3034 states have internal predecessors, (4169), 0 states have call successors, (0), 0 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,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4169 transitions. [2025-01-09 04:41:56,505 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4169 transitions. Word has length 53 [2025-01-09 04:41:56,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:56,505 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 4169 transitions. [2025-01-09 04:41:56,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4169 transitions. [2025-01-09 04:41:56,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:41:56,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:56,507 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:56,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:41:56,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:41:56,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:56,508 INFO L85 PathProgramCache]: Analyzing trace with hash 303472925, now seen corresponding path program 1 times [2025-01-09 04:41:56,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:56,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721413198] [2025-01-09 04:41:56,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:56,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:56,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:41:56,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:41:56,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:56,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:56,796 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,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:56,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721413198] [2025-01-09 04:41:56,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721413198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:56,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:56,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:41:56,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112898556] [2025-01-09 04:41:56,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:56,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:41:56,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:56,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:41:56,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:41:56,798 INFO L87 Difference]: Start difference. First operand 3035 states and 4169 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:58,342 INFO L93 Difference]: Finished difference Result 3783 states and 5166 transitions. [2025-01-09 04:41:58,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:41:58,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:58,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:58,353 INFO L225 Difference]: With dead ends: 3783 [2025-01-09 04:41:58,354 INFO L226 Difference]: Without dead ends: 3778 [2025-01-09 04:41:58,356 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:58,356 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 6187 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6187 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:58,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6187 Valid, 2679 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 04:41:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2025-01-09 04:41:58,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 3035. [2025-01-09 04:41:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3029 states have (on average 1.3760316936282602) internal successors, (4168), 3034 states have internal predecessors, (4168), 0 states have call successors, (0), 0 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,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4168 transitions. [2025-01-09 04:41:58,453 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4168 transitions. Word has length 53 [2025-01-09 04:41:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:58,455 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 4168 transitions. [2025-01-09 04:41:58,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4168 transitions. [2025-01-09 04:41:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:41:58,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:58,460 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:58,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:41:58,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:41:58,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1162103691, now seen corresponding path program 1 times [2025-01-09 04:41:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:58,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693195930] [2025-01-09 04:41:58,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:58,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:58,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:41:58,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:41:58,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:58,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:58,710 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,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:58,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693195930] [2025-01-09 04:41:58,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693195930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:58,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:58,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:41:58,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234025876] [2025-01-09 04:41:58,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:58,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:41:58,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:58,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:41:58,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:41:58,712 INFO L87 Difference]: Start difference. First operand 3035 states and 4168 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 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:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:59,717 INFO L93 Difference]: Finished difference Result 4347 states and 6071 transitions. [2025-01-09 04:41:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:41:59,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 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:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:59,726 INFO L225 Difference]: With dead ends: 4347 [2025-01-09 04:41:59,726 INFO L226 Difference]: Without dead ends: 3676 [2025-01-09 04:41:59,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:41:59,730 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 6319 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6319 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:59,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6319 Valid, 2183 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:41:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2025-01-09 04:41:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3035. [2025-01-09 04:41:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3029 states have (on average 1.3757015516672169) internal successors, (4167), 3034 states have internal predecessors, (4167), 0 states have call successors, (0), 0 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,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4167 transitions. [2025-01-09 04:41:59,779 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4167 transitions. Word has length 53 [2025-01-09 04:41:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:59,779 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 4167 transitions. [2025-01-09 04:41:59,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 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:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4167 transitions. [2025-01-09 04:41:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:41:59,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:59,782 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:59,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:41:59,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:41:59,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash -482264145, now seen corresponding path program 1 times [2025-01-09 04:41:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:59,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964306645] [2025-01-09 04:41:59,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:59,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:41:59,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:41:59,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:59,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:59,850 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:59,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:59,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964306645] [2025-01-09 04:41:59,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964306645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:59,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:59,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:59,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905795976] [2025-01-09 04:41:59,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:59,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:59,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:59,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:59,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:59,851 INFO L87 Difference]: Start difference. First operand 3035 states and 4167 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:59,909 INFO L93 Difference]: Finished difference Result 3991 states and 5632 transitions. [2025-01-09 04:41:59,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:59,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:59,918 INFO L225 Difference]: With dead ends: 3991 [2025-01-09 04:41:59,918 INFO L226 Difference]: Without dead ends: 3088 [2025-01-09 04:41:59,920 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:59,921 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 579 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:59,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1785 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2025-01-09 04:41:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3086. [2025-01-09 04:41:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 3080 states have (on average 1.384090909090909) internal successors, (4263), 3085 states have internal predecessors, (4263), 0 states have call successors, (0), 0 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,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 4263 transitions. [2025-01-09 04:41:59,960 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 4263 transitions. Word has length 54 [2025-01-09 04:41:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:59,961 INFO L471 AbstractCegarLoop]: Abstraction has 3086 states and 4263 transitions. [2025-01-09 04:41:59,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 4263 transitions. [2025-01-09 04:41:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:41:59,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:59,963 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:59,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:41:59,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:41:59,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:59,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1622556323, now seen corresponding path program 1 times [2025-01-09 04:41:59,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:59,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029771913] [2025-01-09 04:41:59,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:59,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:42:00,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:42:00,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:00,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:00,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:42:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029771913] [2025-01-09 04:42:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029771913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:00,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:00,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:00,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502009403] [2025-01-09 04:42:00,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:00,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:00,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:00,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:00,049 INFO L87 Difference]: Start difference. First operand 3086 states and 4263 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:42:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:00,104 INFO L93 Difference]: Finished difference Result 4727 states and 6797 transitions. [2025-01-09 04:42:00,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:00,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:42:00,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:00,119 INFO L225 Difference]: With dead ends: 4727 [2025-01-09 04:42:00,119 INFO L226 Difference]: Without dead ends: 3508 [2025-01-09 04:42:00,121 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:00,125 INFO L435 NwaCegarLoop]: 1143 mSDtfsCounter, 577 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:00,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1736 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2025-01-09 04:42:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3506. [2025-01-09 04:42:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3506 states, 3500 states have (on average 1.4117142857142857) internal successors, (4941), 3505 states have internal predecessors, (4941), 0 states have call successors, (0), 0 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,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 4941 transitions. [2025-01-09 04:42:00,176 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 4941 transitions. Word has length 54 [2025-01-09 04:42:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:00,177 INFO L471 AbstractCegarLoop]: Abstraction has 3506 states and 4941 transitions. [2025-01-09 04:42:00,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:42:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 4941 transitions. [2025-01-09 04:42:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:42:00,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:00,180 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:42:00,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:42:00,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:00,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1612308197, now seen corresponding path program 1 times [2025-01-09 04:42:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:00,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950602188] [2025-01-09 04:42:00,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:00,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:42:00,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:42:00,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:00,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:00,255 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:42:00,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:00,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950602188] [2025-01-09 04:42:00,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950602188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:00,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:00,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549681929] [2025-01-09 04:42:00,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:00,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:00,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:00,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:00,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:00,256 INFO L87 Difference]: Start difference. First operand 3506 states and 4941 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:42:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:00,442 INFO L93 Difference]: Finished difference Result 7605 states and 10992 transitions. [2025-01-09 04:42:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:42:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:00,459 INFO L225 Difference]: With dead ends: 7605 [2025-01-09 04:42:00,459 INFO L226 Difference]: Without dead ends: 5153 [2025-01-09 04:42:00,465 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:00,465 INFO L435 NwaCegarLoop]: 1200 mSDtfsCounter, 649 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:00,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1961 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:42:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5153 states. [2025-01-09 04:42:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5153 to 5147. [2025-01-09 04:42:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5147 states, 5141 states have (on average 1.4133437074499124) internal successors, (7266), 5146 states have internal predecessors, (7266), 0 states have call successors, (0), 0 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,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 7266 transitions. [2025-01-09 04:42:00,525 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 7266 transitions. Word has length 54 [2025-01-09 04:42:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:00,525 INFO L471 AbstractCegarLoop]: Abstraction has 5147 states and 7266 transitions. [2025-01-09 04:42:00,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:42:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 7266 transitions. [2025-01-09 04:42:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:42:00,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:00,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:00,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:42:00,528 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:00,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:00,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1623263409, now seen corresponding path program 1 times [2025-01-09 04:42:00,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:00,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092403433] [2025-01-09 04:42:00,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:00,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:00,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:42:00,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:42:00,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:00,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:00,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:42:00,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:00,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092403433] [2025-01-09 04:42:00,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092403433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:00,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:00,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:00,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814725349] [2025-01-09 04:42:00,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:00,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:00,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:00,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:00,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:00,614 INFO L87 Difference]: Start difference. First operand 5147 states and 7266 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:42:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:00,727 INFO L93 Difference]: Finished difference Result 9593 states and 13741 transitions. [2025-01-09 04:42:00,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:00,728 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:42:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:00,736 INFO L225 Difference]: With dead ends: 9593 [2025-01-09 04:42:00,737 INFO L226 Difference]: Without dead ends: 5408 [2025-01-09 04:42:00,741 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:00,741 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 848 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:00,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1285 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5408 states. [2025-01-09 04:42:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5408 to 4343. [2025-01-09 04:42:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4343 states, 4338 states have (on average 1.4250806823420932) internal successors, (6182), 4342 states have internal predecessors, (6182), 0 states have call successors, (0), 0 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,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 6182 transitions. [2025-01-09 04:42:00,792 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 6182 transitions. Word has length 55 [2025-01-09 04:42:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:00,792 INFO L471 AbstractCegarLoop]: Abstraction has 4343 states and 6182 transitions. [2025-01-09 04:42:00,792 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:42:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 6182 transitions. [2025-01-09 04:42:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:42:00,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:00,794 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:42:00,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:42:00,795 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:00,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:00,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1493102210, now seen corresponding path program 1 times [2025-01-09 04:42:00,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:00,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070774757] [2025-01-09 04:42:00,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:00,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:00,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:42:00,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:42:00,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:00,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:00,837 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:42:00,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:00,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070774757] [2025-01-09 04:42:00,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070774757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:00,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:00,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:00,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456654814] [2025-01-09 04:42:00,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:00,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:00,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:00,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:00,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:00,839 INFO L87 Difference]: Start difference. First operand 4343 states and 6182 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:42:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:00,931 INFO L93 Difference]: Finished difference Result 8336 states and 12073 transitions. [2025-01-09 04:42:00,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:00,932 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:42:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:00,938 INFO L225 Difference]: With dead ends: 8336 [2025-01-09 04:42:00,938 INFO L226 Difference]: Without dead ends: 4679 [2025-01-09 04:42:00,971 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:00,971 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 659 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:00,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1016 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:00,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2025-01-09 04:42:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 3775. [2025-01-09 04:42:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3775 states, 3771 states have (on average 1.4346327234155396) internal successors, (5410), 3774 states have internal predecessors, (5410), 0 states have call successors, (0), 0 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:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3775 states to 3775 states and 5410 transitions. [2025-01-09 04:42:01,021 INFO L78 Accepts]: Start accepts. Automaton has 3775 states and 5410 transitions. Word has length 55 [2025-01-09 04:42:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:01,021 INFO L471 AbstractCegarLoop]: Abstraction has 3775 states and 5410 transitions. [2025-01-09 04:42:01,021 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:42:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3775 states and 5410 transitions. [2025-01-09 04:42:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:42:01,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:01,023 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:42:01,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:42:01,024 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:01,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1419432604, now seen corresponding path program 1 times [2025-01-09 04:42:01,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:01,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990369659] [2025-01-09 04:42:01,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:01,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:01,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:42:01,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:42:01,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:01,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:01,073 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:42:01,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990369659] [2025-01-09 04:42:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990369659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:01,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:01,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:01,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676725852] [2025-01-09 04:42:01,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:01,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:01,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:01,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:01,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:01,074 INFO L87 Difference]: Start difference. First operand 3775 states and 5410 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:42:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:01,177 INFO L93 Difference]: Finished difference Result 7569 states and 11012 transitions. [2025-01-09 04:42:01,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:01,177 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:42:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:01,184 INFO L225 Difference]: With dead ends: 7569 [2025-01-09 04:42:01,184 INFO L226 Difference]: Without dead ends: 4109 [2025-01-09 04:42:01,188 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:01,190 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 552 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:01,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 917 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:01,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2025-01-09 04:42:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 3304. [2025-01-09 04:42:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3304 states, 3300 states have (on average 1.4481818181818182) internal successors, (4779), 3303 states have internal predecessors, (4779), 0 states have call successors, (0), 0 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:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 4779 transitions. [2025-01-09 04:42:01,229 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 4779 transitions. Word has length 55 [2025-01-09 04:42:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:01,230 INFO L471 AbstractCegarLoop]: Abstraction has 3304 states and 4779 transitions. [2025-01-09 04:42:01,230 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:42:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 4779 transitions. [2025-01-09 04:42:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:42:01,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:01,233 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:42:01,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:42:01,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:01,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:01,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1871407914, now seen corresponding path program 1 times [2025-01-09 04:42:01,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:01,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362857986] [2025-01-09 04:42:01,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:01,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:01,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:42:01,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:42:01,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:01,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:02,097 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:42:02,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:02,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362857986] [2025-01-09 04:42:02,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362857986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:02,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:02,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 04:42:02,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084488397] [2025-01-09 04:42:02,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:02,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 04:42:02,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:02,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 04:42:02,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:42:02,099 INFO L87 Difference]: Start difference. First operand 3304 states and 4779 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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:42:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:04,175 INFO L93 Difference]: Finished difference Result 6859 states and 9953 transitions. [2025-01-09 04:42:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 04:42:04,176 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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:42:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:04,188 INFO L225 Difference]: With dead ends: 6859 [2025-01-09 04:42:04,189 INFO L226 Difference]: Without dead ends: 6855 [2025-01-09 04:42:04,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 04:42:04,193 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 6048 mSDsluCounter, 5040 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6048 SdHoareTripleChecker+Valid, 5628 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:04,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6048 Valid, 5628 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 04:42:04,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6855 states. [2025-01-09 04:42:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6855 to 3316. [2025-01-09 04:42:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3316 states, 3312 states have (on average 1.4480676328502415) internal successors, (4796), 3315 states have internal predecessors, (4796), 0 states have call successors, (0), 0 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:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 4796 transitions. [2025-01-09 04:42:04,250 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 4796 transitions. Word has length 56 [2025-01-09 04:42:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:04,250 INFO L471 AbstractCegarLoop]: Abstraction has 3316 states and 4796 transitions. [2025-01-09 04:42:04,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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:42:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 4796 transitions. [2025-01-09 04:42:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:42:04,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:04,252 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:42:04,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:42:04,253 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:04,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:04,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1094868748, now seen corresponding path program 1 times [2025-01-09 04:42:04,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:04,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850499502] [2025-01-09 04:42:04,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:04,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:04,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:42:04,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:42:04,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:04,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:04,674 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:42:04,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:04,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850499502] [2025-01-09 04:42:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850499502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:04,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:04,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:42:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907661355] [2025-01-09 04:42:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:04,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:42:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:04,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:42:04,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:42:04,677 INFO L87 Difference]: Start difference. First operand 3316 states and 4796 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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:42:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:05,310 INFO L93 Difference]: Finished difference Result 6811 states and 9907 transitions. [2025-01-09 04:42:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:42:05,310 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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:42:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:05,319 INFO L225 Difference]: With dead ends: 6811 [2025-01-09 04:42:05,320 INFO L226 Difference]: Without dead ends: 6715 [2025-01-09 04:42:05,322 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:42:05,322 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 4204 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4204 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:05,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4204 Valid, 2672 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:42:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6715 states. [2025-01-09 04:42:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6715 to 3269. [2025-01-09 04:42:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3269 states, 3267 states have (on average 1.4499540863177227) internal successors, (4737), 3268 states have internal predecessors, (4737), 0 states have call successors, (0), 0 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:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 4737 transitions. [2025-01-09 04:42:05,389 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 4737 transitions. Word has length 56 [2025-01-09 04:42:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:05,390 INFO L471 AbstractCegarLoop]: Abstraction has 3269 states and 4737 transitions. [2025-01-09 04:42:05,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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:42:05,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 4737 transitions. [2025-01-09 04:42:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:42:05,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:05,392 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:42:05,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:42:05,392 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:05,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash 247888215, now seen corresponding path program 1 times [2025-01-09 04:42:05,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:05,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659888269] [2025-01-09 04:42:05,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:05,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:05,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:42:05,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:42:05,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:05,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:05,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:42:05,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:05,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659888269] [2025-01-09 04:42:05,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659888269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:05,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:05,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:42:05,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194166899] [2025-01-09 04:42:05,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:05,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:42:05,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:05,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:42:05,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:42:05,804 INFO L87 Difference]: Start difference. First operand 3269 states and 4737 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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:42:06,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:06,390 INFO L93 Difference]: Finished difference Result 6460 states and 9394 transitions. [2025-01-09 04:42:06,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:42:06,390 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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:42:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:06,400 INFO L225 Difference]: With dead ends: 6460 [2025-01-09 04:42:06,400 INFO L226 Difference]: Without dead ends: 6378 [2025-01-09 04:42:06,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:42:06,404 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 2476 mSDsluCounter, 2743 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2476 SdHoareTripleChecker+Valid, 3324 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:06,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2476 Valid, 3324 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:42:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6378 states. [2025-01-09 04:42:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6378 to 3229. [2025-01-09 04:42:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 3228 states have (on average 1.4507434944237918) internal successors, (4683), 3228 states have internal predecessors, (4683), 0 states have call successors, (0), 0 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:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4683 transitions. [2025-01-09 04:42:06,479 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4683 transitions. Word has length 57 [2025-01-09 04:42:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:06,479 INFO L471 AbstractCegarLoop]: Abstraction has 3229 states and 4683 transitions. [2025-01-09 04:42:06,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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:42:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4683 transitions. [2025-01-09 04:42:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:42:06,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:06,481 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] [2025-01-09 04:42:06,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:42:06,482 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:06,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:06,482 INFO L85 PathProgramCache]: Analyzing trace with hash -101338621, now seen corresponding path program 1 times [2025-01-09 04:42:06,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:06,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343900832] [2025-01-09 04:42:06,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:06,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:42:06,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:42:06,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:06,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:06,552 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:42:06,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:06,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343900832] [2025-01-09 04:42:06,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343900832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:06,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:06,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:42:06,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612221369] [2025-01-09 04:42:06,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:06,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:06,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:06,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:06,554 INFO L87 Difference]: Start difference. First operand 3229 states and 4683 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:06,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:06,627 INFO L93 Difference]: Finished difference Result 10185 states and 15075 transitions. [2025-01-09 04:42:06,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:06,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:42:06,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:06,639 INFO L225 Difference]: With dead ends: 10185 [2025-01-09 04:42:06,639 INFO L226 Difference]: Without dead ends: 7463 [2025-01-09 04:42:06,643 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:42:06,644 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 1620 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:06,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 948 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2025-01-09 04:42:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 5648. [2025-01-09 04:42:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5648 states, 5647 states have (on average 1.4482025854435985) internal successors, (8178), 5647 states have internal predecessors, (8178), 0 states have call successors, (0), 0 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:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5648 states to 5648 states and 8178 transitions. [2025-01-09 04:42:06,707 INFO L78 Accepts]: Start accepts. Automaton has 5648 states and 8178 transitions. Word has length 63 [2025-01-09 04:42:06,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:06,707 INFO L471 AbstractCegarLoop]: Abstraction has 5648 states and 8178 transitions. [2025-01-09 04:42:06,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:06,707 INFO L276 IsEmpty]: Start isEmpty. Operand 5648 states and 8178 transitions. [2025-01-09 04:42:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:42:06,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:06,709 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] [2025-01-09 04:42:06,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:42:06,709 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:06,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:06,710 INFO L85 PathProgramCache]: Analyzing trace with hash 838129574, now seen corresponding path program 1 times [2025-01-09 04:42:06,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:06,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871803878] [2025-01-09 04:42:06,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:06,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:06,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:42:06,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:42:06,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:06,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:06,786 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:42:06,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:06,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871803878] [2025-01-09 04:42:06,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871803878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:06,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:06,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:42:06,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880164931] [2025-01-09 04:42:06,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:06,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:06,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:06,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:06,788 INFO L87 Difference]: Start difference. First operand 5648 states and 8178 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:06,863 INFO L93 Difference]: Finished difference Result 8880 states and 12897 transitions. [2025-01-09 04:42:06,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:06,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:42:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:06,869 INFO L225 Difference]: With dead ends: 8880 [2025-01-09 04:42:06,869 INFO L226 Difference]: Without dead ends: 3718 [2025-01-09 04:42:06,874 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:42:06,874 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1310 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:06,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 816 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2025-01-09 04:42:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3714. [2025-01-09 04:42:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3713 states have (on average 1.4223000269323998) internal successors, (5281), 3713 states have internal predecessors, (5281), 0 states have call successors, (0), 0 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:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 5281 transitions. [2025-01-09 04:42:06,906 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 5281 transitions. Word has length 64 [2025-01-09 04:42:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:06,906 INFO L471 AbstractCegarLoop]: Abstraction has 3714 states and 5281 transitions. [2025-01-09 04:42:06,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 5281 transitions. [2025-01-09 04:42:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:42:06,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:06,908 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:42:06,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:42:06,908 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:06,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:06,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1809556404, now seen corresponding path program 1 times [2025-01-09 04:42:06,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:06,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185218762] [2025-01-09 04:42:06,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:06,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:06,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:42:06,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:42:06,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:06,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:06,970 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:42:06,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:06,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185218762] [2025-01-09 04:42:06,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185218762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:06,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:06,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:06,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763173664] [2025-01-09 04:42:06,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:06,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:06,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:06,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:06,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:06,972 INFO L87 Difference]: Start difference. First operand 3714 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:07,023 INFO L93 Difference]: Finished difference Result 9856 states and 14207 transitions. [2025-01-09 04:42:07,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:07,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:42:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:07,031 INFO L225 Difference]: With dead ends: 9856 [2025-01-09 04:42:07,031 INFO L226 Difference]: Without dead ends: 6606 [2025-01-09 04:42:07,035 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:07,035 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 295 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:07,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 779 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6606 states. [2025-01-09 04:42:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6606 to 6188. [2025-01-09 04:42:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6188 states, 6187 states have (on average 1.4275092936802973) internal successors, (8832), 6187 states have internal predecessors, (8832), 0 states have call successors, (0), 0 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:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6188 states to 6188 states and 8832 transitions. [2025-01-09 04:42:07,126 INFO L78 Accepts]: Start accepts. Automaton has 6188 states and 8832 transitions. Word has length 66 [2025-01-09 04:42:07,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:07,126 INFO L471 AbstractCegarLoop]: Abstraction has 6188 states and 8832 transitions. [2025-01-09 04:42:07,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:07,126 INFO L276 IsEmpty]: Start isEmpty. Operand 6188 states and 8832 transitions. [2025-01-09 04:42:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:42:07,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:07,128 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:42:07,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:42:07,128 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:07,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:07,129 INFO L85 PathProgramCache]: Analyzing trace with hash 827517135, now seen corresponding path program 1 times [2025-01-09 04:42:07,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:07,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931519980] [2025-01-09 04:42:07,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:07,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:07,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:42:07,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:42:07,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:07,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:07,193 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:42:07,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:07,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931519980] [2025-01-09 04:42:07,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931519980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:07,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:07,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:07,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125709221] [2025-01-09 04:42:07,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:07,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:07,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:07,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:07,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:07,195 INFO L87 Difference]: Start difference. First operand 6188 states and 8832 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:07,263 INFO L93 Difference]: Finished difference Result 17008 states and 24426 transitions. [2025-01-09 04:42:07,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:07,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:42:07,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:07,284 INFO L225 Difference]: With dead ends: 17008 [2025-01-09 04:42:07,285 INFO L226 Difference]: Without dead ends: 11284 [2025-01-09 04:42:07,292 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:07,292 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 255 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:07,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 800 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11284 states. [2025-01-09 04:42:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11284 to 10450. [2025-01-09 04:42:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10450 states, 10449 states have (on average 1.4240597186333621) internal successors, (14880), 10449 states have internal predecessors, (14880), 0 states have call successors, (0), 0 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:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10450 states to 10450 states and 14880 transitions. [2025-01-09 04:42:07,400 INFO L78 Accepts]: Start accepts. Automaton has 10450 states and 14880 transitions. Word has length 66 [2025-01-09 04:42:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:07,400 INFO L471 AbstractCegarLoop]: Abstraction has 10450 states and 14880 transitions. [2025-01-09 04:42:07,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 10450 states and 14880 transitions. [2025-01-09 04:42:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:42:07,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:07,402 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:42:07,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:42:07,402 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:07,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:07,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1051118849, now seen corresponding path program 1 times [2025-01-09 04:42:07,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:07,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110359956] [2025-01-09 04:42:07,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:07,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:07,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:42:07,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:42:07,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:07,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:07,632 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:42:07,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110359956] [2025-01-09 04:42:07,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110359956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:07,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:07,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:42:07,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803572798] [2025-01-09 04:42:07,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:07,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:42:07,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:07,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:42:07,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:42:07,633 INFO L87 Difference]: Start difference. First operand 10450 states and 14880 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:42:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:07,671 INFO L93 Difference]: Finished difference Result 11340 states and 16065 transitions. [2025-01-09 04:42:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:42:07,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:42:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:07,689 INFO L225 Difference]: With dead ends: 11340 [2025-01-09 04:42:07,689 INFO L226 Difference]: Without dead ends: 11338 [2025-01-09 04:42:07,693 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:42:07,694 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2395 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:42:07,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2395 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:07,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11338 states. [2025-01-09 04:42:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11338 to 11338. [2025-01-09 04:42:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11338 states, 11337 states have (on average 1.3908441386610215) internal successors, (15768), 11337 states have internal predecessors, (15768), 0 states have call successors, (0), 0 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:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11338 states to 11338 states and 15768 transitions. [2025-01-09 04:42:07,807 INFO L78 Accepts]: Start accepts. Automaton has 11338 states and 15768 transitions. Word has length 68 [2025-01-09 04:42:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:07,808 INFO L471 AbstractCegarLoop]: Abstraction has 11338 states and 15768 transitions. [2025-01-09 04:42:07,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:42:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 11338 states and 15768 transitions. [2025-01-09 04:42:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:42:07,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:07,811 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] [2025-01-09 04:42:07,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:42:07,811 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:07,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1654492608, now seen corresponding path program 1 times [2025-01-09 04:42:07,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:07,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943698558] [2025-01-09 04:42:07,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:07,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:07,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:42:07,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:42:07,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:07,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:07,857 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:42:07,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:07,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943698558] [2025-01-09 04:42:07,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943698558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:07,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:07,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:07,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106758973] [2025-01-09 04:42:07,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:07,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:07,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:07,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:07,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:07,858 INFO L87 Difference]: Start difference. First operand 11338 states and 15768 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:07,942 INFO L93 Difference]: Finished difference Result 30652 states and 42747 transitions. [2025-01-09 04:42:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:07,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:42:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:07,971 INFO L225 Difference]: With dead ends: 30652 [2025-01-09 04:42:07,972 INFO L226 Difference]: Without dead ends: 19772 [2025-01-09 04:42:07,983 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:07,984 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 295 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:07,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 717 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19772 states. [2025-01-09 04:42:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19772 to 19474. [2025-01-09 04:42:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19474 states, 19473 states have (on average 1.366353412417193) internal successors, (26607), 19473 states have internal predecessors, (26607), 0 states have call successors, (0), 0 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:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19474 states to 19474 states and 26607 transitions. [2025-01-09 04:42:08,264 INFO L78 Accepts]: Start accepts. Automaton has 19474 states and 26607 transitions. Word has length 69 [2025-01-09 04:42:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:08,264 INFO L471 AbstractCegarLoop]: Abstraction has 19474 states and 26607 transitions. [2025-01-09 04:42:08,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 19474 states and 26607 transitions. [2025-01-09 04:42:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:42:08,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:08,266 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:42:08,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:42:08,266 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:08,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:08,268 INFO L85 PathProgramCache]: Analyzing trace with hash -761417871, now seen corresponding path program 1 times [2025-01-09 04:42:08,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:08,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433290299] [2025-01-09 04:42:08,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:08,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:42:08,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:42:08,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:08,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:08,360 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:42:08,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:08,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433290299] [2025-01-09 04:42:08,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433290299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:08,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:08,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:42:08,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993310103] [2025-01-09 04:42:08,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:08,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:08,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:08,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:08,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:08,362 INFO L87 Difference]: Start difference. First operand 19474 states and 26607 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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:42:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:08,496 INFO L93 Difference]: Finished difference Result 34307 states and 47044 transitions. [2025-01-09 04:42:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:08,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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:42:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:08,537 INFO L225 Difference]: With dead ends: 34307 [2025-01-09 04:42:08,537 INFO L226 Difference]: Without dead ends: 28053 [2025-01-09 04:42:08,551 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:08,552 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 1002 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:08,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 1243 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28053 states. [2025-01-09 04:42:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28053 to 24427. [2025-01-09 04:42:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24427 states, 24426 states have (on average 1.361500040939982) internal successors, (33256), 24426 states have internal predecessors, (33256), 0 states have call successors, (0), 0 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:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24427 states to 24427 states and 33256 transitions. [2025-01-09 04:42:08,832 INFO L78 Accepts]: Start accepts. Automaton has 24427 states and 33256 transitions. Word has length 73 [2025-01-09 04:42:08,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:08,833 INFO L471 AbstractCegarLoop]: Abstraction has 24427 states and 33256 transitions. [2025-01-09 04:42:08,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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:42:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 24427 states and 33256 transitions. [2025-01-09 04:42:08,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:42:08,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:08,835 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:42:08,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:42:08,835 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:08,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:08,836 INFO L85 PathProgramCache]: Analyzing trace with hash -669489783, now seen corresponding path program 1 times [2025-01-09 04:42:08,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:08,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315809925] [2025-01-09 04:42:08,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:08,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:08,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:42:08,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:42:08,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:08,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:08,904 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:42:08,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:08,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315809925] [2025-01-09 04:42:08,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315809925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:08,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:08,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:42:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477430392] [2025-01-09 04:42:08,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:08,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:08,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:08,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:08,906 INFO L87 Difference]: Start difference. First operand 24427 states and 33256 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:42:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:09,101 INFO L93 Difference]: Finished difference Result 37627 states and 51448 transitions. [2025-01-09 04:42:09,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:09,102 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:42:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:09,137 INFO L225 Difference]: With dead ends: 37627 [2025-01-09 04:42:09,137 INFO L226 Difference]: Without dead ends: 31373 [2025-01-09 04:42:09,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:09,152 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 977 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:09,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 1246 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31373 states. [2025-01-09 04:42:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31373 to 29379. [2025-01-09 04:42:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29379 states, 29378 states have (on average 1.3582953230308394) internal successors, (39904), 29378 states have internal predecessors, (39904), 0 states have call successors, (0), 0 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:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29379 states to 29379 states and 39904 transitions. [2025-01-09 04:42:09,431 INFO L78 Accepts]: Start accepts. Automaton has 29379 states and 39904 transitions. Word has length 74 [2025-01-09 04:42:09,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:09,432 INFO L471 AbstractCegarLoop]: Abstraction has 29379 states and 39904 transitions. [2025-01-09 04:42:09,432 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:42:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 29379 states and 39904 transitions. [2025-01-09 04:42:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:42:09,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:09,433 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:42:09,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:42:09,433 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:09,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1856624705, now seen corresponding path program 1 times [2025-01-09 04:42:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:09,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241509202] [2025-01-09 04:42:09,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:09,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:42:09,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:42:09,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:09,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:09,501 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:42:09,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:09,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241509202] [2025-01-09 04:42:09,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241509202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:09,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:09,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:42:09,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210657094] [2025-01-09 04:42:09,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:09,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:09,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:09,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:09,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:09,503 INFO L87 Difference]: Start difference. First operand 29379 states and 39904 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:42:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:09,629 INFO L93 Difference]: Finished difference Result 42643 states and 58080 transitions. [2025-01-09 04:42:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:09,630 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:42:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:09,671 INFO L225 Difference]: With dead ends: 42643 [2025-01-09 04:42:09,671 INFO L226 Difference]: Without dead ends: 36349 [2025-01-09 04:42:09,685 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:09,686 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 984 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:09,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 1200 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36349 states. [2025-01-09 04:42:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36349 to 34355. [2025-01-09 04:42:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34355 states, 34354 states have (on average 1.3549513884846014) internal successors, (46548), 34354 states have internal predecessors, (46548), 0 states have call successors, (0), 0 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:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34355 states to 34355 states and 46548 transitions. [2025-01-09 04:42:10,166 INFO L78 Accepts]: Start accepts. Automaton has 34355 states and 46548 transitions. Word has length 74 [2025-01-09 04:42:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:10,167 INFO L471 AbstractCegarLoop]: Abstraction has 34355 states and 46548 transitions. [2025-01-09 04:42:10,168 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:42:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 34355 states and 46548 transitions. [2025-01-09 04:42:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:42:10,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:10,170 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, 1, 1, 1, 1, 1] [2025-01-09 04:42:10,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:42:10,171 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:10,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:10,171 INFO L85 PathProgramCache]: Analyzing trace with hash 324913683, now seen corresponding path program 1 times [2025-01-09 04:42:10,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:10,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658647017] [2025-01-09 04:42:10,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:10,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:10,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:42:10,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:42:10,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:10,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:10,277 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:42:10,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:10,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658647017] [2025-01-09 04:42:10,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658647017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:10,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:10,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:42:10,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552229486] [2025-01-09 04:42:10,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:10,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:10,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:10,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:10,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:10,278 INFO L87 Difference]: Start difference. First operand 34355 states and 46548 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:10,463 INFO L93 Difference]: Finished difference Result 47277 states and 64187 transitions. [2025-01-09 04:42:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:10,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-01-09 04:42:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:10,502 INFO L225 Difference]: With dead ends: 47277 [2025-01-09 04:42:10,502 INFO L226 Difference]: Without dead ends: 36071 [2025-01-09 04:42:10,516 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:10,517 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1023 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:10,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1203 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36071 states. [2025-01-09 04:42:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36071 to 34079. [2025-01-09 04:42:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34079 states, 34078 states have (on average 1.352426785609484) internal successors, (46088), 34078 states have internal predecessors, (46088), 0 states have call successors, (0), 0 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:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34079 states to 34079 states and 46088 transitions. [2025-01-09 04:42:11,142 INFO L78 Accepts]: Start accepts. Automaton has 34079 states and 46088 transitions. Word has length 81 [2025-01-09 04:42:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:11,142 INFO L471 AbstractCegarLoop]: Abstraction has 34079 states and 46088 transitions. [2025-01-09 04:42:11,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 34079 states and 46088 transitions. [2025-01-09 04:42:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:42:11,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:11,145 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, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:11,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:42:11,146 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:11,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2144075086, now seen corresponding path program 1 times [2025-01-09 04:42:11,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:11,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305922051] [2025-01-09 04:42:11,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:11,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:11,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:42:11,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:42:11,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:11,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:11,263 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:42:11,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:11,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305922051] [2025-01-09 04:42:11,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305922051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:11,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:11,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:42:11,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796383348] [2025-01-09 04:42:11,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:11,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:42:11,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:11,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:42:11,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:11,264 INFO L87 Difference]: Start difference. First operand 34079 states and 46088 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:11,774 INFO L93 Difference]: Finished difference Result 41513 states and 56028 transitions. [2025-01-09 04:42:11,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:42:11,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:42:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:11,825 INFO L225 Difference]: With dead ends: 41513 [2025-01-09 04:42:11,826 INFO L226 Difference]: Without dead ends: 40965 [2025-01-09 04:42:11,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:42:11,841 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 2012 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:11,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 583 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:42:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40965 states. [2025-01-09 04:42:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40965 to 34078. [2025-01-09 04:42:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34078 states, 34077 states have (on average 1.3523784370689909) internal successors, (46085), 34077 states have internal predecessors, (46085), 0 states have call successors, (0), 0 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:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34078 states to 34078 states and 46085 transitions. [2025-01-09 04:42:12,331 INFO L78 Accepts]: Start accepts. Automaton has 34078 states and 46085 transitions. Word has length 82 [2025-01-09 04:42:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:12,331 INFO L471 AbstractCegarLoop]: Abstraction has 34078 states and 46085 transitions. [2025-01-09 04:42:12,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 34078 states and 46085 transitions. [2025-01-09 04:42:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:42:12,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:12,338 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] [2025-01-09 04:42:12,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:42:12,338 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:12,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:12,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1665802254, now seen corresponding path program 1 times [2025-01-09 04:42:12,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:12,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315389753] [2025-01-09 04:42:12,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:12,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:12,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:42:12,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:42:12,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:12,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:42:12,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315389753] [2025-01-09 04:42:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315389753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:12,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:12,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:42:12,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012342688] [2025-01-09 04:42:12,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:12,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:42:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:12,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:42:12,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:42:12,690 INFO L87 Difference]: Start difference. First operand 34078 states and 46085 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:13,620 INFO L93 Difference]: Finished difference Result 72971 states and 97576 transitions. [2025-01-09 04:42:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:42:13,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-01-09 04:42:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:13,767 INFO L225 Difference]: With dead ends: 72971 [2025-01-09 04:42:13,767 INFO L226 Difference]: Without dead ends: 57348 [2025-01-09 04:42:13,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:42:13,817 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 2373 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2373 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:13,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2373 Valid, 1630 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:42:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57348 states. [2025-01-09 04:42:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57348 to 34058. [2025-01-09 04:42:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34058 states, 34057 states have (on average 1.3524972839651173) internal successors, (46062), 34057 states have internal predecessors, (46062), 0 states have call successors, (0), 0 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:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34058 states to 34058 states and 46062 transitions. [2025-01-09 04:42:14,335 INFO L78 Accepts]: Start accepts. Automaton has 34058 states and 46062 transitions. Word has length 88 [2025-01-09 04:42:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:14,335 INFO L471 AbstractCegarLoop]: Abstraction has 34058 states and 46062 transitions. [2025-01-09 04:42:14,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 34058 states and 46062 transitions. [2025-01-09 04:42:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:42:14,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:14,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] [2025-01-09 04:42:14,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:42:14,342 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:14,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:14,343 INFO L85 PathProgramCache]: Analyzing trace with hash 730861950, now seen corresponding path program 1 times [2025-01-09 04:42:14,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:14,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856026780] [2025-01-09 04:42:14,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:14,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:42:14,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:42:14,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:14,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:14,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:14,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856026780] [2025-01-09 04:42:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856026780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:14,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:14,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:42:14,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119747054] [2025-01-09 04:42:14,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:14,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:42:14,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:14,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:42:14,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:42:14,525 INFO L87 Difference]: Start difference. First operand 34058 states and 46062 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 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,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:15,615 INFO L93 Difference]: Finished difference Result 72990 states and 97632 transitions. [2025-01-09 04:42:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:42:15,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-09 04:42:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:15,682 INFO L225 Difference]: With dead ends: 72990 [2025-01-09 04:42:15,682 INFO L226 Difference]: Without dead ends: 57388 [2025-01-09 04:42:15,717 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:42:15,721 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 2338 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2338 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:15,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2338 Valid, 1598 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:42:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57388 states. [2025-01-09 04:42:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57388 to 34520. [2025-01-09 04:42:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34520 states, 34519 states have (on average 1.3509661345925432) internal successors, (46634), 34519 states have internal predecessors, (46634), 0 states have call successors, (0), 0 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,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34520 states to 34520 states and 46634 transitions. [2025-01-09 04:42:16,253 INFO L78 Accepts]: Start accepts. Automaton has 34520 states and 46634 transitions. Word has length 89 [2025-01-09 04:42:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:16,254 INFO L471 AbstractCegarLoop]: Abstraction has 34520 states and 46634 transitions. [2025-01-09 04:42:16,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 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,254 INFO L276 IsEmpty]: Start isEmpty. Operand 34520 states and 46634 transitions. [2025-01-09 04:42:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:42:16,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:16,268 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] [2025-01-09 04:42:16,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:42:16,268 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:16,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash -167089379, now seen corresponding path program 1 times [2025-01-09 04:42:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:16,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103693631] [2025-01-09 04:42:16,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:16,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:42:16,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:42:16,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:16,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:42:16,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:16,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103693631] [2025-01-09 04:42:16,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103693631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:16,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:16,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:42:16,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695191745] [2025-01-09 04:42:16,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:16,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:42:16,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:16,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:42:16,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:42:16,525 INFO L87 Difference]: Start difference. First operand 34520 states and 46634 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:17,401 INFO L93 Difference]: Finished difference Result 66683 states and 89872 transitions. [2025-01-09 04:42:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:42:17,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-09 04:42:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:17,459 INFO L225 Difference]: With dead ends: 66683 [2025-01-09 04:42:17,459 INFO L226 Difference]: Without dead ends: 51161 [2025-01-09 04:42:17,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:42:17,480 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 2454 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2454 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:17,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2454 Valid, 1058 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:42:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51161 states. [2025-01-09 04:42:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51161 to 34504. [2025-01-09 04:42:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34504 states, 34503 states have (on average 1.3510709213691563) internal successors, (46616), 34503 states have internal predecessors, (46616), 0 states have call successors, (0), 0 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,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34504 states to 34504 states and 46616 transitions. [2025-01-09 04:42:17,918 INFO L78 Accepts]: Start accepts. Automaton has 34504 states and 46616 transitions. Word has length 89 [2025-01-09 04:42:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:17,918 INFO L471 AbstractCegarLoop]: Abstraction has 34504 states and 46616 transitions. [2025-01-09 04:42:17,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 34504 states and 46616 transitions. [2025-01-09 04:42:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:42:17,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:17,925 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] [2025-01-09 04:42:17,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:42:17,926 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:17,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:17,926 INFO L85 PathProgramCache]: Analyzing trace with hash 964121325, now seen corresponding path program 1 times [2025-01-09 04:42:17,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:17,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706159145] [2025-01-09 04:42:17,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:17,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:17,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:42:17,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:42:17,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:17,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:42:18,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:18,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706159145] [2025-01-09 04:42:18,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706159145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:18,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:18,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:42:18,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202629118] [2025-01-09 04:42:18,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:18,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:42:18,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:18,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:42:18,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:42:18,404 INFO L87 Difference]: Start difference. First operand 34504 states and 46616 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:18,969 INFO L93 Difference]: Finished difference Result 65430 states and 88450 transitions. [2025-01-09 04:42:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:42:18,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-09 04:42:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:19,025 INFO L225 Difference]: With dead ends: 65430 [2025-01-09 04:42:19,025 INFO L226 Difference]: Without dead ends: 50002 [2025-01-09 04:42:19,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:42:19,040 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 2287 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2287 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:19,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2287 Valid, 849 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:42:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50002 states. [2025-01-09 04:42:19,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50002 to 34492. [2025-01-09 04:42:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34492 states, 34491 states have (on average 1.351164071786843) internal successors, (46603), 34491 states have internal predecessors, (46603), 0 states have call successors, (0), 0 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,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34492 states to 34492 states and 46603 transitions. [2025-01-09 04:42:19,472 INFO L78 Accepts]: Start accepts. Automaton has 34492 states and 46603 transitions. Word has length 89 [2025-01-09 04:42:19,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:19,475 INFO L471 AbstractCegarLoop]: Abstraction has 34492 states and 46603 transitions. [2025-01-09 04:42:19,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 34492 states and 46603 transitions. [2025-01-09 04:42:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:42:19,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:19,484 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] [2025-01-09 04:42:19,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:42:19,485 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:19,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:19,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1490479423, now seen corresponding path program 1 times [2025-01-09 04:42:19,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:19,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364176575] [2025-01-09 04:42:19,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:19,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:42:19,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:42:19,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:19,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364176575] [2025-01-09 04:42:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364176575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:19,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:19,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:19,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83179221] [2025-01-09 04:42:19,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:19,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:19,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:19,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:19,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:19,570 INFO L87 Difference]: Start difference. First operand 34492 states and 46603 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 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,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:19,742 INFO L93 Difference]: Finished difference Result 68108 states and 92165 transitions. [2025-01-09 04:42:19,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:19,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 04:42:19,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:19,780 INFO L225 Difference]: With dead ends: 68108 [2025-01-09 04:42:19,780 INFO L226 Difference]: Without dead ends: 34494 [2025-01-09 04:42:19,804 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:19,804 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 172 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:19,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 813 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34494 states. [2025-01-09 04:42:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34494 to 34492. [2025-01-09 04:42:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34492 states, 34491 states have (on average 1.3351019106433561) internal successors, (46049), 34491 states have internal predecessors, (46049), 0 states have call successors, (0), 0 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,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34492 states to 34492 states and 46049 transitions. [2025-01-09 04:42:20,216 INFO L78 Accepts]: Start accepts. Automaton has 34492 states and 46049 transitions. Word has length 90 [2025-01-09 04:42:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:20,216 INFO L471 AbstractCegarLoop]: Abstraction has 34492 states and 46049 transitions. [2025-01-09 04:42:20,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 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,216 INFO L276 IsEmpty]: Start isEmpty. Operand 34492 states and 46049 transitions. [2025-01-09 04:42:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:42:20,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:20,223 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] [2025-01-09 04:42:20,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:42:20,223 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:20,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:20,224 INFO L85 PathProgramCache]: Analyzing trace with hash -324068378, now seen corresponding path program 1 times [2025-01-09 04:42:20,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:20,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135520819] [2025-01-09 04:42:20,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:20,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:42:20,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:42:20,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:20,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:20,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:20,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135520819] [2025-01-09 04:42:20,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135520819] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:42:20,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075908599] [2025-01-09 04:42:20,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:20,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:20,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:20,460 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:20,465 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:20,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:42:20,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:42:20,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:20,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:20,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:42:20,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:42:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:21,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:42:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075908599] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:42:21,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:42:21,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 15 [2025-01-09 04:42:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573020495] [2025-01-09 04:42:21,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:42:21,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 04:42:21,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:21,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 04:42:21,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:42:21,487 INFO L87 Difference]: Start difference. First operand 34492 states and 46049 transitions. Second operand has 15 states, 15 states have (on average 13.866666666666667) internal successors, (208), 15 states have internal predecessors, (208), 0 states have call successors, (0), 0 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,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:22,976 INFO L93 Difference]: Finished difference Result 261496 states and 351477 transitions. [2025-01-09 04:42:22,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 04:42:22,977 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.866666666666667) internal successors, (208), 15 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 04:42:22,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:23,326 INFO L225 Difference]: With dead ends: 261496 [2025-01-09 04:42:23,326 INFO L226 Difference]: Without dead ends: 227875 [2025-01-09 04:42:23,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 04:42:23,414 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 3849 mSDsluCounter, 4025 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3849 SdHoareTripleChecker+Valid, 4914 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:23,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3849 Valid, 4914 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:42:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227875 states. [2025-01-09 04:42:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227875 to 207309. [2025-01-09 04:42:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207309 states, 207308 states have (on average 1.3250911686958535) internal successors, (274702), 207308 states have internal predecessors, (274702), 0 states have call successors, (0), 0 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,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207309 states to 207309 states and 274702 transitions. [2025-01-09 04:42:26,190 INFO L78 Accepts]: Start accepts. Automaton has 207309 states and 274702 transitions. Word has length 90 [2025-01-09 04:42:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:26,190 INFO L471 AbstractCegarLoop]: Abstraction has 207309 states and 274702 transitions. [2025-01-09 04:42:26,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.866666666666667) internal successors, (208), 15 states have internal predecessors, (208), 0 states have call successors, (0), 0 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,190 INFO L276 IsEmpty]: Start isEmpty. Operand 207309 states and 274702 transitions. [2025-01-09 04:42:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:42:26,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:26,569 INFO L218 NwaCegarLoop]: trace histogram [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:26,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:42:26,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:26,770 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:26,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:26,770 INFO L85 PathProgramCache]: Analyzing trace with hash 971467756, now seen corresponding path program 1 times [2025-01-09 04:42:26,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:26,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097871357] [2025-01-09 04:42:26,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:26,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:26,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:42:26,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:42:26,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:26,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:26,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097871357] [2025-01-09 04:42:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097871357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:26,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:26,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:42:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551975756] [2025-01-09 04:42:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:26,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:26,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:26,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:26,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:26,880 INFO L87 Difference]: Start difference. First operand 207309 states and 274702 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 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:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:28,687 INFO L93 Difference]: Finished difference Result 419991 states and 554830 transitions. [2025-01-09 04:42:28,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:42:28,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 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:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:29,046 INFO L225 Difference]: With dead ends: 419991 [2025-01-09 04:42:29,046 INFO L226 Difference]: Without dead ends: 213311 [2025-01-09 04:42:29,136 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:29,136 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 886 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:29,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 625 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:42:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213311 states. [2025-01-09 04:42:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213311 to 199119. [2025-01-09 04:42:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199119 states, 199118 states have (on average 1.2952621058869616) internal successors, (257910), 199118 states have internal predecessors, (257910), 0 states have call successors, (0), 0 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,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199119 states to 199119 states and 257910 transitions. [2025-01-09 04:42:32,010 INFO L78 Accepts]: Start accepts. Automaton has 199119 states and 257910 transitions. Word has length 93 [2025-01-09 04:42:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:32,010 INFO L471 AbstractCegarLoop]: Abstraction has 199119 states and 257910 transitions. [2025-01-09 04:42:32,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 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:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 199119 states and 257910 transitions. [2025-01-09 04:42:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:42:32,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:32,014 INFO L218 NwaCegarLoop]: trace histogram [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:32,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:42:32,015 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:32,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1567663160, now seen corresponding path program 1 times [2025-01-09 04:42:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:32,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907602376] [2025-01-09 04:42:32,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:32,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:32,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:42:32,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:42:32,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:32,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:32,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907602376] [2025-01-09 04:42:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907602376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:32,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80637418] [2025-01-09 04:42:32,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:32,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:32,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:32,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:32,070 INFO L87 Difference]: Start difference. First operand 199119 states and 257910 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:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:33,013 INFO L93 Difference]: Finished difference Result 247363 states and 319730 transitions. [2025-01-09 04:42:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:33,013 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:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:33,240 INFO L225 Difference]: With dead ends: 247363 [2025-01-09 04:42:33,240 INFO L226 Difference]: Without dead ends: 150843 [2025-01-09 04:42:33,303 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:33,304 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 165 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:33,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 778 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150843 states. [2025-01-09 04:42:34,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150843 to 150224. [2025-01-09 04:42:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150224 states, 150223 states have (on average 1.280389820466906) internal successors, (192344), 150223 states have internal predecessors, (192344), 0 states have call successors, (0), 0 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,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150224 states to 150224 states and 192344 transitions. [2025-01-09 04:42:35,213 INFO L78 Accepts]: Start accepts. Automaton has 150224 states and 192344 transitions. Word has length 93 [2025-01-09 04:42:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:35,213 INFO L471 AbstractCegarLoop]: Abstraction has 150224 states and 192344 transitions. [2025-01-09 04:42:35,213 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:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 150224 states and 192344 transitions. [2025-01-09 04:42:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:42:35,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:35,217 INFO L218 NwaCegarLoop]: trace histogram [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:35,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:42:35,218 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:35,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:35,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1199099763, now seen corresponding path program 1 times [2025-01-09 04:42:35,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:35,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121231963] [2025-01-09 04:42:35,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:35,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:35,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:42:35,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:42:35,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:35,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:35,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:35,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121231963] [2025-01-09 04:42:35,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121231963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:35,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:35,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:42:35,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519932502] [2025-01-09 04:42:35,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:35,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:35,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:35,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:35,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:35,275 INFO L87 Difference]: Start difference. First operand 150224 states and 192344 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 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:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:36,518 INFO L93 Difference]: Finished difference Result 344469 states and 439839 transitions. [2025-01-09 04:42:36,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:42:36,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 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:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:36,752 INFO L225 Difference]: With dead ends: 344469 [2025-01-09 04:42:36,753 INFO L226 Difference]: Without dead ends: 194883 [2025-01-09 04:42:37,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:42:37,255 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 792 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:37,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 730 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:42:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194883 states. [2025-01-09 04:42:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194883 to 160729. [2025-01-09 04:42:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160729 states, 160728 states have (on average 1.245103528943308) internal successors, (200123), 160728 states have internal predecessors, (200123), 0 states have call successors, (0), 0 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:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160729 states to 160729 states and 200123 transitions. [2025-01-09 04:42:39,545 INFO L78 Accepts]: Start accepts. Automaton has 160729 states and 200123 transitions. Word has length 93 [2025-01-09 04:42:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:39,545 INFO L471 AbstractCegarLoop]: Abstraction has 160729 states and 200123 transitions. [2025-01-09 04:42:39,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 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:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 160729 states and 200123 transitions. [2025-01-09 04:42:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:42:39,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:39,549 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:42:39,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:42:39,550 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:39,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:39,550 INFO L85 PathProgramCache]: Analyzing trace with hash -950976744, now seen corresponding path program 1 times [2025-01-09 04:42:39,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:39,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004204177] [2025-01-09 04:42:39,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:39,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:42:39,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:42:39,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:39,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:39,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:39,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004204177] [2025-01-09 04:42:39,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004204177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:39,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:39,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904690060] [2025-01-09 04:42:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:39,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:39,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:39,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:39,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:39,595 INFO L87 Difference]: Start difference. First operand 160729 states and 200123 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:40,038 INFO L93 Difference]: Finished difference Result 201869 states and 250853 transitions. [2025-01-09 04:42:40,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:40,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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:40,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:40,189 INFO L225 Difference]: With dead ends: 201869 [2025-01-09 04:42:40,190 INFO L226 Difference]: Without dead ends: 110527 [2025-01-09 04:42:40,255 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:40,255 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 167 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:40,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 768 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110527 states. [2025-01-09 04:42:41,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110527 to 106333. [2025-01-09 04:42:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106333 states, 106332 states have (on average 1.2308524244818118) internal successors, (130879), 106332 states have internal predecessors, (130879), 0 states have call successors, (0), 0 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:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106333 states to 106333 states and 130879 transitions. [2025-01-09 04:42:41,747 INFO L78 Accepts]: Start accepts. Automaton has 106333 states and 130879 transitions. Word has length 94 [2025-01-09 04:42:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:41,747 INFO L471 AbstractCegarLoop]: Abstraction has 106333 states and 130879 transitions. [2025-01-09 04:42:41,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 106333 states and 130879 transitions. [2025-01-09 04:42:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:42:41,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:41,752 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] [2025-01-09 04:42:41,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:42:41,753 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:41,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:41,754 INFO L85 PathProgramCache]: Analyzing trace with hash 299940606, now seen corresponding path program 1 times [2025-01-09 04:42:41,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:41,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891935925] [2025-01-09 04:42:41,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:41,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:41,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:42:41,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:42:41,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:41,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:42:41,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:41,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891935925] [2025-01-09 04:42:41,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891935925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:41,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:41,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:41,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712645338] [2025-01-09 04:42:41,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:41,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:41,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:41,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:41,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:41,821 INFO L87 Difference]: Start difference. First operand 106333 states and 130879 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:42,200 INFO L93 Difference]: Finished difference Result 139096 states and 171049 transitions. [2025-01-09 04:42:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:42,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 96 [2025-01-09 04:42:42,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:42,298 INFO L225 Difference]: With dead ends: 139096 [2025-01-09 04:42:42,298 INFO L226 Difference]: Without dead ends: 73032 [2025-01-09 04:42:42,349 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:42,353 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 139 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:42,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 773 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73032 states. [2025-01-09 04:42:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73032 to 72712. [2025-01-09 04:42:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72712 states, 72711 states have (on average 1.210284551168324) internal successors, (88001), 72711 states have internal predecessors, (88001), 0 states have call successors, (0), 0 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:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72712 states to 72712 states and 88001 transitions. [2025-01-09 04:42:43,331 INFO L78 Accepts]: Start accepts. Automaton has 72712 states and 88001 transitions. Word has length 96 [2025-01-09 04:42:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:43,336 INFO L471 AbstractCegarLoop]: Abstraction has 72712 states and 88001 transitions. [2025-01-09 04:42:43,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 72712 states and 88001 transitions. [2025-01-09 04:42:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:42:43,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:43,343 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] [2025-01-09 04:42:43,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:42:43,343 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:43,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1658214033, now seen corresponding path program 1 times [2025-01-09 04:42:43,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:43,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301697613] [2025-01-09 04:42:43,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:43,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:42:43,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:42:43,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:43,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:43,445 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:43,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:43,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301697613] [2025-01-09 04:42:43,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301697613] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:42:43,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901849932] [2025-01-09 04:42:43,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:43,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:43,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:43,448 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:43,450 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:43,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:42:43,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:42:43,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:43,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:43,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:42:43,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:42:43,872 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:43,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:42:43,992 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:43,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901849932] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:42:43,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:42:43,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-01-09 04:42:43,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838756780] [2025-01-09 04:42:43,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:42:43,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:42:43,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:43,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:42:43,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:42:43,993 INFO L87 Difference]: Start difference. First operand 72712 states and 88001 transitions. Second operand has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 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,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:44,804 INFO L93 Difference]: Finished difference Result 144219 states and 174214 transitions. [2025-01-09 04:42:44,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:42:44,804 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 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 96 [2025-01-09 04:42:44,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:44,885 INFO L225 Difference]: With dead ends: 144219 [2025-01-09 04:42:44,886 INFO L226 Difference]: Without dead ends: 71966 [2025-01-09 04:42:44,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 183 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:44,917 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 2200 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2200 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:44,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2200 Valid, 998 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:42:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71966 states. [2025-01-09 04:42:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71966 to 71014. [2025-01-09 04:42:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71014 states, 71013 states have (on average 1.1799248025009506) internal successors, (83790), 71013 states have internal predecessors, (83790), 0 states have call successors, (0), 0 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,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71014 states to 71014 states and 83790 transitions. [2025-01-09 04:42:45,866 INFO L78 Accepts]: Start accepts. Automaton has 71014 states and 83790 transitions. Word has length 96 [2025-01-09 04:42:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:45,866 INFO L471 AbstractCegarLoop]: Abstraction has 71014 states and 83790 transitions. [2025-01-09 04:42:45,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 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,866 INFO L276 IsEmpty]: Start isEmpty. Operand 71014 states and 83790 transitions. [2025-01-09 04:42:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:42:45,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:45,869 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:42:45,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 04:42:46,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-09 04:42:46,070 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:46,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:46,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1617124220, now seen corresponding path program 1 times [2025-01-09 04:42:46,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:46,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200174437] [2025-01-09 04:42:46,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:46,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:46,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:42:46,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:42:46,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:46,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:42:46,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200174437] [2025-01-09 04:42:46,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200174437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:46,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:46,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:42:46,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328415124] [2025-01-09 04:42:46,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:46,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:42:46,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:46,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:42:46,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:42:46,136 INFO L87 Difference]: Start difference. First operand 71014 states and 83790 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:46,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:46,629 INFO L93 Difference]: Finished difference Result 143013 states and 169027 transitions. [2025-01-09 04:42:46,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:42:46,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 96 [2025-01-09 04:42:46,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:46,760 INFO L225 Difference]: With dead ends: 143013 [2025-01-09 04:42:46,760 INFO L226 Difference]: Without dead ends: 115593 [2025-01-09 04:42:46,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:42:46,801 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 305 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:46,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 828 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:42:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115593 states. [2025-01-09 04:42:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115593 to 85234. [2025-01-09 04:42:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85234 states, 85233 states have (on average 1.1815024697007028) internal successors, (100703), 85233 states have internal predecessors, (100703), 0 states have call successors, (0), 0 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:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85234 states to 85234 states and 100703 transitions. [2025-01-09 04:42:47,983 INFO L78 Accepts]: Start accepts. Automaton has 85234 states and 100703 transitions. Word has length 96 [2025-01-09 04:42:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:47,983 INFO L471 AbstractCegarLoop]: Abstraction has 85234 states and 100703 transitions. [2025-01-09 04:42:47,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 85234 states and 100703 transitions. [2025-01-09 04:42:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:42:47,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:47,987 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] [2025-01-09 04:42:47,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:42:47,988 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:47,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:47,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1034230051, now seen corresponding path program 1 times [2025-01-09 04:42:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:47,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142687520] [2025-01-09 04:42:47,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:47,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:48,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:42:48,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:42:48,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:48,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:48,038 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:48,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:48,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142687520] [2025-01-09 04:42:48,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142687520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:48,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:48,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:48,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191572542] [2025-01-09 04:42:48,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:48,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:48,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:48,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:48,040 INFO L87 Difference]: Start difference. First operand 85234 states and 100703 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:48,445 INFO L93 Difference]: Finished difference Result 175293 states and 207154 transitions. [2025-01-09 04:42:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:48,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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 97 [2025-01-09 04:42:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:48,601 INFO L225 Difference]: With dead ends: 175293 [2025-01-09 04:42:48,602 INFO L226 Difference]: Without dead ends: 133655 [2025-01-09 04:42:48,937 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:48,937 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 137 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:48,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 875 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133655 states. [2025-01-09 04:42:49,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133655 to 90642. [2025-01-09 04:42:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90642 states, 90641 states have (on average 1.1738065555322645) internal successors, (106395), 90641 states have internal predecessors, (106395), 0 states have call successors, (0), 0 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:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90642 states to 90642 states and 106395 transitions. [2025-01-09 04:42:49,994 INFO L78 Accepts]: Start accepts. Automaton has 90642 states and 106395 transitions. Word has length 97 [2025-01-09 04:42:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:49,994 INFO L471 AbstractCegarLoop]: Abstraction has 90642 states and 106395 transitions. [2025-01-09 04:42:49,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 90642 states and 106395 transitions. [2025-01-09 04:42:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:42:49,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:49,998 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] [2025-01-09 04:42:49,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 04:42:49,998 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:49,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash 290123657, now seen corresponding path program 1 times [2025-01-09 04:42:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:49,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775185230] [2025-01-09 04:42:49,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:49,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:50,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:42:50,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:42:50,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:50,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:50,204 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:50,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:50,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775185230] [2025-01-09 04:42:50,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775185230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:50,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:50,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:42:50,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422430697] [2025-01-09 04:42:50,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:50,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:42:50,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:50,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:42:50,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:42:50,206 INFO L87 Difference]: Start difference. First operand 90642 states and 106395 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 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:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:51,231 INFO L93 Difference]: Finished difference Result 207052 states and 242962 transitions. [2025-01-09 04:42:51,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:42:51,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 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 98 [2025-01-09 04:42:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:51,460 INFO L225 Difference]: With dead ends: 207052 [2025-01-09 04:42:51,460 INFO L226 Difference]: Without dead ends: 187012 [2025-01-09 04:42:51,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:42:51,520 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 1483 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:51,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1331 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:42:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187012 states. [2025-01-09 04:42:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187012 to 90642. [2025-01-09 04:42:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90642 states, 90641 states have (on average 1.1737844904623735) internal successors, (106393), 90641 states have internal predecessors, (106393), 0 states have call successors, (0), 0 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,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90642 states to 90642 states and 106393 transitions. [2025-01-09 04:42:53,195 INFO L78 Accepts]: Start accepts. Automaton has 90642 states and 106393 transitions. Word has length 98 [2025-01-09 04:42:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:53,195 INFO L471 AbstractCegarLoop]: Abstraction has 90642 states and 106393 transitions. [2025-01-09 04:42:53,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 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:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 90642 states and 106393 transitions. [2025-01-09 04:42:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:42:53,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:53,200 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:53,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 04:42:53,201 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:53,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:53,201 INFO L85 PathProgramCache]: Analyzing trace with hash 965797167, now seen corresponding path program 1 times [2025-01-09 04:42:53,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:53,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454242937] [2025-01-09 04:42:53,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:53,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:53,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:42:53,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:42:53,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:53,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:53,502 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:53,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:53,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454242937] [2025-01-09 04:42:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454242937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:53,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:53,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:42:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069755415] [2025-01-09 04:42:53,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:53,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:42:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:53,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:42:53,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:42:53,507 INFO L87 Difference]: Start difference. First operand 90642 states and 106393 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 9 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:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:54,777 INFO L93 Difference]: Finished difference Result 186521 states and 218588 transitions. [2025-01-09 04:42:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:42:54,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 9 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:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:54,996 INFO L225 Difference]: With dead ends: 186521 [2025-01-09 04:42:54,997 INFO L226 Difference]: Without dead ends: 137658 [2025-01-09 04:42:55,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:42:55,059 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 1503 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:55,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1424 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:42:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137658 states. [2025-01-09 04:42:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137658 to 133206. [2025-01-09 04:42:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133206 states, 133205 states have (on average 1.1707668631057393) internal successors, (155952), 133205 states have internal predecessors, (155952), 0 states have call successors, (0), 0 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:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133206 states to 133206 states and 155952 transitions. [2025-01-09 04:42:56,943 INFO L78 Accepts]: Start accepts. Automaton has 133206 states and 155952 transitions. Word has length 99 [2025-01-09 04:42:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:56,943 INFO L471 AbstractCegarLoop]: Abstraction has 133206 states and 155952 transitions. [2025-01-09 04:42:56,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 9 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:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 133206 states and 155952 transitions. [2025-01-09 04:42:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:42:56,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:56,948 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:56,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:42:56,948 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 04:42:56,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash 541663463, now seen corresponding path program 1 times [2025-01-09 04:42:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:56,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825706180] [2025-01-09 04:42:56,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:56,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:42:56,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:42:56,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:56,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:57,218 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:57,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:57,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825706180] [2025-01-09 04:42:57,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825706180] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:42:57,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320388220] [2025-01-09 04:42:57,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:57,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:42:57,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:57,222 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:57,229 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:57,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:42:57,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:42:57,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:57,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:57,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 04:42:57,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:42:58,034 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:58,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:42:59,013 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:59,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320388220] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:42:59,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:42:59,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 31 [2025-01-09 04:42:59,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249564362] [2025-01-09 04:42:59,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:42:59,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 04:42:59,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:59,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 04:42:59,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-01-09 04:42:59,015 INFO L87 Difference]: Start difference. First operand 133206 states and 155952 transitions. Second operand has 32 states, 32 states have (on average 8.8125) internal successors, (282), 31 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)