./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1538db88747c173720a51ea136bd420db033fa3c052c219d34d6c24c09240f56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:20:50,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:20:50,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:20:50,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:20:50,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:20:50,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:20:50,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:20:50,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:20:50,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:20:50,300 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:20:50,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:20:50,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:20:50,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:20:50,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:20:50,301 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:20:50,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:20:50,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:20:50,301 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:20:50,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:20:50,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:20:50,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:20:50,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:20:50,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:20:50,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:20:50,301 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:20:50,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:20:50,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:20:50,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:20:50,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:20:50,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:20:50,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:20:50,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:20:50,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:20:50,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:20:50,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:20:50,302 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:20:50,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:20:50,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:20:50,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:20:50,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:20:50,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:20:50,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:20:50,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:20:50,303 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/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 -> 1538db88747c173720a51ea136bd420db033fa3c052c219d34d6c24c09240f56 [2025-03-16 19:20:50,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:20:50,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:20:50,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:20:50,555 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:20:50,555 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:20:50,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-16 19:20:51,789 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df6198c5/40116820306b4c32ac2a2383596ca947/FLAG14e7d3956 [2025-03-16 19:20:52,174 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:20:52,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-16 19:20:52,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df6198c5/40116820306b4c32ac2a2383596ca947/FLAG14e7d3956 [2025-03-16 19:20:52,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df6198c5/40116820306b4c32ac2a2383596ca947 [2025-03-16 19:20:52,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:20:52,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:20:52,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:20:52,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:20:52,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:20:52,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:20:52" (1/1) ... [2025-03-16 19:20:52,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5302a5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:52, skipping insertion in model container [2025-03-16 19:20:52,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:20:52" (1/1) ... [2025-03-16 19:20:52,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:20:52,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[31348,31361] [2025-03-16 19:20:52,692 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[32238,32251] [2025-03-16 19:20:52,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[33897,33910] [2025-03-16 19:20:52,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[34787,34800] [2025-03-16 19:20:52,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[37218,37231] [2025-03-16 19:20:52,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[38111,38124] [2025-03-16 19:20:52,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[39773,39786] [2025-03-16 19:20:52,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[41134,41147] [2025-03-16 19:20:52,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[54998,55011] [2025-03-16 19:20:52,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[55891,55904] [2025-03-16 19:20:52,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[57553,57566] [2025-03-16 19:20:52,887 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[61710,61723] [2025-03-16 19:20:52,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:20:52,968 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:20:53,105 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[31348,31361] [2025-03-16 19:20:53,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[32238,32251] [2025-03-16 19:20:53,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[33897,33910] [2025-03-16 19:20:53,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[34787,34800] [2025-03-16 19:20:53,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[37218,37231] [2025-03-16 19:20:53,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[38111,38124] [2025-03-16 19:20:53,162 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[39773,39786] [2025-03-16 19:20:53,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[41134,41147] [2025-03-16 19:20:53,232 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[54998,55011] [2025-03-16 19:20:53,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[55891,55904] [2025-03-16 19:20:53,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[57553,57566] [2025-03-16 19:20:53,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[61710,61723] [2025-03-16 19:20:53,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:20:53,339 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:20:53,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53 WrapperNode [2025-03-16 19:20:53,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:20:53,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:20:53,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:20:53,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:20:53,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (1/1) ... [2025-03-16 19:20:53,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (1/1) ... [2025-03-16 19:20:53,461 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3921 [2025-03-16 19:20:53,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:20:53,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:20:53,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:20:53,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:20:53,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (1/1) ... [2025-03-16 19:20:53,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (1/1) ... [2025-03-16 19:20:53,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (1/1) ... [2025-03-16 19:20:53,529 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-03-16 19:20:53,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (1/1) ... [2025-03-16 19:20:53,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (1/1) ... [2025-03-16 19:20:53,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (1/1) ... [2025-03-16 19:20:53,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (1/1) ... [2025-03-16 19:20:53,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (1/1) ... [2025-03-16 19:20:53,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (1/1) ... [2025-03-16 19:20:53,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:20:53,587 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:20:53,587 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:20:53,587 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:20:53,588 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (1/1) ... [2025-03-16 19:20:53,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:20:53,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:20:53,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:20:53,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:20:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:20:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:20:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:20:53,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:20:53,760 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:20:53,762 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:20:55,681 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2904: 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-03-16 19:20:55,682 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3967: havoc main_~check__tmp~17#1; [2025-03-16 19:20:55,682 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3043: 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-03-16 19:20:55,682 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4633: havoc main_~check__tmp~21#1; [2025-03-16 19:20:55,682 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-16 19:20:55,682 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3182: 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-03-16 19:20:55,682 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1993: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-16 19:20:55,682 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2259: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1; [2025-03-16 19:20:55,682 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4506: havoc main_~check__tmp~20#1; [2025-03-16 19:20:55,682 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3321: 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-03-16 19:20:55,683 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4257: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~18#1; [2025-03-16 19:20:55,683 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2541: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-16 19:20:55,683 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-03-16 19:20:55,683 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627: havoc main_~main____CPAchecker_TMP_0~4#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_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#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_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~main____CPAchecker_TMP_0~2#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_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#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_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~main____CPAchecker_TMP_0~0#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_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~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_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~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-03-16 19:20:55,683 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2050: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-16 19:20:55,683 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2316: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-03-16 19:20:55,683 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2449: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1; [2025-03-16 19:20:55,683 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2714: havoc main_~check__tmp~13#1; [2025-03-16 19:20:55,683 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4303: havoc main_~check__tmp~19#1; [2025-03-16 19:20:55,684 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1803: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-16 19:20:55,684 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3788: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2025-03-16 19:20:55,684 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3921: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-03-16 19:20:55,873 INFO L? ?]: Removed 245 outVars from TransFormulas that were not future-live. [2025-03-16 19:20:55,873 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:20:55,902 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:20:55,906 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:20:55,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:20:55 BoogieIcfgContainer [2025-03-16 19:20:55,906 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:20:55,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:20:55,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:20:55,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:20:55,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:20:52" (1/3) ... [2025-03-16 19:20:55,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d81f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:20:55, skipping insertion in model container [2025-03-16 19:20:55,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:53" (2/3) ... [2025-03-16 19:20:55,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d81f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:20:55, skipping insertion in model container [2025-03-16 19:20:55,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:20:55" (3/3) ... [2025-03-16 19:20:55,914 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-16 19:20:55,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:20:55,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 892 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-16 19:20:56,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:20:56,016 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;@2584cf55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:20:56,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-16 19:20:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 892 states, 879 states have (on average 1.8293515358361774) internal successors, (1608), 891 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-16 19:20:56,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:56,047 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] [2025-03-16 19:20:56,047 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-03-16 19:20:56,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:56,051 INFO L85 PathProgramCache]: Analyzing trace with hash -744733549, now seen corresponding path program 1 times [2025-03-16 19:20:56,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:56,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325766683] [2025-03-16 19:20:56,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:56,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:56,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-16 19:20:56,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-16 19:20:56,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:56,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:56,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:56,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325766683] [2025-03-16 19:20:56,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325766683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:56,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:56,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:56,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308182474] [2025-03-16 19:20:56,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:56,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:56,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:56,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:56,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:56,829 INFO L87 Difference]: Start difference. First operand has 892 states, 879 states have (on average 1.8293515358361774) internal successors, (1608), 891 states have internal predecessors, (1608), 0 states have call successors, (0), 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 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:57,062 INFO L93 Difference]: Finished difference Result 1546 states and 2767 transitions. [2025-03-16 19:20:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:57,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 285 [2025-03-16 19:20:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:57,081 INFO L225 Difference]: With dead ends: 1546 [2025-03-16 19:20:57,081 INFO L226 Difference]: Without dead ends: 1283 [2025-03-16 19:20:57,087 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-03-16 19:20:57,089 INFO L435 NwaCegarLoop]: 1753 mSDtfsCounter, 850 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:57,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 2917 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:20:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-03-16 19:20:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1281. [2025-03-16 19:20:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1269 states have (on average 1.5516154452324664) internal successors, (1969), 1280 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1969 transitions. [2025-03-16 19:20:57,170 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1969 transitions. Word has length 285 [2025-03-16 19:20:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:57,172 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1969 transitions. [2025-03-16 19:20:57,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:57,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1969 transitions. [2025-03-16 19:20:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-16 19:20:57,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:57,178 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] [2025-03-16 19:20:57,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:20:57,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-16 19:20:57,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash -318318189, now seen corresponding path program 1 times [2025-03-16 19:20:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:57,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526291236] [2025-03-16 19:20:57,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:57,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:57,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-16 19:20:57,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-16 19:20:57,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:57,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:57,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526291236] [2025-03-16 19:20:57,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526291236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:57,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:57,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:57,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224947754] [2025-03-16 19:20:57,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:57,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:57,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:57,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:57,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:57,512 INFO L87 Difference]: Start difference. First operand 1281 states and 1969 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:57,690 INFO L93 Difference]: Finished difference Result 2440 states and 3785 transitions. [2025-03-16 19:20:57,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:57,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 285 [2025-03-16 19:20:57,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:57,699 INFO L225 Difference]: With dead ends: 2440 [2025-03-16 19:20:57,699 INFO L226 Difference]: Without dead ends: 2069 [2025-03-16 19:20:57,700 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-03-16 19:20:57,701 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 693 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 2518 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:57,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 2518 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2025-03-16 19:20:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 2067. [2025-03-16 19:20:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 2055 states have (on average 1.5479318734793188) internal successors, (3181), 2066 states have internal predecessors, (3181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 3181 transitions. [2025-03-16 19:20:57,742 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 3181 transitions. Word has length 285 [2025-03-16 19:20:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:57,743 INFO L471 AbstractCegarLoop]: Abstraction has 2067 states and 3181 transitions. [2025-03-16 19:20:57,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 3181 transitions. [2025-03-16 19:20:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-16 19:20:57,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:57,749 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] [2025-03-16 19:20:57,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:20:57,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-16 19:20:57,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1749879213, now seen corresponding path program 1 times [2025-03-16 19:20:57,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:57,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036996578] [2025-03-16 19:20:57,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:57,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-16 19:20:57,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-16 19:20:57,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:57,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:58,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036996578] [2025-03-16 19:20:58,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036996578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:58,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:58,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:58,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719720592] [2025-03-16 19:20:58,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:58,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:58,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:58,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:58,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:58,054 INFO L87 Difference]: Start difference. First operand 2067 states and 3181 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:58,227 INFO L93 Difference]: Finished difference Result 4250 states and 6614 transitions. [2025-03-16 19:20:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:58,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 285 [2025-03-16 19:20:58,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:58,241 INFO L225 Difference]: With dead ends: 4250 [2025-03-16 19:20:58,242 INFO L226 Difference]: Without dead ends: 3645 [2025-03-16 19:20:58,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:58,247 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 711 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:58,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 2507 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2025-03-16 19:20:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 3643. [2025-03-16 19:20:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3643 states, 3631 states have (on average 1.5447535114293582) internal successors, (5609), 3642 states have internal predecessors, (5609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5609 transitions. [2025-03-16 19:20:58,316 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5609 transitions. Word has length 285 [2025-03-16 19:20:58,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:58,316 INFO L471 AbstractCegarLoop]: Abstraction has 3643 states and 5609 transitions. [2025-03-16 19:20:58,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5609 transitions. [2025-03-16 19:20:58,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-16 19:20:58,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:58,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:20:58,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:20:58,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-16 19:20:58,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:58,322 INFO L85 PathProgramCache]: Analyzing trace with hash -842545549, now seen corresponding path program 1 times [2025-03-16 19:20:58,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:58,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757460119] [2025-03-16 19:20:58,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:58,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:58,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-16 19:20:58,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-16 19:20:58,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:58,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:58,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:58,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757460119] [2025-03-16 19:20:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757460119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:58,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:58,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:58,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756856950] [2025-03-16 19:20:58,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:58,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:58,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:58,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:58,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:58,546 INFO L87 Difference]: Start difference. First operand 3643 states and 5609 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:58,766 INFO L93 Difference]: Finished difference Result 7878 states and 12278 transitions. [2025-03-16 19:20:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:58,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 285 [2025-03-16 19:20:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:58,788 INFO L225 Difference]: With dead ends: 7878 [2025-03-16 19:20:58,789 INFO L226 Difference]: Without dead ends: 6805 [2025-03-16 19:20:58,793 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-03-16 19:20:58,794 INFO L435 NwaCegarLoop]: 1469 mSDtfsCounter, 753 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:58,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 2498 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:20:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2025-03-16 19:20:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 6803. [2025-03-16 19:20:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6803 states, 6791 states have (on average 1.5421881902518038) internal successors, (10473), 6802 states have internal predecessors, (10473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6803 states to 6803 states and 10473 transitions. [2025-03-16 19:20:58,921 INFO L78 Accepts]: Start accepts. Automaton has 6803 states and 10473 transitions. Word has length 285 [2025-03-16 19:20:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:58,921 INFO L471 AbstractCegarLoop]: Abstraction has 6803 states and 10473 transitions. [2025-03-16 19:20:58,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 6803 states and 10473 transitions. [2025-03-16 19:20:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-16 19:20:58,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:58,930 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] [2025-03-16 19:20:58,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:20:58,931 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-03-16 19:20:58,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:58,932 INFO L85 PathProgramCache]: Analyzing trace with hash -842945741, now seen corresponding path program 1 times [2025-03-16 19:20:58,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:58,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094527598] [2025-03-16 19:20:58,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:58,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:58,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-16 19:20:59,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-16 19:20:59,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:59,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:59,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:59,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094527598] [2025-03-16 19:20:59,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094527598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:59,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:59,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654021648] [2025-03-16 19:20:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:59,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:59,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:59,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:59,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:59,784 INFO L87 Difference]: Start difference. First operand 6803 states and 10473 transitions. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:00,057 INFO L93 Difference]: Finished difference Result 33461 states and 51462 transitions. [2025-03-16 19:21:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:21:00,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 285 [2025-03-16 19:21:00,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:00,126 INFO L225 Difference]: With dead ends: 33461 [2025-03-16 19:21:00,126 INFO L226 Difference]: Without dead ends: 26668 [2025-03-16 19:21:00,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:21:00,145 INFO L435 NwaCegarLoop]: 2345 mSDtfsCounter, 4111 mSDsluCounter, 3617 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4111 SdHoareTripleChecker+Valid, 5962 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-03-16 19:21:00,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4111 Valid, 5962 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26668 states. [2025-03-16 19:21:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26668 to 13172. [2025-03-16 19:21:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13172 states, 13160 states have (on average 1.5335866261398177) internal successors, (20182), 13171 states have internal predecessors, (20182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13172 states to 13172 states and 20182 transitions. [2025-03-16 19:21:00,552 INFO L78 Accepts]: Start accepts. Automaton has 13172 states and 20182 transitions. Word has length 285 [2025-03-16 19:21:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:00,552 INFO L471 AbstractCegarLoop]: Abstraction has 13172 states and 20182 transitions. [2025-03-16 19:21:00,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 13172 states and 20182 transitions. [2025-03-16 19:21:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 19:21:00,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:00,566 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] [2025-03-16 19:21:00,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:21:00,566 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-03-16 19:21:00,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:00,567 INFO L85 PathProgramCache]: Analyzing trace with hash -810551889, now seen corresponding path program 1 times [2025-03-16 19:21:00,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:00,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328178769] [2025-03-16 19:21:00,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:00,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:00,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:21:00,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:21:00,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:00,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328178769] [2025-03-16 19:21:00,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328178769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:00,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:00,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:00,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345993294] [2025-03-16 19:21:00,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:00,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:00,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:00,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:00,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:00,714 INFO L87 Difference]: Start difference. First operand 13172 states and 20182 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:00,852 INFO L93 Difference]: Finished difference Result 38885 states and 59508 transitions. [2025-03-16 19:21:00,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:00,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 287 [2025-03-16 19:21:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:00,898 INFO L225 Difference]: With dead ends: 38885 [2025-03-16 19:21:00,898 INFO L226 Difference]: Without dead ends: 25837 [2025-03-16 19:21:00,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:00,922 INFO L435 NwaCegarLoop]: 2597 mSDtfsCounter, 1236 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 3900 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:00,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 3900 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:00,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25837 states. [2025-03-16 19:21:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25837 to 25661. [2025-03-16 19:21:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25661 states, 25649 states have (on average 1.5244648914187688) internal successors, (39101), 25660 states have internal predecessors, (39101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25661 states to 25661 states and 39101 transitions. [2025-03-16 19:21:01,381 INFO L78 Accepts]: Start accepts. Automaton has 25661 states and 39101 transitions. Word has length 287 [2025-03-16 19:21:01,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:01,381 INFO L471 AbstractCegarLoop]: Abstraction has 25661 states and 39101 transitions. [2025-03-16 19:21:01,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 25661 states and 39101 transitions. [2025-03-16 19:21:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 19:21:01,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:01,408 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] [2025-03-16 19:21:01,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:21:01,409 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-03-16 19:21:01,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1881627030, now seen corresponding path program 1 times [2025-03-16 19:21:01,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345910711] [2025-03-16 19:21:01,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:01,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:21:01,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:21:01,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:01,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:01,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345910711] [2025-03-16 19:21:01,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345910711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:01,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:01,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:01,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727949062] [2025-03-16 19:21:01,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:01,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:01,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:01,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:01,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:01,584 INFO L87 Difference]: Start difference. First operand 25661 states and 39101 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:01,774 INFO L93 Difference]: Finished difference Result 76918 states and 117189 transitions. [2025-03-16 19:21:01,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:01,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 287 [2025-03-16 19:21:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:01,869 INFO L225 Difference]: With dead ends: 76918 [2025-03-16 19:21:01,870 INFO L226 Difference]: Without dead ends: 51294 [2025-03-16 19:21:01,914 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-03-16 19:21:01,915 INFO L435 NwaCegarLoop]: 2703 mSDtfsCounter, 1349 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 4052 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-03-16 19:21:01,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 4052 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51294 states. [2025-03-16 19:21:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51294 to 25680. [2025-03-16 19:21:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25680 states, 25668 states have (on average 1.5244273024777935) internal successors, (39129), 25679 states have internal predecessors, (39129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25680 states to 25680 states and 39129 transitions. [2025-03-16 19:21:02,470 INFO L78 Accepts]: Start accepts. Automaton has 25680 states and 39129 transitions. Word has length 287 [2025-03-16 19:21:02,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:02,471 INFO L471 AbstractCegarLoop]: Abstraction has 25680 states and 39129 transitions. [2025-03-16 19:21:02,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 25680 states and 39129 transitions. [2025-03-16 19:21:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-16 19:21:02,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:02,503 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] [2025-03-16 19:21:02,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:21:02,503 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-03-16 19:21:02,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1840000079, now seen corresponding path program 1 times [2025-03-16 19:21:02,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:02,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123888068] [2025-03-16 19:21:02,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:02,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:02,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-16 19:21:02,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-16 19:21:02,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:02,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:02,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:02,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123888068] [2025-03-16 19:21:02,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123888068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:02,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:02,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:02,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372600081] [2025-03-16 19:21:02,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:02,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:02,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:02,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:02,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:02,628 INFO L87 Difference]: Start difference. First operand 25680 states and 39129 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:02,800 INFO L93 Difference]: Finished difference Result 51323 states and 78192 transitions. [2025-03-16 19:21:02,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:02,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 288 [2025-03-16 19:21:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:02,839 INFO L225 Difference]: With dead ends: 51323 [2025-03-16 19:21:02,840 INFO L226 Difference]: Without dead ends: 25698 [2025-03-16 19:21:02,861 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-03-16 19:21:02,862 INFO L435 NwaCegarLoop]: 1372 mSDtfsCounter, 5 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2729 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-03-16 19:21:02,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2729 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25698 states. [2025-03-16 19:21:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25698 to 25698. [2025-03-16 19:21:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25698 states, 25686 states have (on average 1.5241765942536791) internal successors, (39150), 25697 states have internal predecessors, (39150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25698 states to 25698 states and 39150 transitions. [2025-03-16 19:21:03,103 INFO L78 Accepts]: Start accepts. Automaton has 25698 states and 39150 transitions. Word has length 288 [2025-03-16 19:21:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:03,103 INFO L471 AbstractCegarLoop]: Abstraction has 25698 states and 39150 transitions. [2025-03-16 19:21:03,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 25698 states and 39150 transitions. [2025-03-16 19:21:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-16 19:21:03,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:03,124 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] [2025-03-16 19:21:03,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:21:03,125 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-03-16 19:21:03,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:03,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1472717974, now seen corresponding path program 1 times [2025-03-16 19:21:03,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:03,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243060026] [2025-03-16 19:21:03,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:03,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:03,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-16 19:21:03,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-16 19:21:03,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:03,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:03,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:03,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243060026] [2025-03-16 19:21:03,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243060026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:03,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:03,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:21:03,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264116704] [2025-03-16 19:21:03,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:03,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:21:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:03,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:21:03,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:03,770 INFO L87 Difference]: Start difference. First operand 25698 states and 39150 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:03,931 INFO L93 Difference]: Finished difference Result 76605 states and 116599 transitions. [2025-03-16 19:21:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:21:03,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 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 289 [2025-03-16 19:21:03,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:04,015 INFO L225 Difference]: With dead ends: 76605 [2025-03-16 19:21:04,016 INFO L226 Difference]: Without dead ends: 51231 [2025-03-16 19:21:04,043 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-03-16 19:21:04,045 INFO L435 NwaCegarLoop]: 2702 mSDtfsCounter, 1318 mSDsluCounter, 4051 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 6753 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-03-16 19:21:04,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 6753 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51231 states. [2025-03-16 19:21:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51231 to 25905. [2025-03-16 19:21:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25905 states, 25893 states have (on average 1.5256246862086278) internal successors, (39503), 25904 states have internal predecessors, (39503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25905 states to 25905 states and 39503 transitions. [2025-03-16 19:21:04,484 INFO L78 Accepts]: Start accepts. Automaton has 25905 states and 39503 transitions. Word has length 289 [2025-03-16 19:21:04,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:04,484 INFO L471 AbstractCegarLoop]: Abstraction has 25905 states and 39503 transitions. [2025-03-16 19:21:04,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand 25905 states and 39503 transitions. [2025-03-16 19:21:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-16 19:21:04,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:04,505 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] [2025-03-16 19:21:04,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:21:04,505 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-03-16 19:21:04,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1763062612, now seen corresponding path program 1 times [2025-03-16 19:21:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445784657] [2025-03-16 19:21:04,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:04,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-16 19:21:04,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-16 19:21:04,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:04,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:04,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:04,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445784657] [2025-03-16 19:21:04,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445784657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:04,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:04,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:04,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926366866] [2025-03-16 19:21:04,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:04,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:04,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:04,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:04,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:04,636 INFO L87 Difference]: Start difference. First operand 25905 states and 39503 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:04,814 INFO L93 Difference]: Finished difference Result 73157 states and 111305 transitions. [2025-03-16 19:21:04,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:04,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 289 [2025-03-16 19:21:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:04,871 INFO L225 Difference]: With dead ends: 73157 [2025-03-16 19:21:04,872 INFO L226 Difference]: Without dead ends: 47667 [2025-03-16 19:21:04,900 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-03-16 19:21:04,901 INFO L435 NwaCegarLoop]: 2657 mSDtfsCounter, 1230 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 3960 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:04,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 3960 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47667 states. [2025-03-16 19:21:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47667 to 47491. [2025-03-16 19:21:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47491 states, 47479 states have (on average 1.5135533604330336) internal successors, (71862), 47490 states have internal predecessors, (71862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47491 states to 47491 states and 71862 transitions. [2025-03-16 19:21:05,637 INFO L78 Accepts]: Start accepts. Automaton has 47491 states and 71862 transitions. Word has length 289 [2025-03-16 19:21:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:05,637 INFO L471 AbstractCegarLoop]: Abstraction has 47491 states and 71862 transitions. [2025-03-16 19:21:05,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 47491 states and 71862 transitions. [2025-03-16 19:21:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-16 19:21:05,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:05,679 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] [2025-03-16 19:21:05,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:21:05,679 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-03-16 19:21:05,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:05,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1655010529, now seen corresponding path program 1 times [2025-03-16 19:21:05,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:05,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106329944] [2025-03-16 19:21:05,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:05,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:05,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-16 19:21:05,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-16 19:21:05,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:05,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:05,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:05,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106329944] [2025-03-16 19:21:05,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106329944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:05,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:05,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:05,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636481904] [2025-03-16 19:21:05,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:05,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:05,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:05,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:05,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:05,805 INFO L87 Difference]: Start difference. First operand 47491 states and 71862 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:06,101 INFO L93 Difference]: Finished difference Result 140913 states and 212877 transitions. [2025-03-16 19:21:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:06,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 291 [2025-03-16 19:21:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:06,228 INFO L225 Difference]: With dead ends: 140913 [2025-03-16 19:21:06,228 INFO L226 Difference]: Without dead ends: 94220 [2025-03-16 19:21:06,289 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-03-16 19:21:06,290 INFO L435 NwaCegarLoop]: 2571 mSDtfsCounter, 1217 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 3919 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-03-16 19:21:06,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 3919 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94220 states. [2025-03-16 19:21:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94220 to 47595. [2025-03-16 19:21:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47595 states, 47583 states have (on average 1.5132505306517032) internal successors, (72005), 47594 states have internal predecessors, (72005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47595 states to 47595 states and 72005 transitions. [2025-03-16 19:21:07,132 INFO L78 Accepts]: Start accepts. Automaton has 47595 states and 72005 transitions. Word has length 291 [2025-03-16 19:21:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:07,132 INFO L471 AbstractCegarLoop]: Abstraction has 47595 states and 72005 transitions. [2025-03-16 19:21:07,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 47595 states and 72005 transitions. [2025-03-16 19:21:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-16 19:21:07,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:07,270 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] [2025-03-16 19:21:07,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:21:07,270 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-03-16 19:21:07,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:07,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1081255568, now seen corresponding path program 1 times [2025-03-16 19:21:07,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:07,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015310082] [2025-03-16 19:21:07,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:07,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:07,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-16 19:21:07,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-16 19:21:07,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:07,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:07,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:07,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015310082] [2025-03-16 19:21:07,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015310082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:07,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:07,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:07,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39450645] [2025-03-16 19:21:07,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:07,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:07,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:07,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:07,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:07,380 INFO L87 Difference]: Start difference. First operand 47595 states and 72005 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:07,551 INFO L93 Difference]: Finished difference Result 94420 states and 142675 transitions. [2025-03-16 19:21:07,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:07,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 292 [2025-03-16 19:21:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:07,608 INFO L225 Difference]: With dead ends: 94420 [2025-03-16 19:21:07,609 INFO L226 Difference]: Without dead ends: 47720 [2025-03-16 19:21:07,649 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-03-16 19:21:07,651 INFO L435 NwaCegarLoop]: 1372 mSDtfsCounter, 5 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2728 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-03-16 19:21:07,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2728 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47720 states. [2025-03-16 19:21:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47720 to 47720. [2025-03-16 19:21:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47720 states, 47708 states have (on average 1.5123459377882116) internal successors, (72151), 47719 states have internal predecessors, (72151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47720 states to 47720 states and 72151 transitions. [2025-03-16 19:21:08,096 INFO L78 Accepts]: Start accepts. Automaton has 47720 states and 72151 transitions. Word has length 292 [2025-03-16 19:21:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:08,096 INFO L471 AbstractCegarLoop]: Abstraction has 47720 states and 72151 transitions. [2025-03-16 19:21:08,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 47720 states and 72151 transitions. [2025-03-16 19:21:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-16 19:21:08,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:08,130 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] [2025-03-16 19:21:08,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:21:08,130 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-03-16 19:21:08,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash -500858079, now seen corresponding path program 1 times [2025-03-16 19:21:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:08,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112959696] [2025-03-16 19:21:08,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:08,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:08,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-16 19:21:08,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-16 19:21:08,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:08,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:08,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:08,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112959696] [2025-03-16 19:21:08,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112959696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:08,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:08,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:21:08,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369318414] [2025-03-16 19:21:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:08,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:21:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:08,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:21:08,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:21:08,546 INFO L87 Difference]: Start difference. First operand 47720 states and 72151 transitions. Second operand has 5 states, 5 states have (on average 58.6) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:09,214 INFO L93 Difference]: Finished difference Result 234008 states and 353323 transitions. [2025-03-16 19:21:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:21:09,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 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 293 [2025-03-16 19:21:09,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:09,456 INFO L225 Difference]: With dead ends: 234008 [2025-03-16 19:21:09,456 INFO L226 Difference]: Without dead ends: 186355 [2025-03-16 19:21:09,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03-16 19:21:09,537 INFO L435 NwaCegarLoop]: 3711 mSDtfsCounter, 4232 mSDsluCounter, 5571 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4232 SdHoareTripleChecker+Valid, 9282 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:09,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4232 Valid, 9282 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186355 states. [2025-03-16 19:21:10,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186355 to 93076. [2025-03-16 19:21:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93076 states, 93064 states have (on average 1.501482850511476) internal successors, (139734), 93075 states have internal predecessors, (139734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93076 states to 93076 states and 139734 transitions. [2025-03-16 19:21:11,170 INFO L78 Accepts]: Start accepts. Automaton has 93076 states and 139734 transitions. Word has length 293 [2025-03-16 19:21:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:11,170 INFO L471 AbstractCegarLoop]: Abstraction has 93076 states and 139734 transitions. [2025-03-16 19:21:11,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 93076 states and 139734 transitions. [2025-03-16 19:21:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-16 19:21:11,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:11,240 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] [2025-03-16 19:21:11,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:21:11,240 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-03-16 19:21:11,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1007074383, now seen corresponding path program 1 times [2025-03-16 19:21:11,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20077123] [2025-03-16 19:21:11,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:11,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:11,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-16 19:21:11,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-16 19:21:11,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:11,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20077123] [2025-03-16 19:21:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20077123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:12,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:12,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:21:12,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689021824] [2025-03-16 19:21:12,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:12,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:21:12,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:12,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:21:12,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:12,174 INFO L87 Difference]: Start difference. First operand 93076 states and 139734 transitions. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:12,502 INFO L93 Difference]: Finished difference Result 186168 states and 279473 transitions. [2025-03-16 19:21:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:21:12,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 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 295 [2025-03-16 19:21:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:12,619 INFO L225 Difference]: With dead ends: 186168 [2025-03-16 19:21:12,620 INFO L226 Difference]: Without dead ends: 94501 [2025-03-16 19:21:12,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03-16 19:21:12,696 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 94 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 4303 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-03-16 19:21:12,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 4303 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94501 states. [2025-03-16 19:21:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94501 to 94153. [2025-03-16 19:21:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94153 states, 94141 states have (on average 1.5035956703243007) internal successors, (141550), 94152 states have internal predecessors, (141550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94153 states to 94153 states and 141550 transitions. [2025-03-16 19:21:14,495 INFO L78 Accepts]: Start accepts. Automaton has 94153 states and 141550 transitions. Word has length 295 [2025-03-16 19:21:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:14,496 INFO L471 AbstractCegarLoop]: Abstraction has 94153 states and 141550 transitions. [2025-03-16 19:21:14,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 94153 states and 141550 transitions. [2025-03-16 19:21:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-16 19:21:14,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:14,553 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] [2025-03-16 19:21:14,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:21:14,553 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-03-16 19:21:14,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:14,554 INFO L85 PathProgramCache]: Analyzing trace with hash -10416132, now seen corresponding path program 1 times [2025-03-16 19:21:14,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:14,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003908523] [2025-03-16 19:21:14,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:14,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:14,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-16 19:21:14,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-16 19:21:14,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:14,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:15,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:15,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003908523] [2025-03-16 19:21:15,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003908523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:15,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:15,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:21:15,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685445062] [2025-03-16 19:21:15,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:15,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:21:15,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:15,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:21:15,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:15,189 INFO L87 Difference]: Start difference. First operand 94153 states and 141550 transitions. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:15,733 INFO L93 Difference]: Finished difference Result 279368 states and 419503 transitions. [2025-03-16 19:21:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:21:15,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 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 295 [2025-03-16 19:21:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:15,951 INFO L225 Difference]: With dead ends: 279368 [2025-03-16 19:21:15,952 INFO L226 Difference]: Without dead ends: 187442 [2025-03-16 19:21:16,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03-16 19:21:16,050 INFO L435 NwaCegarLoop]: 2692 mSDtfsCounter, 1309 mSDsluCounter, 4041 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 6733 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:16,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 6733 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:16,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187442 states. [2025-03-16 19:21:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187442 to 95666. [2025-03-16 19:21:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95666 states, 95654 states have (on average 1.5068162335082693) internal successors, (144133), 95665 states have internal predecessors, (144133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95666 states to 95666 states and 144133 transitions. [2025-03-16 19:21:17,860 INFO L78 Accepts]: Start accepts. Automaton has 95666 states and 144133 transitions. Word has length 295 [2025-03-16 19:21:17,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:17,860 INFO L471 AbstractCegarLoop]: Abstraction has 95666 states and 144133 transitions. [2025-03-16 19:21:17,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 95666 states and 144133 transitions. [2025-03-16 19:21:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-16 19:21:17,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:17,933 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] [2025-03-16 19:21:17,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:21:17,934 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-03-16 19:21:17,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:17,934 INFO L85 PathProgramCache]: Analyzing trace with hash 141260990, now seen corresponding path program 1 times [2025-03-16 19:21:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:17,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426480863] [2025-03-16 19:21:17,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:17,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:17,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-16 19:21:17,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-16 19:21:17,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:17,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426480863] [2025-03-16 19:21:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426480863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:18,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:18,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90151253] [2025-03-16 19:21:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:18,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:18,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:18,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:18,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:18,067 INFO L87 Difference]: Start difference. First operand 95666 states and 144133 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:18,948 INFO L93 Difference]: Finished difference Result 279074 states and 419188 transitions. [2025-03-16 19:21:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:18,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 295 [2025-03-16 19:21:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:19,165 INFO L225 Difference]: With dead ends: 279074 [2025-03-16 19:21:19,165 INFO L226 Difference]: Without dead ends: 186180 [2025-03-16 19:21:19,222 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-03-16 19:21:19,223 INFO L435 NwaCegarLoop]: 2637 mSDtfsCounter, 1208 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 3932 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:19,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 3932 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186180 states. [2025-03-16 19:21:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186180 to 186040. [2025-03-16 19:21:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186040 states, 186028 states have (on average 1.4947642290407896) internal successors, (278068), 186039 states have internal predecessors, (278068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186040 states to 186040 states and 278068 transitions. [2025-03-16 19:21:21,618 INFO L78 Accepts]: Start accepts. Automaton has 186040 states and 278068 transitions. Word has length 295 [2025-03-16 19:21:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:21,618 INFO L471 AbstractCegarLoop]: Abstraction has 186040 states and 278068 transitions. [2025-03-16 19:21:21,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 186040 states and 278068 transitions. [2025-03-16 19:21:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-16 19:21:21,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:21,777 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] [2025-03-16 19:21:21,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:21:21,777 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-03-16 19:21:21,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:21,777 INFO L85 PathProgramCache]: Analyzing trace with hash -730424259, now seen corresponding path program 1 times [2025-03-16 19:21:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:21,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964368806] [2025-03-16 19:21:21,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:21,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:21,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-16 19:21:21,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-16 19:21:21,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:21,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:22,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:22,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964368806] [2025-03-16 19:21:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964368806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:22,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427091246] [2025-03-16 19:21:22,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:22,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:21:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:22,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:21:22,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:22,474 INFO L87 Difference]: Start difference. First operand 186040 states and 278068 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:24,320 INFO L93 Difference]: Finished difference Result 725237 states and 1081320 transitions. [2025-03-16 19:21:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:21:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 297 [2025-03-16 19:21:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:24,921 INFO L225 Difference]: With dead ends: 725237 [2025-03-16 19:21:24,921 INFO L226 Difference]: Without dead ends: 540566 [2025-03-16 19:21:24,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:21:24,987 INFO L435 NwaCegarLoop]: 2328 mSDtfsCounter, 2509 mSDsluCounter, 2543 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2509 SdHoareTripleChecker+Valid, 4871 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:24,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2509 Valid, 4871 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540566 states. [2025-03-16 19:21:30,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540566 to 363323. [2025-03-16 19:21:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363323 states, 363311 states have (on average 1.4830654728318162) internal successors, (538814), 363322 states have internal predecessors, (538814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363323 states to 363323 states and 538814 transitions. [2025-03-16 19:21:31,729 INFO L78 Accepts]: Start accepts. Automaton has 363323 states and 538814 transitions. Word has length 297 [2025-03-16 19:21:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:31,729 INFO L471 AbstractCegarLoop]: Abstraction has 363323 states and 538814 transitions. [2025-03-16 19:21:31,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 363323 states and 538814 transitions. [2025-03-16 19:21:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-16 19:21:31,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:31,957 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] [2025-03-16 19:21:31,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:21:31,957 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-03-16 19:21:31,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:31,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1086672839, now seen corresponding path program 1 times [2025-03-16 19:21:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:31,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536210269] [2025-03-16 19:21:31,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:31,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:31,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-16 19:21:31,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-16 19:21:31,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:31,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:32,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:32,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536210269] [2025-03-16 19:21:32,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536210269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:32,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:32,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:21:32,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062801967] [2025-03-16 19:21:32,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:32,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:21:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:32,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:21:32,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:21:32,124 INFO L87 Difference]: Start difference. First operand 363323 states and 538814 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:34,789 INFO L93 Difference]: Finished difference Result 1068931 states and 1581786 transitions. [2025-03-16 19:21:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:21:34,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 299 [2025-03-16 19:21:34,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:36,219 INFO L225 Difference]: With dead ends: 1068931 [2025-03-16 19:21:36,219 INFO L226 Difference]: Without dead ends: 711281 [2025-03-16 19:21:36,367 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-03-16 19:21:36,367 INFO L435 NwaCegarLoop]: 2605 mSDtfsCounter, 1206 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 3912 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:36,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 3912 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:21:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711281 states.