./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5f122a2f661c35cf909df5e65028709a713dbb0aa782040b0d88c7cb2c6627f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:50:29,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:50:29,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:50:29,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:50:29,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:50:29,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:50:29,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:50:29,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:50:29,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:50:29,330 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:50:29,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:50:29,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:50:29,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:50:29,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:50:29,331 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:50:29,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:50:29,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:50:29,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:50:29,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:50:29,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:50:29,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:50:29,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:50:29,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:50:29,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:50:29,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:50:29,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:50:29,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:50:29,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:50:29,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:50:29,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:50:29,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:50:29,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:50:29,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:50:29,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:50:29,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:50:29,333 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:50:29,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:50:29,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:50:29,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:50:29,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:50:29,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:50:29,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:50:29,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:50:29,333 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 -> d5f122a2f661c35cf909df5e65028709a713dbb0aa782040b0d88c7cb2c6627f [2025-02-05 16:50:29,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:50:29,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:50:29,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:50:29,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:50:29,513 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:50:29,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:50:30,657 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92110575a/8165cea97cbe47a6b34596b2a7d569e9/FLAGbed7b6aec [2025-02-05 16:50:31,032 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:50:31,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:50:31,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92110575a/8165cea97cbe47a6b34596b2a7d569e9/FLAGbed7b6aec [2025-02-05 16:50:31,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92110575a/8165cea97cbe47a6b34596b2a7d569e9 [2025-02-05 16:50:31,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:50:31,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:50:31,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:50:31,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:50:31,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:50:31,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:50:31" (1/1) ... [2025-02-05 16:50:31,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6495d94c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:31, skipping insertion in model container [2025-02-05 16:50:31,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:50:31" (1/1) ... [2025-02-05 16:50:31,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:50:31,797 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35167,35180] [2025-02-05 16:50:31,808 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36057,36070] [2025-02-05 16:50:31,823 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37945,37958] [2025-02-05 16:50:31,837 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38835,38848] [2025-02-05 16:50:31,863 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41666,41679] [2025-02-05 16:50:31,871 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[42559,42572] [2025-02-05 16:50:31,895 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[44450,44463] [2025-02-05 16:50:31,908 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[45727,45740] [2025-02-05 16:50:32,002 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61515,61528] [2025-02-05 16:50:32,011 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[62408,62421] [2025-02-05 16:50:32,025 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[64299,64312] [2025-02-05 16:50:32,056 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[68814,68827] [2025-02-05 16:50:32,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:50:32,148 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:50:32,438 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35167,35180] [2025-02-05 16:50:32,454 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36057,36070] [2025-02-05 16:50:32,482 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37945,37958] [2025-02-05 16:50:32,499 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38835,38848] [2025-02-05 16:50:32,539 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41666,41679] [2025-02-05 16:50:32,553 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[42559,42572] [2025-02-05 16:50:32,565 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[44450,44463] [2025-02-05 16:50:32,575 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[45727,45740] [2025-02-05 16:50:32,645 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61515,61528] [2025-02-05 16:50:32,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[62408,62421] [2025-02-05 16:50:32,666 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[64299,64312] [2025-02-05 16:50:32,693 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_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[68814,68827] [2025-02-05 16:50:32,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:50:32,804 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:50:32,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32 WrapperNode [2025-02-05 16:50:32,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:50:32,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:50:32,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:50:32,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:50:32,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (1/1) ... [2025-02-05 16:50:32,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (1/1) ... [2025-02-05 16:50:32,929 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4376 [2025-02-05 16:50:32,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:50:32,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:50:32,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:50:32,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:50:32,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (1/1) ... [2025-02-05 16:50:32,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (1/1) ... [2025-02-05 16:50:32,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (1/1) ... [2025-02-05 16:50:32,991 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:50:32,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (1/1) ... [2025-02-05 16:50:32,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (1/1) ... [2025-02-05 16:50:33,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (1/1) ... [2025-02-05 16:50:33,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (1/1) ... [2025-02-05 16:50:33,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (1/1) ... [2025-02-05 16:50:33,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (1/1) ... [2025-02-05 16:50:33,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:50:33,061 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:50:33,061 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:50:33,061 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:50:33,061 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (1/1) ... [2025-02-05 16:50:33,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:50:33,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:50:33,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:50:33,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:50:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:50:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:50:33,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:50:33,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:50:33,274 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:50:33,275 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:50:35,480 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2888: havoc main_~node1__newmax~6#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-02-05 16:50:35,481 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4475: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-02-05 16:50:35,481 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: havoc main_~node4__newmax~9#1; [2025-02-05 16:50:35,481 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500: havoc main_~node4__newmax~7#1; [2025-02-05 16:50:35,481 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4086: havoc main_~node2__newmax~7#1; [2025-02-05 16:50:35,482 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4756: havoc main_~node4__newmax~12#1; [2025-02-05 16:50:35,482 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4889: havoc main_~check__tmp~19#1; [2025-02-05 16:50:35,482 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2644: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-02-05 16:50:35,482 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3305: havoc main_~node4____CPAchecker_TMP_2~3#1;havoc main_~node4____CPAchecker_TMP_1~3#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-02-05 16:50:35,482 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1853: havoc main_~node1__newmax~5#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__newmax~4#1;havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__newmax~4#1;havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__newmax~4#1;havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1;havoc main_~node1__newmax~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node4__newmax~3#1;havoc main_~node3__newmax~3#1;havoc main_~node2__newmax~3#1;havoc main_~node1__newmax~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__newmax~2#1;havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__newmax~2#1;havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__newmax~2#1;havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__newmax~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__newmax~1#1;havoc main_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__newmax~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__newmax~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__newmax~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-02-05 16:50:35,482 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991: havoc main_~node4__newmax~5#1; [2025-02-05 16:50:35,482 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5035: havoc main_~node4__newmax~13#1; [2025-02-05 16:50:35,482 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2135: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:50:35,482 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2797: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1; [2025-02-05 16:50:35,482 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: havoc main_~node2__newmax~6#1; [2025-02-05 16:50:35,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4388: havoc main_~node4__newmax~11#1; [2025-02-05 16:50:35,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4521: havoc main_~check__tmp~17#1; [2025-02-05 16:50:35,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3470: havoc main_~node3____CPAchecker_TMP_2~3#1;havoc main_~node3____CPAchecker_TMP_1~3#1;havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-02-05 16:50:35,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4132: havoc main_~node3__newmax~8#1; [2025-02-05 16:50:35,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4265: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-02-05 16:50:35,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-05 16:50:35,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899: havoc main_~node2__newmax~5#1; [2025-02-05 16:50:35,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3100: havoc main_~check__tmp~13#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2710: havoc main_~node4__newmax~8#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3635: havoc main_~node2____CPAchecker_TMP_2~3#1;havoc main_~node2____CPAchecker_TMP_1~3#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2980: havoc main_~node3__newmax~7#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2454: havoc main_~node3__newmax~6#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2587: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4178: havoc main_~node4__newmax~10#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5237: havoc main_~check__tmp~21#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4710: havoc main_~node3__newmax~9#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4843: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~18#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2201: havoc main_~node4__newmax~6#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5111: havoc main_~check__tmp~20#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4322: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2025-02-05 16:50:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1945: havoc main_~node3__newmax~5#1; [2025-02-05 16:50:35,485 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2078: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:50:35,485 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2345: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-05 16:50:35,485 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3800: havoc main_~node1____CPAchecker_TMP_2~3#1;havoc main_~node1____CPAchecker_TMP_1~3#1;havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-02-05 16:50:35,696 INFO L? ?]: Removed 279 outVars from TransFormulas that were not future-live. [2025-02-05 16:50:35,696 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:50:35,725 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:50:35,729 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:50:35,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:50:35 BoogieIcfgContainer [2025-02-05 16:50:35,729 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:50:35,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:50:35,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:50:35,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:50:35,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:50:31" (1/3) ... [2025-02-05 16:50:35,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c79a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:50:35, skipping insertion in model container [2025-02-05 16:50:35,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:32" (2/3) ... [2025-02-05 16:50:35,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c79a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:50:35, skipping insertion in model container [2025-02-05 16:50:35,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:50:35" (3/3) ... [2025-02-05 16:50:35,740 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:50:35,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:50:35,769 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 1022 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-02-05 16:50:35,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:50:35,868 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;@2a778acb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:50:35,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-05 16:50:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 1022 states, 1009 states have (on average 1.8166501486620417) internal successors, (1833), 1021 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-02-05 16:50:35,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:35,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:35,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:35,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:35,915 INFO L85 PathProgramCache]: Analyzing trace with hash 384358945, now seen corresponding path program 1 times [2025-02-05 16:50:35,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:35,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433041913] [2025-02-05 16:50:35,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:35,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:36,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-02-05 16:50:36,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-02-05 16:50:36,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:36,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:36,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433041913] [2025-02-05 16:50:36,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433041913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:36,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:36,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:36,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175016386] [2025-02-05 16:50:36,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:36,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:36,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:36,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:36,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:36,764 INFO L87 Difference]: Start difference. First operand has 1022 states, 1009 states have (on average 1.8166501486620417) internal successors, (1833), 1021 states have internal predecessors, (1833), 0 states have call successors, (0), 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 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:37,191 INFO L93 Difference]: Finished difference Result 1787 states and 3176 transitions. [2025-02-05 16:50:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:37,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 323 [2025-02-05 16:50:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:37,210 INFO L225 Difference]: With dead ends: 1787 [2025-02-05 16:50:37,212 INFO L226 Difference]: Without dead ends: 1479 [2025-02-05 16:50:37,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:37,222 INFO L435 NwaCegarLoop]: 2021 mSDtfsCounter, 1003 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:37,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 3350 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:50:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2025-02-05 16:50:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1477. [2025-02-05 16:50:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1465 states have (on average 1.5419795221843002) internal successors, (2259), 1476 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2259 transitions. [2025-02-05 16:50:37,340 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2259 transitions. Word has length 323 [2025-02-05 16:50:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:37,342 INFO L471 AbstractCegarLoop]: Abstraction has 1477 states and 2259 transitions. [2025-02-05 16:50:37,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2259 transitions. [2025-02-05 16:50:37,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-02-05 16:50:37,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:37,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:37,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:50:37,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:37,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash 564223601, now seen corresponding path program 1 times [2025-02-05 16:50:37,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:37,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644591630] [2025-02-05 16:50:37,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:37,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:37,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-02-05 16:50:37,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-02-05 16:50:37,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:37,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644591630] [2025-02-05 16:50:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644591630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:37,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:37,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:37,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042133584] [2025-02-05 16:50:37,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:37,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:37,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:37,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:37,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:37,739 INFO L87 Difference]: Start difference. First operand 1477 states and 2259 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:37,919 INFO L93 Difference]: Finished difference Result 2838 states and 4393 transitions. [2025-02-05 16:50:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:37,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 323 [2025-02-05 16:50:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:37,928 INFO L225 Difference]: With dead ends: 2838 [2025-02-05 16:50:37,929 INFO L226 Difference]: Without dead ends: 2397 [2025-02-05 16:50:37,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:37,932 INFO L435 NwaCegarLoop]: 1738 mSDtfsCounter, 827 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 2882 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:37,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 2882 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:50:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-02-05 16:50:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2395. [2025-02-05 16:50:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2383 states have (on average 1.546370121695342) internal successors, (3685), 2394 states have internal predecessors, (3685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3685 transitions. [2025-02-05 16:50:37,981 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3685 transitions. Word has length 323 [2025-02-05 16:50:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:37,982 INFO L471 AbstractCegarLoop]: Abstraction has 2395 states and 3685 transitions. [2025-02-05 16:50:37,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3685 transitions. [2025-02-05 16:50:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-02-05 16:50:37,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:37,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:37,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:50:37,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:37,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:37,992 INFO L85 PathProgramCache]: Analyzing trace with hash -77485347, now seen corresponding path program 1 times [2025-02-05 16:50:37,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:37,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103630972] [2025-02-05 16:50:37,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:38,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-02-05 16:50:38,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-02-05 16:50:38,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:38,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:38,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:38,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103630972] [2025-02-05 16:50:38,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103630972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:38,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:38,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:38,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732518211] [2025-02-05 16:50:38,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:38,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:38,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:38,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:38,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:38,350 INFO L87 Difference]: Start difference. First operand 2395 states and 3685 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:38,566 INFO L93 Difference]: Finished difference Result 4966 states and 7742 transitions. [2025-02-05 16:50:38,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:38,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 323 [2025-02-05 16:50:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:38,581 INFO L225 Difference]: With dead ends: 4966 [2025-02-05 16:50:38,582 INFO L226 Difference]: Without dead ends: 4289 [2025-02-05 16:50:38,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:38,586 INFO L435 NwaCegarLoop]: 1696 mSDtfsCounter, 898 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:38,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 2873 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:50:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4289 states. [2025-02-05 16:50:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4289 to 4287. [2025-02-05 16:50:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4287 states, 4275 states have (on average 1.5487719298245615) internal successors, (6621), 4286 states have internal predecessors, (6621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6621 transitions. [2025-02-05 16:50:38,718 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6621 transitions. Word has length 323 [2025-02-05 16:50:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:38,718 INFO L471 AbstractCegarLoop]: Abstraction has 4287 states and 6621 transitions. [2025-02-05 16:50:38,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6621 transitions. [2025-02-05 16:50:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-02-05 16:50:38,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:38,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:38,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:50:38,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:38,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:38,727 INFO L85 PathProgramCache]: Analyzing trace with hash -77885539, now seen corresponding path program 1 times [2025-02-05 16:50:38,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:38,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937057488] [2025-02-05 16:50:38,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:38,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:38,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-02-05 16:50:39,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-02-05 16:50:39,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:39,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937057488] [2025-02-05 16:50:39,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937057488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:39,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:39,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:50:39,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28532119] [2025-02-05 16:50:39,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:39,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:50:39,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:39,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:50:39,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:50:39,629 INFO L87 Difference]: Start difference. First operand 4287 states and 6621 transitions. Second operand has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:39,899 INFO L93 Difference]: Finished difference Result 21067 states and 32482 transitions. [2025-02-05 16:50:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:50:39,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 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 323 [2025-02-05 16:50:39,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:39,958 INFO L225 Difference]: With dead ends: 21067 [2025-02-05 16:50:39,958 INFO L226 Difference]: Without dead ends: 16791 [2025-02-05 16:50:39,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:50:39,973 INFO L435 NwaCegarLoop]: 2537 mSDtfsCounter, 4795 mSDsluCounter, 3982 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4795 SdHoareTripleChecker+Valid, 6519 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:39,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4795 Valid, 6519 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:50:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2025-02-05 16:50:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 8231. [2025-02-05 16:50:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8231 states, 8219 states have (on average 1.542280082735126) internal successors, (12676), 8230 states have internal predecessors, (12676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8231 states to 8231 states and 12676 transitions. [2025-02-05 16:50:40,199 INFO L78 Accepts]: Start accepts. Automaton has 8231 states and 12676 transitions. Word has length 323 [2025-02-05 16:50:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:40,199 INFO L471 AbstractCegarLoop]: Abstraction has 8231 states and 12676 transitions. [2025-02-05 16:50:40,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 8231 states and 12676 transitions. [2025-02-05 16:50:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-05 16:50:40,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:40,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:40,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:50:40,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:40,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1523912095, now seen corresponding path program 1 times [2025-02-05 16:50:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289751410] [2025-02-05 16:50:40,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:40,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-05 16:50:40,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-05 16:50:40,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:40,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:40,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:40,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289751410] [2025-02-05 16:50:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289751410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:40,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:40,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631762769] [2025-02-05 16:50:40,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:40,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:40,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:40,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:40,417 INFO L87 Difference]: Start difference. First operand 8231 states and 12676 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:40,566 INFO L93 Difference]: Finished difference Result 24250 states and 37272 transitions. [2025-02-05 16:50:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:40,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 325 [2025-02-05 16:50:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:40,595 INFO L225 Difference]: With dead ends: 24250 [2025-02-05 16:50:40,595 INFO L226 Difference]: Without dead ends: 16144 [2025-02-05 16:50:40,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:40,610 INFO L435 NwaCegarLoop]: 3009 mSDtfsCounter, 1402 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:40,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 4486 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:50:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16144 states. [2025-02-05 16:50:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16144 to 15965. [2025-02-05 16:50:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15965 states, 15953 states have (on average 1.5343195637184228) internal successors, (24477), 15964 states have internal predecessors, (24477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15965 states to 15965 states and 24477 transitions. [2025-02-05 16:50:40,944 INFO L78 Accepts]: Start accepts. Automaton has 15965 states and 24477 transitions. Word has length 325 [2025-02-05 16:50:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:40,944 INFO L471 AbstractCegarLoop]: Abstraction has 15965 states and 24477 transitions. [2025-02-05 16:50:40,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 15965 states and 24477 transitions. [2025-02-05 16:50:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-05 16:50:40,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:40,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:40,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:50:40,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:40,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1091086982, now seen corresponding path program 1 times [2025-02-05 16:50:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:40,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297256211] [2025-02-05 16:50:40,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:40,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:41,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-05 16:50:41,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-05 16:50:41,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:41,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:41,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297256211] [2025-02-05 16:50:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297256211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:41,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:41,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035002359] [2025-02-05 16:50:41,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:41,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:41,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:41,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:41,111 INFO L87 Difference]: Start difference. First operand 15965 states and 24477 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:41,381 INFO L93 Difference]: Finished difference Result 47828 states and 73315 transitions. [2025-02-05 16:50:41,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:41,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 325 [2025-02-05 16:50:41,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:41,438 INFO L225 Difference]: With dead ends: 47828 [2025-02-05 16:50:41,439 INFO L226 Difference]: Without dead ends: 31901 [2025-02-05 16:50:41,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:41,456 INFO L435 NwaCegarLoop]: 3068 mSDtfsCounter, 1531 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 4600 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:41,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 4600 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:50:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31901 states. [2025-02-05 16:50:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31901 to 15984. [2025-02-05 16:50:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15984 states, 15972 states have (on average 1.5342474330077636) internal successors, (24505), 15983 states have internal predecessors, (24505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15984 states to 15984 states and 24505 transitions. [2025-02-05 16:50:41,773 INFO L78 Accepts]: Start accepts. Automaton has 15984 states and 24505 transitions. Word has length 325 [2025-02-05 16:50:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:41,773 INFO L471 AbstractCegarLoop]: Abstraction has 15984 states and 24505 transitions. [2025-02-05 16:50:41,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 15984 states and 24505 transitions. [2025-02-05 16:50:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-05 16:50:41,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:41,790 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:41,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:50:41,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:41,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:41,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1011690305, now seen corresponding path program 1 times [2025-02-05 16:50:41,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:41,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563207558] [2025-02-05 16:50:41,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:41,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:41,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-05 16:50:41,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-05 16:50:41,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:41,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:41,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:41,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563207558] [2025-02-05 16:50:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563207558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:41,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:41,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883524078] [2025-02-05 16:50:41,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:41,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:41,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:41,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:41,922 INFO L87 Difference]: Start difference. First operand 15984 states and 24505 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:41,987 INFO L93 Difference]: Finished difference Result 31930 states and 48943 transitions. [2025-02-05 16:50:41,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:41,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 326 [2025-02-05 16:50:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:42,014 INFO L225 Difference]: With dead ends: 31930 [2025-02-05 16:50:42,014 INFO L226 Difference]: Without dead ends: 16002 [2025-02-05 16:50:42,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:42,035 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 5 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3095 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:42,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3095 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:50:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16002 states. [2025-02-05 16:50:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16002 to 16002. [2025-02-05 16:50:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16002 states, 15990 states have (on average 1.533833646028768) internal successors, (24526), 16001 states have internal predecessors, (24526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16002 states to 16002 states and 24526 transitions. [2025-02-05 16:50:42,290 INFO L78 Accepts]: Start accepts. Automaton has 16002 states and 24526 transitions. Word has length 326 [2025-02-05 16:50:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:42,290 INFO L471 AbstractCegarLoop]: Abstraction has 16002 states and 24526 transitions. [2025-02-05 16:50:42,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 16002 states and 24526 transitions. [2025-02-05 16:50:42,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-05 16:50:42,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:42,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:42,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:50:42,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:42,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:42,307 INFO L85 PathProgramCache]: Analyzing trace with hash -726862522, now seen corresponding path program 1 times [2025-02-05 16:50:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:42,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174436112] [2025-02-05 16:50:42,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:42,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-05 16:50:42,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-05 16:50:42,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:42,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:42,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:42,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174436112] [2025-02-05 16:50:42,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174436112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:42,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:42,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:50:42,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560200783] [2025-02-05 16:50:42,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:42,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:50:42,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:42,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:50:42,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:50:42,871 INFO L87 Difference]: Start difference. First operand 16002 states and 24526 transitions. Second operand has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:43,167 INFO L93 Difference]: Finished difference Result 78289 states and 119765 transitions. [2025-02-05 16:50:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:50:43,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 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 327 [2025-02-05 16:50:43,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:43,265 INFO L225 Difference]: With dead ends: 78289 [2025-02-05 16:50:43,265 INFO L226 Difference]: Without dead ends: 62330 [2025-02-05 16:50:43,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:50:43,296 INFO L435 NwaCegarLoop]: 4152 mSDtfsCounter, 4372 mSDsluCounter, 8594 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4372 SdHoareTripleChecker+Valid, 12746 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:43,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4372 Valid, 12746 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:50:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62330 states. [2025-02-05 16:50:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62330 to 31033. [2025-02-05 16:50:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31033 states, 31021 states have (on average 1.523548563876084) internal successors, (47262), 31032 states have internal predecessors, (47262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31033 states to 31033 states and 47262 transitions. [2025-02-05 16:50:43,962 INFO L78 Accepts]: Start accepts. Automaton has 31033 states and 47262 transitions. Word has length 327 [2025-02-05 16:50:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:43,962 INFO L471 AbstractCegarLoop]: Abstraction has 31033 states and 47262 transitions. [2025-02-05 16:50:43,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 31033 states and 47262 transitions. [2025-02-05 16:50:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-05 16:50:44,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:44,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:44,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:50:44,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:44,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1261554072, now seen corresponding path program 1 times [2025-02-05 16:50:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:44,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319890340] [2025-02-05 16:50:44,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:44,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:44,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-05 16:50:44,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-05 16:50:44,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:44,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:44,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:44,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319890340] [2025-02-05 16:50:44,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319890340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:44,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:44,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:50:44,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804942357] [2025-02-05 16:50:44,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:44,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:50:44,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:44,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:50:44,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:50:44,751 INFO L87 Difference]: Start difference. First operand 31033 states and 47262 transitions. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:44,918 INFO L93 Difference]: Finished difference Result 92474 states and 140711 transitions. [2025-02-05 16:50:44,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:50:44,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 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 329 [2025-02-05 16:50:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:45,016 INFO L225 Difference]: With dead ends: 92474 [2025-02-05 16:50:45,016 INFO L226 Difference]: Without dead ends: 61875 [2025-02-05 16:50:45,052 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-02-05 16:50:45,056 INFO L435 NwaCegarLoop]: 3057 mSDtfsCounter, 1488 mSDsluCounter, 4589 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 7646 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:45,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 7646 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:50:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61875 states. [2025-02-05 16:50:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61875 to 31388. [2025-02-05 16:50:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31388 states, 31376 states have (on average 1.5257840387557369) internal successors, (47873), 31387 states have internal predecessors, (47873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31388 states to 31388 states and 47873 transitions. [2025-02-05 16:50:45,504 INFO L78 Accepts]: Start accepts. Automaton has 31388 states and 47873 transitions. Word has length 329 [2025-02-05 16:50:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:45,505 INFO L471 AbstractCegarLoop]: Abstraction has 31388 states and 47873 transitions. [2025-02-05 16:50:45,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 31388 states and 47873 transitions. [2025-02-05 16:50:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-05 16:50:45,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:45,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:45,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:50:45,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:45,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:45,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1880790793, now seen corresponding path program 1 times [2025-02-05 16:50:45,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:45,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561850669] [2025-02-05 16:50:45,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:45,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:45,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-05 16:50:45,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-05 16:50:45,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:45,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:45,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:45,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561850669] [2025-02-05 16:50:45,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561850669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:45,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:45,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234403236] [2025-02-05 16:50:45,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:45,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:45,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:45,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:45,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:45,656 INFO L87 Difference]: Start difference. First operand 31388 states and 47873 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:45,919 INFO L93 Difference]: Finished difference Result 91997 states and 139951 transitions. [2025-02-05 16:50:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:45,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 329 [2025-02-05 16:50:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:46,013 INFO L225 Difference]: With dead ends: 91997 [2025-02-05 16:50:46,013 INFO L226 Difference]: Without dead ends: 61230 [2025-02-05 16:50:46,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:46,038 INFO L435 NwaCegarLoop]: 2994 mSDtfsCounter, 1379 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 4463 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:46,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 4463 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:50:46,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61230 states. [2025-02-05 16:50:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61230 to 61073. [2025-02-05 16:50:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61073 states, 61061 states have (on average 1.515091465911138) internal successors, (92513), 61072 states have internal predecessors, (92513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61073 states to 61073 states and 92513 transitions. [2025-02-05 16:50:46,685 INFO L78 Accepts]: Start accepts. Automaton has 61073 states and 92513 transitions. Word has length 329 [2025-02-05 16:50:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:46,685 INFO L471 AbstractCegarLoop]: Abstraction has 61073 states and 92513 transitions. [2025-02-05 16:50:46,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 61073 states and 92513 transitions. [2025-02-05 16:50:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-02-05 16:50:46,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:46,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:46,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:50:46,725 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:46,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1868618076, now seen corresponding path program 1 times [2025-02-05 16:50:46,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:46,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753013040] [2025-02-05 16:50:46,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:46,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:46,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-05 16:50:46,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-05 16:50:46,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:46,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:47,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:47,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753013040] [2025-02-05 16:50:47,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753013040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:47,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:47,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:47,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152404478] [2025-02-05 16:50:47,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:47,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:47,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:47,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:47,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:47,035 INFO L87 Difference]: Start difference. First operand 61073 states and 92513 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:47,338 INFO L93 Difference]: Finished difference Result 178667 states and 269790 transitions. [2025-02-05 16:50:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:47,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 331 [2025-02-05 16:50:47,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:47,474 INFO L225 Difference]: With dead ends: 178667 [2025-02-05 16:50:47,474 INFO L226 Difference]: Without dead ends: 118784 [2025-02-05 16:50:47,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:47,540 INFO L435 NwaCegarLoop]: 2983 mSDtfsCounter, 1413 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 4452 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:47,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 4452 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:50:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118784 states. [2025-02-05 16:50:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118784 to 118621. [2025-02-05 16:50:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118621 states, 118609 states have (on average 1.5029297945349847) internal successors, (178261), 118620 states have internal predecessors, (178261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118621 states to 118621 states and 178261 transitions. [2025-02-05 16:50:49,547 INFO L78 Accepts]: Start accepts. Automaton has 118621 states and 178261 transitions. Word has length 331 [2025-02-05 16:50:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:49,547 INFO L471 AbstractCegarLoop]: Abstraction has 118621 states and 178261 transitions. [2025-02-05 16:50:49,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 118621 states and 178261 transitions. [2025-02-05 16:50:49,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-02-05 16:50:49,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:49,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:49,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:50:49,946 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:49,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:49,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1185805761, now seen corresponding path program 1 times [2025-02-05 16:50:49,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:49,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969009963] [2025-02-05 16:50:49,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:49,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:50,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-05 16:50:50,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-05 16:50:50,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:50,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:50,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:50,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969009963] [2025-02-05 16:50:50,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969009963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:50,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:50,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:50,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388553595] [2025-02-05 16:50:50,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:50,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:50,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:50,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:50,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:50,093 INFO L87 Difference]: Start difference. First operand 118621 states and 178261 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:51,087 INFO L93 Difference]: Finished difference Result 352699 states and 529341 transitions. [2025-02-05 16:50:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 331 [2025-02-05 16:50:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:51,333 INFO L225 Difference]: With dead ends: 352699 [2025-02-05 16:50:51,333 INFO L226 Difference]: Without dead ends: 235644 [2025-02-05 16:50:51,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:51,384 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 1392 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:51,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 3082 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:50:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235644 states. [2025-02-05 16:50:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235644 to 119013. [2025-02-05 16:50:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119013 states, 119001 states have (on average 1.502315106595743) internal successors, (178777), 119012 states have internal predecessors, (178777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:54,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119013 states to 119013 states and 178777 transitions. [2025-02-05 16:50:54,425 INFO L78 Accepts]: Start accepts. Automaton has 119013 states and 178777 transitions. Word has length 331 [2025-02-05 16:50:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:54,425 INFO L471 AbstractCegarLoop]: Abstraction has 119013 states and 178777 transitions. [2025-02-05 16:50:54,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 119013 states and 178777 transitions. [2025-02-05 16:50:54,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-05 16:50:54,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:54,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:54,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:50:54,498 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:54,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:54,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1573868346, now seen corresponding path program 1 times [2025-02-05 16:50:54,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:54,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112263261] [2025-02-05 16:50:54,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:54,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:54,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-05 16:50:54,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-05 16:50:54,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:54,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:54,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:54,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112263261] [2025-02-05 16:50:54,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112263261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:54,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:54,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:54,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363041395] [2025-02-05 16:50:54,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:54,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:54,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:54,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:54,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:54,657 INFO L87 Difference]: Start difference. First operand 119013 states and 178777 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:55,423 INFO L93 Difference]: Finished difference Result 236648 states and 355236 transitions. [2025-02-05 16:50:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:55,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 332 [2025-02-05 16:50:55,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:55,596 INFO L225 Difference]: With dead ends: 236648 [2025-02-05 16:50:55,597 INFO L226 Difference]: Without dead ends: 119535 [2025-02-05 16:50:55,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:55,660 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 7 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:55,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3094 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:50:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119535 states. [2025-02-05 16:50:57,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119535 to 119535. [2025-02-05 16:50:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119535 states, 119523 states have (on average 1.50102490734001) internal successors, (179407), 119534 states have internal predecessors, (179407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119535 states to 119535 states and 179407 transitions. [2025-02-05 16:50:57,366 INFO L78 Accepts]: Start accepts. Automaton has 119535 states and 179407 transitions. Word has length 332 [2025-02-05 16:50:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:57,367 INFO L471 AbstractCegarLoop]: Abstraction has 119535 states and 179407 transitions. [2025-02-05 16:50:57,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 119535 states and 179407 transitions. [2025-02-05 16:50:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-05 16:50:57,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:57,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:50:57,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:50:57,463 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:50:57,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1082968386, now seen corresponding path program 1 times [2025-02-05 16:50:57,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:57,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552875369] [2025-02-05 16:50:57,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:57,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:57,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-05 16:50:57,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-05 16:50:57,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:57,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:57,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-02-05 16:50:57,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:57,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552875369] [2025-02-05 16:50:57,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552875369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:57,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:57,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:57,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267105784] [2025-02-05 16:50:57,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:57,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:57,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:57,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:57,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:57,616 INFO L87 Difference]: Start difference. First operand 119535 states and 179407 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:50:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:58,716 INFO L93 Difference]: Finished difference Result 305968 states and 463829 transitions. [2025-02-05 16:50:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:58,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 333 [2025-02-05 16:50:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:58,935 INFO L225 Difference]: With dead ends: 305968 [2025-02-05 16:50:58,935 INFO L226 Difference]: Without dead ends: 192881 [2025-02-05 16:50:59,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:59,047 INFO L435 NwaCegarLoop]: 2035 mSDtfsCounter, 696 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 3341 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:59,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 3341 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:50:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192881 states. [2025-02-05 16:51:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192881 to 150895. [2025-02-05 16:51:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150895 states, 150883 states have (on average 1.5288070889364607) internal successors, (230671), 150894 states have internal predecessors, (230671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:51:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150895 states to 150895 states and 230671 transitions. [2025-02-05 16:51:01,651 INFO L78 Accepts]: Start accepts. Automaton has 150895 states and 230671 transitions. Word has length 333 [2025-02-05 16:51:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:01,652 INFO L471 AbstractCegarLoop]: Abstraction has 150895 states and 230671 transitions. [2025-02-05 16:51:01,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:51:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 150895 states and 230671 transitions. [2025-02-05 16:51:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-05 16:51:01,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:01,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:01,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:51:01,741 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:51:01,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:01,741 INFO L85 PathProgramCache]: Analyzing trace with hash -39456639, now seen corresponding path program 1 times [2025-02-05 16:51:01,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:01,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940844855] [2025-02-05 16:51:01,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:01,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:01,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-05 16:51:01,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-05 16:51:01,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:01,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:51:02,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:02,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940844855] [2025-02-05 16:51:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940844855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:02,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:02,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:51:02,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391486176] [2025-02-05 16:51:02,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:02,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:51:02,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:02,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:51:02,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:51:02,606 INFO L87 Difference]: Start difference. First operand 150895 states and 230671 transitions. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:51:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:03,109 INFO L93 Difference]: Finished difference Result 281844 states and 430482 transitions. [2025-02-05 16:51:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:51:03,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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 333 [2025-02-05 16:51:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:03,272 INFO L225 Difference]: With dead ends: 281844 [2025-02-05 16:51:03,272 INFO L226 Difference]: Without dead ends: 133315 [2025-02-05 16:51:03,396 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-02-05 16:51:03,396 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 90 mSDsluCounter, 3203 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 4872 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:03,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 4872 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:51:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133315 states. [2025-02-05 16:51:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133315 to 133175. [2025-02-05 16:51:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133175 states, 133163 states have (on average 1.5265426582459092) internal successors, (203279), 133174 states have internal predecessors, (203279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:51:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133175 states to 133175 states and 203279 transitions. [2025-02-05 16:51:05,225 INFO L78 Accepts]: Start accepts. Automaton has 133175 states and 203279 transitions. Word has length 333 [2025-02-05 16:51:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:05,226 INFO L471 AbstractCegarLoop]: Abstraction has 133175 states and 203279 transitions. [2025-02-05 16:51:05,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:51:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 133175 states and 203279 transitions. [2025-02-05 16:51:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-05 16:51:05,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:05,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:05,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:51:05,294 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:51:05,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:05,295 INFO L85 PathProgramCache]: Analyzing trace with hash -24072117, now seen corresponding path program 1 times [2025-02-05 16:51:05,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:05,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228143490] [2025-02-05 16:51:05,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:05,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:05,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-05 16:51:05,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-05 16:51:05,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:05,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:51:05,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:05,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228143490] [2025-02-05 16:51:05,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228143490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:05,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:05,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:51:05,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903867846] [2025-02-05 16:51:05,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:05,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:51:05,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:05,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:51:05,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:51:05,394 INFO L87 Difference]: Start difference. First operand 133175 states and 203279 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:51:06,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:06,544 INFO L93 Difference]: Finished difference Result 335585 states and 517020 transitions. [2025-02-05 16:51:06,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:51:06,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 335 [2025-02-05 16:51:06,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:06,827 INFO L225 Difference]: With dead ends: 335585 [2025-02-05 16:51:06,827 INFO L226 Difference]: Without dead ends: 209476 [2025-02-05 16:51:06,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:51:06,947 INFO L435 NwaCegarLoop]: 2120 mSDtfsCounter, 806 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 3371 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:06,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 3371 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:51:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209476 states. [2025-02-05 16:51:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209476 to 182199. [2025-02-05 16:51:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182199 states, 182187 states have (on average 1.5511479962895267) internal successors, (282599), 182198 states have internal predecessors, (282599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:51:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182199 states to 182199 states and 282599 transitions. [2025-02-05 16:51:10,045 INFO L78 Accepts]: Start accepts. Automaton has 182199 states and 282599 transitions. Word has length 335 [2025-02-05 16:51:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:10,045 INFO L471 AbstractCegarLoop]: Abstraction has 182199 states and 282599 transitions. [2025-02-05 16:51:10,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:51:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 182199 states and 282599 transitions. [2025-02-05 16:51:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-02-05 16:51:10,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:10,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:10,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:51:10,101 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:51:10,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash -185487071, now seen corresponding path program 1 times [2025-02-05 16:51:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220729548] [2025-02-05 16:51:10,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:10,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 16:51:10,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 16:51:10,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:10,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:51:10,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:10,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220729548] [2025-02-05 16:51:10,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220729548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:10,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:10,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:51:10,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121746669] [2025-02-05 16:51:10,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:10,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:51:10,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:10,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:51:10,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:51:10,281 INFO L87 Difference]: Start difference. First operand 182199 states and 282599 transitions. Second operand has 5 states, 5 states have (on average 67.2) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:51:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:11,664 INFO L93 Difference]: Finished difference Result 358872 states and 557044 transitions. [2025-02-05 16:51:11,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:51:11,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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 336 [2025-02-05 16:51:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:11,886 INFO L225 Difference]: With dead ends: 358872 [2025-02-05 16:51:11,886 INFO L226 Difference]: Without dead ends: 182199 [2025-02-05 16:51:11,972 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-02-05 16:51:11,973 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 3903 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3903 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:11,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3903 Valid, 1767 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:51:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182199 states. [2025-02-05 16:51:14,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182199 to 182199. [2025-02-05 16:51:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182199 states, 182187 states have (on average 1.540642307080088) internal successors, (280685), 182198 states have internal predecessors, (280685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:51:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182199 states to 182199 states and 280685 transitions. [2025-02-05 16:51:14,561 INFO L78 Accepts]: Start accepts. Automaton has 182199 states and 280685 transitions. Word has length 336 [2025-02-05 16:51:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:14,561 INFO L471 AbstractCegarLoop]: Abstraction has 182199 states and 280685 transitions. [2025-02-05 16:51:14,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:51:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 182199 states and 280685 transitions. [2025-02-05 16:51:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-02-05 16:51:14,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:14,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:14,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:51:14,632 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-05 16:51:14,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:14,640 INFO L85 PathProgramCache]: Analyzing trace with hash 102237568, now seen corresponding path program 1 times [2025-02-05 16:51:14,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:14,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987509514] [2025-02-05 16:51:14,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:14,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:14,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 16:51:14,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 16:51:14,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:14,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:51:15,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:15,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987509514] [2025-02-05 16:51:15,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987509514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:15,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:15,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:51:15,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970716633] [2025-02-05 16:51:15,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:15,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:51:15,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:15,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:51:15,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:51:15,459 INFO L87 Difference]: Start difference. First operand 182199 states and 280685 transitions. Second operand has 9 states, 9 states have (on average 37.333333333333336) internal successors, (336), 9 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)