./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_lcr.4.ufo.UNBOUNDED.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 6fcbb6774587cda7a5d573623a9a47b3e351563c8bea7eebdf86bc25d20b8061 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:59:37,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:59:37,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:59:37,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:59:37,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:59:37,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:59:37,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:59:37,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:59:37,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:59:37,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:59:37,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:59:37,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:59:37,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:59:37,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:59:37,486 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:59:37,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:59:37,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:59:37,487 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:59:37,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:59:37,487 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:59:37,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:59:37,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:59:37,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:59:37,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:59:37,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:59:37,492 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:59:37,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:59:37,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:59:37,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:59:37,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:59:37,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:59:37,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:59:37,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:59:37,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:59:37,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:59:37,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:59:37,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:59:37,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:59:37,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:59:37,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:59:37,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:59:37,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:59:37,499 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 6fcbb6774587cda7a5d573623a9a47b3e351563c8bea7eebdf86bc25d20b8061 [2024-11-09 23:59:37,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:59:37,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:59:37,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:59:37,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:59:37,788 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:59:37,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-09 23:59:39,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:59:39,547 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:59:39,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-09 23:59:39,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6f02c10/d416c12461b045f28d66b0716918e703/FLAG2ec2988d4 [2024-11-09 23:59:39,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6f02c10/d416c12461b045f28d66b0716918e703 [2024-11-09 23:59:39,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:59:39,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:59:39,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:59:39,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:59:39,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:59:39,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:59:39" (1/1) ... [2024-11-09 23:59:39,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f743a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:39, skipping insertion in model container [2024-11-09 23:59:39,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:59:39" (1/1) ... [2024-11-09 23:59:39,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:59:39,983 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8891,8904] [2024-11-09 23:59:40,013 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12143,12156] [2024-11-09 23:59:40,020 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13299,13312] [2024-11-09 23:59:40,024 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13955,13968] [2024-11-09 23:59:40,036 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15434,15447] [2024-11-09 23:59:40,043 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16090,16103] [2024-11-09 23:59:40,052 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17074,17087] [2024-11-09 23:59:40,065 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19370,19383] [2024-11-09 23:59:40,069 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20029,20042] [2024-11-09 23:59:40,074 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21011,21024] [2024-11-09 23:59:40,090 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22802,22815] [2024-11-09 23:59:40,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:59:40,199 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:59:40,252 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8891,8904] [2024-11-09 23:59:40,265 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12143,12156] [2024-11-09 23:59:40,272 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13299,13312] [2024-11-09 23:59:40,278 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13955,13968] [2024-11-09 23:59:40,285 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15434,15447] [2024-11-09 23:59:40,292 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16090,16103] [2024-11-09 23:59:40,296 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17074,17087] [2024-11-09 23:59:40,306 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19370,19383] [2024-11-09 23:59:40,309 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20029,20042] [2024-11-09 23:59:40,314 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21011,21024] [2024-11-09 23:59:40,321 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_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22802,22815] [2024-11-09 23:59:40,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:59:40,405 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:59:40,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40 WrapperNode [2024-11-09 23:59:40,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:59:40,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:59:40,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:59:40,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:59:40,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (1/1) ... [2024-11-09 23:59:40,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (1/1) ... [2024-11-09 23:59:40,508 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1922 [2024-11-09 23:59:40,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:59:40,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:59:40,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:59:40,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:59:40,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (1/1) ... [2024-11-09 23:59:40,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (1/1) ... [2024-11-09 23:59:40,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (1/1) ... [2024-11-09 23:59:40,576 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]. [2024-11-09 23:59:40,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (1/1) ... [2024-11-09 23:59:40,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (1/1) ... [2024-11-09 23:59:40,612 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (1/1) ... [2024-11-09 23:59:40,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (1/1) ... [2024-11-09 23:59:40,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (1/1) ... [2024-11-09 23:59:40,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (1/1) ... [2024-11-09 23:59:40,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:59:40,645 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:59:40,645 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:59:40,645 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:59:40,646 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (1/1) ... [2024-11-09 23:59:40,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:59:40,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:59:40,681 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) [2024-11-09 23:59:40,684 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 [2024-11-09 23:59:40,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:59:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:59:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:59:40,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:59:40,884 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:59:40,886 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:59:42,156 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1;havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2024-11-09 23:59:42,157 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1623: havoc main_~check__tmp~15#1; [2024-11-09 23:59:42,157 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1557: havoc main_~node4__m4~8#1; [2024-11-09 23:59:42,157 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2024-11-09 23:59:42,157 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2024-11-09 23:59:42,157 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2024-11-09 23:59:42,157 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2024-11-09 23:59:42,158 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1591: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2024-11-09 23:59:42,158 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2024-11-09 23:59:42,158 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2024-11-09 23:59:42,158 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2024-11-09 23:59:42,158 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2024-11-09 23:59:42,158 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2418: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1;havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2024-11-09 23:59:42,159 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1328: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2024-11-09 23:59:42,159 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1328: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2024-11-09 23:59:42,159 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1328: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2024-11-09 23:59:42,159 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2452: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2024-11-09 23:59:42,159 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2452: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2024-11-09 23:59:42,159 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2452: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2024-11-09 23:59:42,159 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2452: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2024-11-09 23:59:42,160 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L338: havoc main_~node4__m4~1#1; [2024-11-09 23:59:42,160 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L768: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-09 23:59:42,160 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L768: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-09 23:59:42,160 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L768: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-09 23:59:42,160 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2519: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2024-11-09 23:59:42,160 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2519: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2024-11-09 23:59:42,160 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2519: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2024-11-09 23:59:42,161 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2519: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2024-11-09 23:59:42,161 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,161 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,161 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,161 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,161 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,162 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,162 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,162 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,162 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,162 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,162 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,163 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,163 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,163 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,163 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,163 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,163 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,163 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,164 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,164 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,164 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,164 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,164 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,165 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:59:42,165 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L967: havoc main_~node3__m3~3#1; [2024-11-09 23:59:42,165 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2024-11-09 23:59:42,165 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2024-11-09 23:59:42,165 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2024-11-09 23:59:42,165 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2__m2~1#1; [2024-11-09 23:59:42,165 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2224: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2024-11-09 23:59:42,165 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2258: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2024-11-09 23:59:42,165 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2258: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2024-11-09 23:59:42,166 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2258: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2024-11-09 23:59:42,166 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2258: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2024-11-09 23:59:42,166 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: havoc main_~node2____CPAchecker_TMP_0~1#1; [2024-11-09 23:59:42,166 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2325: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2024-11-09 23:59:42,166 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2325: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2024-11-09 23:59:42,166 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2325: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2024-11-09 23:59:42,166 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2325: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2024-11-09 23:59:42,166 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2024-11-09 23:59:42,166 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-09 23:59:42,166 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-09 23:59:42,167 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-09 23:59:42,167 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-09 23:59:42,167 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2024-11-09 23:59:42,167 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2024-11-09 23:59:42,167 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2024-11-09 23:59:42,167 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2024-11-09 23:59:42,167 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:59:42,167 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:59:42,167 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:59:42,167 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:59:42,168 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1997: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2024-11-09 23:59:42,168 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1997: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2024-11-09 23:59:42,168 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1997: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2024-11-09 23:59:42,168 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1997: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2024-11-09 23:59:42,168 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L907: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2024-11-09 23:59:42,169 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1271: havoc main_~node3__m3~4#1; [2024-11-09 23:59:42,169 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1073: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2024-11-09 23:59:42,169 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:59:42,169 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:59:42,169 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:59:42,169 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:59:42,170 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:59:42,170 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L550: havoc main_~node4____CPAchecker_TMP_0~1#1; [2024-11-09 23:59:42,170 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:59:42,170 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:59:42,170 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:59:42,170 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:59:42,171 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2070: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2024-11-09 23:59:42,171 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1542: havoc main_~node3__m3~5#1; [2024-11-09 23:59:42,171 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1377: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2024-11-09 23:59:42,171 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2104: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2024-11-09 23:59:42,171 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2104: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2024-11-09 23:59:42,171 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2104: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2024-11-09 23:59:42,171 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2104: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2024-11-09 23:59:42,172 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L816: havoc main_~node4__m4~3#1; [2024-11-09 23:59:42,172 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2171: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2024-11-09 23:59:42,172 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2171: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2024-11-09 23:59:42,172 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2171: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2024-11-09 23:59:42,172 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2171: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2024-11-09 23:59:42,172 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc main_~node4__m4~4#1; [2024-11-09 23:59:42,172 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1181: havoc main_~check__tmp~9#1; [2024-11-09 23:59:42,173 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1115: havoc main_~node4__m4~5#1; [2024-11-09 23:59:42,173 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: havoc main_~node3__m3~1#1; [2024-11-09 23:59:42,173 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1149: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2024-11-09 23:59:42,173 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2900: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2024-11-09 23:59:42,173 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1843: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2024-11-09 23:59:42,173 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1843: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2024-11-09 23:59:42,174 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1843: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2024-11-09 23:59:42,174 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1843: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2024-11-09 23:59:42,201 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2024-11-09 23:59:42,201 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2024-11-09 23:59:42,201 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2024-11-09 23:59:42,201 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2024-11-09 23:59:42,201 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3001: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2024-11-09 23:59:42,201 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3001: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2024-11-09 23:59:42,202 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3001: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2024-11-09 23:59:42,202 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3001: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2024-11-09 23:59:42,202 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2572: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2024-11-09 23:59:42,202 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: havoc main_~node1____CPAchecker_TMP_0~1#1; [2024-11-09 23:59:42,202 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2024-11-09 23:59:42,202 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2024-11-09 23:59:42,202 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2024-11-09 23:59:42,203 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2024-11-09 23:59:42,203 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2673: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2024-11-09 23:59:42,203 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2673: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2024-11-09 23:59:42,203 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2673: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2024-11-09 23:59:42,203 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2673: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2024-11-09 23:59:42,203 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1286: havoc main_~node4__m4~6#1; [2024-11-09 23:59:42,203 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1485: havoc main_~check__tmp~13#1; [2024-11-09 23:59:42,203 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1419: havoc main_~node4__m4~7#1; [2024-11-09 23:59:42,204 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L858: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-09 23:59:42,204 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L858: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-09 23:59:42,204 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L858: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-09 23:59:42,204 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1453: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2024-11-09 23:59:42,204 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2024-11-09 23:59:42,204 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2024-11-09 23:59:42,204 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2024-11-09 23:59:42,205 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1685: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2024-11-09 23:59:42,205 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1685: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2024-11-09 23:59:42,205 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1685: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2024-11-09 23:59:42,205 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1685: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2024-11-09 23:59:42,205 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L595: havoc main_~node3____CPAchecker_TMP_0~1#1; [2024-11-09 23:59:42,205 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256: havoc main_~node2__m2~3#1; [2024-11-09 23:59:42,283 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2024-11-09 23:59:42,283 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:59:42,313 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:59:42,314 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:59:42,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:59:42 BoogieIcfgContainer [2024-11-09 23:59:42,314 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:59:42,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:59:42,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:59:42,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:59:42,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:59:39" (1/3) ... [2024-11-09 23:59:42,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac68249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:59:42, skipping insertion in model container [2024-11-09 23:59:42,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:40" (2/3) ... [2024-11-09 23:59:42,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac68249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:59:42, skipping insertion in model container [2024-11-09 23:59:42,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:59:42" (3/3) ... [2024-11-09 23:59:42,323 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-09 23:59:42,336 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:59:42,336 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-09 23:59:42,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:59:42,412 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;@797a8e29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:59:42,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-09 23:59:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 372 states, 360 states have (on average 1.8027777777777778) internal successors, (649), 371 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 23:59:42,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:42,434 INFO L215 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] [2024-11-09 23:59:42,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:42,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:42,440 INFO L85 PathProgramCache]: Analyzing trace with hash 71653175, now seen corresponding path program 1 times [2024-11-09 23:59:42,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:42,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517074379] [2024-11-09 23:59:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:42,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:42,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:42,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517074379] [2024-11-09 23:59:42,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517074379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:42,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:42,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:59:42,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642701963] [2024-11-09 23:59:42,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:42,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:59:42,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:43,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:59:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:59:43,023 INFO L87 Difference]: Start difference. First operand has 372 states, 360 states have (on average 1.8027777777777778) internal successors, (649), 371 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:43,357 INFO L93 Difference]: Finished difference Result 588 states and 991 transitions. [2024-11-09 23:59:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:59:43,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-09 23:59:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:43,372 INFO L225 Difference]: With dead ends: 588 [2024-11-09 23:59:43,372 INFO L226 Difference]: Without dead ends: 297 [2024-11-09 23:59:43,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:43,381 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1466 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:43,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 366 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:43,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-09 23:59:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-11-09 23:59:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 286 states have (on average 1.2972027972027973) internal successors, (371), 296 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 371 transitions. [2024-11-09 23:59:43,440 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 371 transitions. Word has length 58 [2024-11-09 23:59:43,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:43,441 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 371 transitions. [2024-11-09 23:59:43,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 371 transitions. [2024-11-09 23:59:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 23:59:43,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:43,446 INFO L215 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] [2024-11-09 23:59:43,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:59:43,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:43,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:43,447 INFO L85 PathProgramCache]: Analyzing trace with hash 571858618, now seen corresponding path program 1 times [2024-11-09 23:59:43,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:43,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767362674] [2024-11-09 23:59:43,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:43,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:43,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767362674] [2024-11-09 23:59:43,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767362674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:43,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:43,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:59:43,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398064997] [2024-11-09 23:59:43,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:43,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:59:43,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:43,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:59:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:59:43,677 INFO L87 Difference]: Start difference. First operand 297 states and 371 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:43,914 INFO L93 Difference]: Finished difference Result 504 states and 645 transitions. [2024-11-09 23:59:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:59:43,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-09 23:59:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:43,917 INFO L225 Difference]: With dead ends: 504 [2024-11-09 23:59:43,917 INFO L226 Difference]: Without dead ends: 277 [2024-11-09 23:59:43,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:43,920 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 963 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:43,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 215 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-09 23:59:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-11-09 23:59:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 266 states have (on average 1.300751879699248) internal successors, (346), 276 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 346 transitions. [2024-11-09 23:59:43,933 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 346 transitions. Word has length 59 [2024-11-09 23:59:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:43,933 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 346 transitions. [2024-11-09 23:59:43,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 346 transitions. [2024-11-09 23:59:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 23:59:43,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:43,935 INFO L215 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] [2024-11-09 23:59:43,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:59:43,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:43,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:43,937 INFO L85 PathProgramCache]: Analyzing trace with hash 640599419, now seen corresponding path program 1 times [2024-11-09 23:59:43,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:43,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562494940] [2024-11-09 23:59:43,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:43,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:44,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:44,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562494940] [2024-11-09 23:59:44,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562494940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:44,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:44,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:59:44,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773506940] [2024-11-09 23:59:44,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:44,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:59:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:44,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:59:44,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:59:44,059 INFO L87 Difference]: Start difference. First operand 277 states and 346 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:44,232 INFO L93 Difference]: Finished difference Result 484 states and 619 transitions. [2024-11-09 23:59:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:59:44,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-09 23:59:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:44,234 INFO L225 Difference]: With dead ends: 484 [2024-11-09 23:59:44,235 INFO L226 Difference]: Without dead ends: 258 [2024-11-09 23:59:44,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:44,239 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 923 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:44,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 204 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-09 23:59:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-09 23:59:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 247 states have (on average 1.311740890688259) internal successors, (324), 257 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 324 transitions. [2024-11-09 23:59:44,260 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 324 transitions. Word has length 60 [2024-11-09 23:59:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:44,261 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 324 transitions. [2024-11-09 23:59:44,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 324 transitions. [2024-11-09 23:59:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 23:59:44,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:44,265 INFO L215 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] [2024-11-09 23:59:44,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:59:44,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:44,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:44,266 INFO L85 PathProgramCache]: Analyzing trace with hash 556986040, now seen corresponding path program 1 times [2024-11-09 23:59:44,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:44,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471287022] [2024-11-09 23:59:44,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:44,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:44,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:44,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471287022] [2024-11-09 23:59:44,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471287022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:44,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:44,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:59:44,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065189679] [2024-11-09 23:59:44,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:44,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:59:44,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:44,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:59:44,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:59:44,465 INFO L87 Difference]: Start difference. First operand 258 states and 324 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:44,636 INFO L93 Difference]: Finished difference Result 465 states and 596 transitions. [2024-11-09 23:59:44,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:59:44,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-09 23:59:44,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:44,638 INFO L225 Difference]: With dead ends: 465 [2024-11-09 23:59:44,638 INFO L226 Difference]: Without dead ends: 250 [2024-11-09 23:59:44,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:44,640 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 880 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:44,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 200 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:44,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-09 23:59:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-11-09 23:59:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.3138075313807531) internal successors, (314), 249 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 314 transitions. [2024-11-09 23:59:44,650 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 314 transitions. Word has length 61 [2024-11-09 23:59:44,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:44,653 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 314 transitions. [2024-11-09 23:59:44,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 314 transitions. [2024-11-09 23:59:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 23:59:44,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:44,654 INFO L215 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] [2024-11-09 23:59:44,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:59:44,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:44,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:44,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1554027497, now seen corresponding path program 1 times [2024-11-09 23:59:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:44,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580602194] [2024-11-09 23:59:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:44,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:45,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:45,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580602194] [2024-11-09 23:59:45,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580602194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:45,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:45,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:59:45,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927456460] [2024-11-09 23:59:45,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:45,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:59:45,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:45,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:59:45,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:59:45,028 INFO L87 Difference]: Start difference. First operand 250 states and 314 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:45,504 INFO L93 Difference]: Finished difference Result 497 states and 624 transitions. [2024-11-09 23:59:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:59:45,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-09 23:59:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:45,506 INFO L225 Difference]: With dead ends: 497 [2024-11-09 23:59:45,506 INFO L226 Difference]: Without dead ends: 360 [2024-11-09 23:59:45,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:45,507 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 1304 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:45,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 788 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:45,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-09 23:59:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 250. [2024-11-09 23:59:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 249 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 313 transitions. [2024-11-09 23:59:45,514 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 313 transitions. Word has length 62 [2024-11-09 23:59:45,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:45,515 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 313 transitions. [2024-11-09 23:59:45,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 313 transitions. [2024-11-09 23:59:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 23:59:45,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:45,516 INFO L215 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] [2024-11-09 23:59:45,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:59:45,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:45,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash 730366915, now seen corresponding path program 1 times [2024-11-09 23:59:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:45,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453654046] [2024-11-09 23:59:45,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:45,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453654046] [2024-11-09 23:59:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453654046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:45,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:45,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:45,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274717419] [2024-11-09 23:59:45,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:45,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:45,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:45,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:45,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:45,807 INFO L87 Difference]: Start difference. First operand 250 states and 313 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:46,417 INFO L93 Difference]: Finished difference Result 482 states and 621 transitions. [2024-11-09 23:59:46,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:46,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-09 23:59:46,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:46,419 INFO L225 Difference]: With dead ends: 482 [2024-11-09 23:59:46,419 INFO L226 Difference]: Without dead ends: 390 [2024-11-09 23:59:46,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:59:46,420 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 1038 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:46,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1270 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:59:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-09 23:59:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 250. [2024-11-09 23:59:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.3054393305439331) internal successors, (312), 249 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 312 transitions. [2024-11-09 23:59:46,426 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 312 transitions. Word has length 62 [2024-11-09 23:59:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:46,427 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 312 transitions. [2024-11-09 23:59:46,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 312 transitions. [2024-11-09 23:59:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 23:59:46,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:46,428 INFO L215 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] [2024-11-09 23:59:46,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:59:46,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:46,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash 596304080, now seen corresponding path program 1 times [2024-11-09 23:59:46,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:46,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051552522] [2024-11-09 23:59:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:46,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:46,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:46,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051552522] [2024-11-09 23:59:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051552522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:46,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:46,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:46,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859381438] [2024-11-09 23:59:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:46,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:46,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:46,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:46,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:46,719 INFO L87 Difference]: Start difference. First operand 250 states and 312 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:47,343 INFO L93 Difference]: Finished difference Result 456 states and 587 transitions. [2024-11-09 23:59:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:47,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-09 23:59:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:47,346 INFO L225 Difference]: With dead ends: 456 [2024-11-09 23:59:47,346 INFO L226 Difference]: Without dead ends: 386 [2024-11-09 23:59:47,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:59:47,347 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 1021 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:47,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 1272 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:59:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-09 23:59:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 250. [2024-11-09 23:59:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.301255230125523) internal successors, (311), 249 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 311 transitions. [2024-11-09 23:59:47,355 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 311 transitions. Word has length 62 [2024-11-09 23:59:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:47,356 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 311 transitions. [2024-11-09 23:59:47,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 311 transitions. [2024-11-09 23:59:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 23:59:47,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:47,357 INFO L215 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] [2024-11-09 23:59:47,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:59:47,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:47,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:47,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1429799453, now seen corresponding path program 1 times [2024-11-09 23:59:47,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417012028] [2024-11-09 23:59:47,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:47,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:47,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:47,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417012028] [2024-11-09 23:59:47,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417012028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:47,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:47,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:47,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232399008] [2024-11-09 23:59:47,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:47,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:47,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:47,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:47,615 INFO L87 Difference]: Start difference. First operand 250 states and 311 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:48,160 INFO L93 Difference]: Finished difference Result 461 states and 591 transitions. [2024-11-09 23:59:48,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:59:48,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 23:59:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:48,162 INFO L225 Difference]: With dead ends: 461 [2024-11-09 23:59:48,163 INFO L226 Difference]: Without dead ends: 386 [2024-11-09 23:59:48,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:59:48,163 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 1293 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:48,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 1034 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-09 23:59:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 250. [2024-11-09 23:59:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.297071129707113) internal successors, (310), 249 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 310 transitions. [2024-11-09 23:59:48,173 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 310 transitions. Word has length 64 [2024-11-09 23:59:48,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:48,174 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 310 transitions. [2024-11-09 23:59:48,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 310 transitions. [2024-11-09 23:59:48,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 23:59:48,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:48,175 INFO L215 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] [2024-11-09 23:59:48,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:59:48,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:48,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1003918235, now seen corresponding path program 1 times [2024-11-09 23:59:48,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:48,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519035501] [2024-11-09 23:59:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:48,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:48,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:48,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519035501] [2024-11-09 23:59:48,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519035501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:48,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:48,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392954637] [2024-11-09 23:59:48,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:48,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:48,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:48,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:48,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:48,416 INFO L87 Difference]: Start difference. First operand 250 states and 310 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:48,930 INFO L93 Difference]: Finished difference Result 441 states and 560 transitions. [2024-11-09 23:59:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:48,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 23:59:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:48,932 INFO L225 Difference]: With dead ends: 441 [2024-11-09 23:59:48,933 INFO L226 Difference]: Without dead ends: 378 [2024-11-09 23:59:48,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:59:48,933 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1638 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:48,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 854 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-09 23:59:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 250. [2024-11-09 23:59:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.292887029288703) internal successors, (309), 249 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 309 transitions. [2024-11-09 23:59:48,939 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 309 transitions. Word has length 64 [2024-11-09 23:59:48,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:48,939 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 309 transitions. [2024-11-09 23:59:48,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 309 transitions. [2024-11-09 23:59:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 23:59:48,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:48,941 INFO L215 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] [2024-11-09 23:59:48,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:59:48,941 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:48,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash -122851399, now seen corresponding path program 1 times [2024-11-09 23:59:48,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:48,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245487835] [2024-11-09 23:59:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:49,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245487835] [2024-11-09 23:59:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245487835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:49,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:49,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:49,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891340398] [2024-11-09 23:59:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:49,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:49,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:49,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:49,252 INFO L87 Difference]: Start difference. First operand 250 states and 309 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:49,744 INFO L93 Difference]: Finished difference Result 438 states and 556 transitions. [2024-11-09 23:59:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:49,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 23:59:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:49,746 INFO L225 Difference]: With dead ends: 438 [2024-11-09 23:59:49,746 INFO L226 Difference]: Without dead ends: 378 [2024-11-09 23:59:49,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:59:49,747 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1635 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:49,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 854 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-09 23:59:49,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 250. [2024-11-09 23:59:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.288702928870293) internal successors, (308), 249 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 308 transitions. [2024-11-09 23:59:49,753 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 308 transitions. Word has length 64 [2024-11-09 23:59:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:49,754 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 308 transitions. [2024-11-09 23:59:49,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 308 transitions. [2024-11-09 23:59:49,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 23:59:49,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:49,755 INFO L215 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] [2024-11-09 23:59:49,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:59:49,755 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:49,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:49,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1268372848, now seen corresponding path program 1 times [2024-11-09 23:59:49,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:49,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142466990] [2024-11-09 23:59:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:49,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:49,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:49,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142466990] [2024-11-09 23:59:49,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142466990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:49,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:49,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:49,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915597904] [2024-11-09 23:59:49,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:49,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:49,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:49,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:49,986 INFO L87 Difference]: Start difference. First operand 250 states and 308 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:50,414 INFO L93 Difference]: Finished difference Result 383 states and 473 transitions. [2024-11-09 23:59:50,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:59:50,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 23:59:50,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:50,416 INFO L225 Difference]: With dead ends: 383 [2024-11-09 23:59:50,416 INFO L226 Difference]: Without dead ends: 378 [2024-11-09 23:59:50,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:59:50,417 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1595 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:50,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 839 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-09 23:59:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 250. [2024-11-09 23:59:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.284518828451883) internal successors, (307), 249 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 307 transitions. [2024-11-09 23:59:50,422 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 307 transitions. Word has length 64 [2024-11-09 23:59:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:50,423 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 307 transitions. [2024-11-09 23:59:50,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 307 transitions. [2024-11-09 23:59:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 23:59:50,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:50,424 INFO L215 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] [2024-11-09 23:59:50,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:59:50,424 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:50,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1345172617, now seen corresponding path program 1 times [2024-11-09 23:59:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:50,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802709538] [2024-11-09 23:59:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:50,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:50,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802709538] [2024-11-09 23:59:50,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802709538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:50,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:50,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:50,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357913436] [2024-11-09 23:59:50,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:50,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:50,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:50,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:50,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:50,641 INFO L87 Difference]: Start difference. First operand 250 states and 307 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:51,121 INFO L93 Difference]: Finished difference Result 488 states and 620 transitions. [2024-11-09 23:59:51,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:59:51,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 23:59:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:51,123 INFO L225 Difference]: With dead ends: 488 [2024-11-09 23:59:51,123 INFO L226 Difference]: Without dead ends: 390 [2024-11-09 23:59:51,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:59:51,124 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 1101 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:51,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 1024 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-09 23:59:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 250. [2024-11-09 23:59:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.2803347280334727) internal successors, (306), 249 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 306 transitions. [2024-11-09 23:59:51,129 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 306 transitions. Word has length 64 [2024-11-09 23:59:51,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:51,130 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 306 transitions. [2024-11-09 23:59:51,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 306 transitions. [2024-11-09 23:59:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 23:59:51,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:51,131 INFO L215 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] [2024-11-09 23:59:51,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:59:51,131 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:51,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash 155351256, now seen corresponding path program 1 times [2024-11-09 23:59:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975221114] [2024-11-09 23:59:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975221114] [2024-11-09 23:59:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975221114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:51,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:51,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263004246] [2024-11-09 23:59:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:51,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:51,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:51,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:51,377 INFO L87 Difference]: Start difference. First operand 250 states and 306 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:51,936 INFO L93 Difference]: Finished difference Result 403 states and 499 transitions. [2024-11-09 23:59:51,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:51,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 23:59:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:51,939 INFO L225 Difference]: With dead ends: 403 [2024-11-09 23:59:51,939 INFO L226 Difference]: Without dead ends: 386 [2024-11-09 23:59:51,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:59:51,940 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 1244 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:51,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 1406 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-09 23:59:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 250. [2024-11-09 23:59:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.2761506276150627) internal successors, (305), 249 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 305 transitions. [2024-11-09 23:59:51,947 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 305 transitions. Word has length 64 [2024-11-09 23:59:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:51,947 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 305 transitions. [2024-11-09 23:59:51,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 305 transitions. [2024-11-09 23:59:51,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 23:59:51,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:51,949 INFO L215 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] [2024-11-09 23:59:51,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:59:51,949 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:51,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:51,950 INFO L85 PathProgramCache]: Analyzing trace with hash 581232474, now seen corresponding path program 1 times [2024-11-09 23:59:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:51,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814016583] [2024-11-09 23:59:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:52,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:52,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814016583] [2024-11-09 23:59:52,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814016583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:52,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:52,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:52,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484608727] [2024-11-09 23:59:52,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:52,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:52,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:52,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:52,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:52,173 INFO L87 Difference]: Start difference. First operand 250 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:52,651 INFO L93 Difference]: Finished difference Result 383 states and 469 transitions. [2024-11-09 23:59:52,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:52,652 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 23:59:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:52,653 INFO L225 Difference]: With dead ends: 383 [2024-11-09 23:59:52,653 INFO L226 Difference]: Without dead ends: 378 [2024-11-09 23:59:52,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:59:52,654 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 989 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:52,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1152 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-09 23:59:52,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 250. [2024-11-09 23:59:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 1.2719665271966527) internal successors, (304), 249 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 304 transitions. [2024-11-09 23:59:52,666 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 304 transitions. Word has length 64 [2024-11-09 23:59:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:52,666 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 304 transitions. [2024-11-09 23:59:52,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 304 transitions. [2024-11-09 23:59:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:59:52,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:52,667 INFO L215 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] [2024-11-09 23:59:52,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:59:52,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:52,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1630249699, now seen corresponding path program 1 times [2024-11-09 23:59:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:52,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025179115] [2024-11-09 23:59:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:52,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:54,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:54,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025179115] [2024-11-09 23:59:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025179115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:54,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:54,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-09 23:59:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106589825] [2024-11-09 23:59:54,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:54,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 23:59:54,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:54,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 23:59:54,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-09 23:59:54,092 INFO L87 Difference]: Start difference. First operand 250 states and 304 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:57,123 INFO L93 Difference]: Finished difference Result 739 states and 930 transitions. [2024-11-09 23:59:57,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 23:59:57,124 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-09 23:59:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:57,126 INFO L225 Difference]: With dead ends: 739 [2024-11-09 23:59:57,126 INFO L226 Difference]: Without dead ends: 677 [2024-11-09 23:59:57,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=341, Invalid=1465, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 23:59:57,127 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 2375 mSDsluCounter, 7177 mSDsCounter, 0 mSdLazyCounter, 3902 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2375 SdHoareTripleChecker+Valid, 7786 SdHoareTripleChecker+Invalid, 3920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:57,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2375 Valid, 7786 Invalid, 3920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3902 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 23:59:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-11-09 23:59:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 261. [2024-11-09 23:59:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.272) internal successors, (318), 260 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 318 transitions. [2024-11-09 23:59:57,135 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 318 transitions. Word has length 66 [2024-11-09 23:59:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:57,135 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 318 transitions. [2024-11-09 23:59:57,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 318 transitions. [2024-11-09 23:59:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:59:57,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:57,136 INFO L215 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] [2024-11-09 23:59:57,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:59:57,137 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:57,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1745079163, now seen corresponding path program 1 times [2024-11-09 23:59:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:57,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068978244] [2024-11-09 23:59:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:57,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068978244] [2024-11-09 23:59:57,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068978244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:57,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:57,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:59:57,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052083681] [2024-11-09 23:59:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:57,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:59:57,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:57,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:59:57,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:59:57,683 INFO L87 Difference]: Start difference. First operand 261 states and 318 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:58,279 INFO L93 Difference]: Finished difference Result 437 states and 556 transitions. [2024-11-09 23:59:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:59:58,280 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-09 23:59:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:58,281 INFO L225 Difference]: With dead ends: 437 [2024-11-09 23:59:58,281 INFO L226 Difference]: Without dead ends: 368 [2024-11-09 23:59:58,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:59:58,282 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1538 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:58,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 1690 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-09 23:59:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 250. [2024-11-09 23:59:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 249 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 304 transitions. [2024-11-09 23:59:58,288 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 304 transitions. Word has length 66 [2024-11-09 23:59:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:58,288 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 304 transitions. [2024-11-09 23:59:58,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 304 transitions. [2024-11-09 23:59:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:59:58,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:58,289 INFO L215 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] [2024-11-09 23:59:58,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:59:58,289 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:58,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1946157561, now seen corresponding path program 1 times [2024-11-09 23:59:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:58,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806723192] [2024-11-09 23:59:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:58,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:58,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:58,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806723192] [2024-11-09 23:59:58,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806723192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:58,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:58,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 23:59:58,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433848472] [2024-11-09 23:59:58,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:58,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:59:58,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:58,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:59:58,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:58,837 INFO L87 Difference]: Start difference. First operand 250 states and 304 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:59,680 INFO L93 Difference]: Finished difference Result 663 states and 850 transitions. [2024-11-09 23:59:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:59:59,681 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-09 23:59:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:59,682 INFO L225 Difference]: With dead ends: 663 [2024-11-09 23:59:59,682 INFO L226 Difference]: Without dead ends: 581 [2024-11-09 23:59:59,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:59:59,683 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 1229 mSDsluCounter, 4170 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 4825 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:59,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 4825 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-09 23:59:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 226. [2024-11-09 23:59:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 217 states have (on average 1.262672811059908) internal successors, (274), 225 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 274 transitions. [2024-11-09 23:59:59,689 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 274 transitions. Word has length 66 [2024-11-09 23:59:59,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:59,689 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 274 transitions. [2024-11-09 23:59:59,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 274 transitions. [2024-11-09 23:59:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:59:59,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:59,691 INFO L215 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] [2024-11-09 23:59:59,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:59:59,691 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:59,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash -10473993, now seen corresponding path program 1 times [2024-11-09 23:59:59,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:59,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215149036] [2024-11-09 23:59:59,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:59,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:01,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:01,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215149036] [2024-11-10 00:00:01,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215149036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:01,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:01,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-10 00:00:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181825168] [2024-11-10 00:00:01,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:01,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 00:00:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:01,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 00:00:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2024-11-10 00:00:01,006 INFO L87 Difference]: Start difference. First operand 226 states and 274 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:03,563 INFO L93 Difference]: Finished difference Result 762 states and 969 transitions. [2024-11-10 00:00:03,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 00:00:03,564 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 00:00:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:03,566 INFO L225 Difference]: With dead ends: 762 [2024-11-10 00:00:03,566 INFO L226 Difference]: Without dead ends: 700 [2024-11-10 00:00:03,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=315, Invalid=1577, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 00:00:03,568 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 1989 mSDsluCounter, 6333 mSDsCounter, 0 mSdLazyCounter, 3340 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1989 SdHoareTripleChecker+Valid, 6887 SdHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:03,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1989 Valid, 6887 Invalid, 3355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3340 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 00:00:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-10 00:00:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 241. [2024-11-10 00:00:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 232 states have (on average 1.271551724137931) internal successors, (295), 240 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) [2024-11-10 00:00:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 295 transitions. [2024-11-10 00:00:03,574 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 295 transitions. Word has length 66 [2024-11-10 00:00:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:03,575 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 295 transitions. [2024-11-10 00:00:03,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 295 transitions. [2024-11-10 00:00:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 00:00:03,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:03,576 INFO L215 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] [2024-11-10 00:00:03,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:00:03,576 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:03,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 246657752, now seen corresponding path program 1 times [2024-11-10 00:00:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:03,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862403474] [2024-11-10 00:00:03,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:03,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:04,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:04,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862403474] [2024-11-10 00:00:04,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862403474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:04,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:04,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 00:00:04,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403270253] [2024-11-10 00:00:04,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:04,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 00:00:04,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:04,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 00:00:04,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:00:04,066 INFO L87 Difference]: Start difference. First operand 241 states and 295 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:04,837 INFO L93 Difference]: Finished difference Result 602 states and 778 transitions. [2024-11-10 00:00:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 00:00:04,838 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 00:00:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:04,840 INFO L225 Difference]: With dead ends: 602 [2024-11-10 00:00:04,840 INFO L226 Difference]: Without dead ends: 511 [2024-11-10 00:00:04,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:00:04,841 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 1210 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 4305 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:04,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 4305 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:00:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-10 00:00:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 208. [2024-11-10 00:00:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 202 states have (on average 1.2722772277227723) internal successors, (257), 207 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 257 transitions. [2024-11-10 00:00:04,847 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 257 transitions. Word has length 66 [2024-11-10 00:00:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:04,847 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 257 transitions. [2024-11-10 00:00:04,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 257 transitions. [2024-11-10 00:00:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:00:04,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:04,848 INFO L215 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] [2024-11-10 00:00:04,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:00:04,849 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:04,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1844404268, now seen corresponding path program 1 times [2024-11-10 00:00:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:04,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246717913] [2024-11-10 00:00:04,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:04,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:05,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:05,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246717913] [2024-11-10 00:00:05,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246717913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:05,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:05,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:00:05,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557434180] [2024-11-10 00:00:05,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:05,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:00:05,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:05,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:00:05,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:00:05,054 INFO L87 Difference]: Start difference. First operand 208 states and 257 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:05,430 INFO L93 Difference]: Finished difference Result 312 states and 390 transitions. [2024-11-10 00:00:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:00:05,430 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:00:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:05,431 INFO L225 Difference]: With dead ends: 312 [2024-11-10 00:00:05,432 INFO L226 Difference]: Without dead ends: 305 [2024-11-10 00:00:05,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:00:05,432 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 895 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:05,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 589 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:00:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-10 00:00:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 208. [2024-11-10 00:00:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 202 states have (on average 1.2623762376237624) internal successors, (255), 207 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 255 transitions. [2024-11-10 00:00:05,437 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 255 transitions. Word has length 67 [2024-11-10 00:00:05,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:05,438 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 255 transitions. [2024-11-10 00:00:05,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 255 transitions. [2024-11-10 00:00:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:00:05,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:05,439 INFO L215 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] [2024-11-10 00:00:05,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:00:05,440 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:05,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash 350074988, now seen corresponding path program 1 times [2024-11-10 00:00:05,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:05,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57260145] [2024-11-10 00:00:05,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:05,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:05,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:05,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57260145] [2024-11-10 00:00:05,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57260145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:05,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:05,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 00:00:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561925589] [2024-11-10 00:00:05,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:05,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 00:00:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:05,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 00:00:05,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:00:05,846 INFO L87 Difference]: Start difference. First operand 208 states and 255 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:06,252 INFO L93 Difference]: Finished difference Result 357 states and 459 transitions. [2024-11-10 00:00:06,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:00:06,253 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:00:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:06,254 INFO L225 Difference]: With dead ends: 357 [2024-11-10 00:00:06,254 INFO L226 Difference]: Without dead ends: 295 [2024-11-10 00:00:06,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2024-11-10 00:00:06,255 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 844 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:06,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1004 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:00:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-10 00:00:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 193. [2024-11-10 00:00:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.2606382978723405) internal successors, (237), 192 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 237 transitions. [2024-11-10 00:00:06,260 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 237 transitions. Word has length 67 [2024-11-10 00:00:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:06,260 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 237 transitions. [2024-11-10 00:00:06,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 237 transitions. [2024-11-10 00:00:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:00:06,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:06,262 INFO L215 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] [2024-11-10 00:00:06,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:00:06,262 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:06,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:06,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1683969137, now seen corresponding path program 1 times [2024-11-10 00:00:06,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:06,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301777024] [2024-11-10 00:00:06,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:06,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:06,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301777024] [2024-11-10 00:00:06,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301777024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:06,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:06,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 00:00:06,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366371642] [2024-11-10 00:00:06,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:06,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 00:00:06,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:06,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 00:00:06,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:00:06,755 INFO L87 Difference]: Start difference. First operand 193 states and 237 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:07,294 INFO L93 Difference]: Finished difference Result 342 states and 440 transitions. [2024-11-10 00:00:07,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:00:07,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:00:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:07,295 INFO L225 Difference]: With dead ends: 342 [2024-11-10 00:00:07,295 INFO L226 Difference]: Without dead ends: 280 [2024-11-10 00:00:07,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:00:07,297 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 998 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:07,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1295 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:00:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-10 00:00:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 174. [2024-11-10 00:00:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 173 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 211 transitions. [2024-11-10 00:00:07,301 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 211 transitions. Word has length 67 [2024-11-10 00:00:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:07,301 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 211 transitions. [2024-11-10 00:00:07,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 211 transitions. [2024-11-10 00:00:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:00:07,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:07,302 INFO L215 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] [2024-11-10 00:00:07,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:00:07,302 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:07,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash -396650868, now seen corresponding path program 1 times [2024-11-10 00:00:07,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:07,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244961724] [2024-11-10 00:00:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:07,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244961724] [2024-11-10 00:00:07,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244961724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:07,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:07,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:00:07,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698677876] [2024-11-10 00:00:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:07,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:00:07,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:07,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:00:07,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:00:07,523 INFO L87 Difference]: Start difference. First operand 174 states and 211 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:07,916 INFO L93 Difference]: Finished difference Result 367 states and 465 transitions. [2024-11-10 00:00:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:00:07,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:00:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:07,918 INFO L225 Difference]: With dead ends: 367 [2024-11-10 00:00:07,918 INFO L226 Difference]: Without dead ends: 291 [2024-11-10 00:00:07,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:00:07,922 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 822 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:07,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 917 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:00:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-10 00:00:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 174. [2024-11-10 00:00:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 170 states have (on average 1.2352941176470589) internal successors, (210), 173 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2024-11-10 00:00:07,926 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 67 [2024-11-10 00:00:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:07,927 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2024-11-10 00:00:07,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2024-11-10 00:00:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:00:07,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:07,928 INFO L215 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] [2024-11-10 00:00:07,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:00:07,929 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:07,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1773390098, now seen corresponding path program 1 times [2024-11-10 00:00:07,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:07,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50105220] [2024-11-10 00:00:07,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:07,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:08,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:08,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50105220] [2024-11-10 00:00:08,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50105220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:08,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:08,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:00:08,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617600540] [2024-11-10 00:00:08,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:08,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:00:08,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:00:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:00:08,145 INFO L87 Difference]: Start difference. First operand 174 states and 210 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:08,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:08,542 INFO L93 Difference]: Finished difference Result 274 states and 337 transitions. [2024-11-10 00:00:08,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:00:08,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:00:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:08,544 INFO L225 Difference]: With dead ends: 274 [2024-11-10 00:00:08,544 INFO L226 Difference]: Without dead ends: 267 [2024-11-10 00:00:08,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:00:08,545 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 848 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:08,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 826 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:00:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-10 00:00:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 174. [2024-11-10 00:00:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 170 states have (on average 1.2294117647058824) internal successors, (209), 173 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2024-11-10 00:00:08,550 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 67 [2024-11-10 00:00:08,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:08,550 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2024-11-10 00:00:08,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2024-11-10 00:00:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:00:08,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:08,551 INFO L215 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] [2024-11-10 00:00:08,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 00:00:08,552 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:08,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1125859220, now seen corresponding path program 1 times [2024-11-10 00:00:08,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:08,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951642436] [2024-11-10 00:00:08,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:08,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:08,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:08,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951642436] [2024-11-10 00:00:08,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951642436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:08,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:08,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 00:00:08,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921823325] [2024-11-10 00:00:08,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:08,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 00:00:08,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:08,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 00:00:08,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:00:08,993 INFO L87 Difference]: Start difference. First operand 174 states and 209 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:09,374 INFO L93 Difference]: Finished difference Result 421 states and 537 transitions. [2024-11-10 00:00:09,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:00:09,375 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:00:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:09,376 INFO L225 Difference]: With dead ends: 421 [2024-11-10 00:00:09,376 INFO L226 Difference]: Without dead ends: 397 [2024-11-10 00:00:09,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-10 00:00:09,377 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 1040 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:09,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 1239 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:00:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-10 00:00:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 150. [2024-11-10 00:00:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 147 states have (on average 1.2380952380952381) internal successors, (182), 149 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 182 transitions. [2024-11-10 00:00:09,382 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 182 transitions. Word has length 69 [2024-11-10 00:00:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:09,382 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 182 transitions. [2024-11-10 00:00:09,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 182 transitions. [2024-11-10 00:00:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:00:09,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:09,383 INFO L215 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] [2024-11-10 00:00:09,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 00:00:09,384 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:09,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:09,384 INFO L85 PathProgramCache]: Analyzing trace with hash 903486700, now seen corresponding path program 1 times [2024-11-10 00:00:09,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:09,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445049782] [2024-11-10 00:00:09,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:09,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:09,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445049782] [2024-11-10 00:00:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445049782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:09,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:09,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 00:00:09,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102663079] [2024-11-10 00:00:09,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:09,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 00:00:09,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:09,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 00:00:09,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:00:09,965 INFO L87 Difference]: Start difference. First operand 150 states and 182 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:10,695 INFO L93 Difference]: Finished difference Result 359 states and 471 transitions. [2024-11-10 00:00:10,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 00:00:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:00:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:10,697 INFO L225 Difference]: With dead ends: 359 [2024-11-10 00:00:10,697 INFO L226 Difference]: Without dead ends: 353 [2024-11-10 00:00:10,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:00:10,698 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 1098 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:10,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1895 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:00:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-10 00:00:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 144. [2024-11-10 00:00:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 142 states have (on average 1.2394366197183098) internal successors, (176), 143 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 176 transitions. [2024-11-10 00:00:10,706 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 176 transitions. Word has length 69 [2024-11-10 00:00:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:10,706 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 176 transitions. [2024-11-10 00:00:10,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2024-11-10 00:00:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:00:10,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:10,708 INFO L215 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] [2024-11-10 00:00:10,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 00:00:10,708 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:10,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:10,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1097259374, now seen corresponding path program 1 times [2024-11-10 00:00:10,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:10,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183042978] [2024-11-10 00:00:10,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:10,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:11,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:11,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183042978] [2024-11-10 00:00:11,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183042978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:11,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:11,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-10 00:00:11,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101535382] [2024-11-10 00:00:11,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:11,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 00:00:11,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:11,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 00:00:11,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:00:11,703 INFO L87 Difference]: Start difference. First operand 144 states and 176 transitions. Second operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:13,556 INFO L93 Difference]: Finished difference Result 493 states and 641 transitions. [2024-11-10 00:00:13,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 00:00:13,557 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:00:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:13,558 INFO L225 Difference]: With dead ends: 493 [2024-11-10 00:00:13,558 INFO L226 Difference]: Without dead ends: 485 [2024-11-10 00:00:13,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=243, Invalid=1163, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 00:00:13,559 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 1264 mSDsluCounter, 4342 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 4756 SdHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:13,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 4756 Invalid, 2242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 00:00:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-10 00:00:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 158. [2024-11-10 00:00:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 156 states have (on average 1.2371794871794872) internal successors, (193), 157 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 193 transitions. [2024-11-10 00:00:13,564 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 193 transitions. Word has length 69 [2024-11-10 00:00:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:13,564 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 193 transitions. [2024-11-10 00:00:13,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:13,565 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2024-11-10 00:00:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 00:00:13,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:13,566 INFO L215 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] [2024-11-10 00:00:13,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 00:00:13,566 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:13,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:13,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1501915316, now seen corresponding path program 1 times [2024-11-10 00:00:13,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:13,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305631790] [2024-11-10 00:00:13,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:13,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:14,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:14,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305631790] [2024-11-10 00:00:14,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305631790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:14,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:14,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 00:00:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665163614] [2024-11-10 00:00:14,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:14,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 00:00:14,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:14,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 00:00:14,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:00:14,060 INFO L87 Difference]: Start difference. First operand 158 states and 193 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:14,561 INFO L93 Difference]: Finished difference Result 235 states and 300 transitions. [2024-11-10 00:00:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:00:14,561 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-10 00:00:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:14,562 INFO L225 Difference]: With dead ends: 235 [2024-11-10 00:00:14,562 INFO L226 Difference]: Without dead ends: 220 [2024-11-10 00:00:14,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-10 00:00:14,564 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 726 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:14,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1258 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:00:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-10 00:00:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 132. [2024-11-10 00:00:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.2442748091603053) internal successors, (163), 131 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2024-11-10 00:00:14,567 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 70 [2024-11-10 00:00:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:14,567 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2024-11-10 00:00:14,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2024-11-10 00:00:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 00:00:14,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:14,569 INFO L215 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] [2024-11-10 00:00:14,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 00:00:14,569 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:14,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash -711762437, now seen corresponding path program 1 times [2024-11-10 00:00:14,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:14,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130930736] [2024-11-10 00:00:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:14,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:14,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130930736] [2024-11-10 00:00:14,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130930736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:14,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:14,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:14,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347952764] [2024-11-10 00:00:14,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:14,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:00:14,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:14,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:00:14,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:00:14,678 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:14,799 INFO L93 Difference]: Finished difference Result 596 states and 835 transitions. [2024-11-10 00:00:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:00:14,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-10 00:00:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:14,802 INFO L225 Difference]: With dead ends: 596 [2024-11-10 00:00:14,802 INFO L226 Difference]: Without dead ends: 538 [2024-11-10 00:00:14,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:00:14,803 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 855 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:14,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1067 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:00:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-10 00:00:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 188. [2024-11-10 00:00:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.304812834224599) internal successors, (244), 187 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2024-11-10 00:00:14,815 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 92 [2024-11-10 00:00:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:14,815 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2024-11-10 00:00:14,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2024-11-10 00:00:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:00:14,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:14,816 INFO L215 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] [2024-11-10 00:00:14,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 00:00:14,817 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:14,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:14,817 INFO L85 PathProgramCache]: Analyzing trace with hash -366995273, now seen corresponding path program 1 times [2024-11-10 00:00:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:14,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155400714] [2024-11-10 00:00:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:14,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:14,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:14,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155400714] [2024-11-10 00:00:14,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155400714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:14,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:14,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:14,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740790569] [2024-11-10 00:00:14,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:14,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:00:14,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:14,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:00:14,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:00:14,962 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:15,044 INFO L93 Difference]: Finished difference Result 702 states and 986 transitions. [2024-11-10 00:00:15,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:00:15,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:00:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:15,047 INFO L225 Difference]: With dead ends: 702 [2024-11-10 00:00:15,047 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 00:00:15,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:00:15,048 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 595 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:15,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 759 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:00:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 00:00:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 300. [2024-11-10 00:00:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.3612040133779264) internal successors, (407), 299 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 407 transitions. [2024-11-10 00:00:15,061 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 407 transitions. Word has length 94 [2024-11-10 00:00:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:15,061 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 407 transitions. [2024-11-10 00:00:15,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 407 transitions. [2024-11-10 00:00:15,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:00:15,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:15,063 INFO L215 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] [2024-11-10 00:00:15,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 00:00:15,063 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:15,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:15,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1646873046, now seen corresponding path program 1 times [2024-11-10 00:00:15,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:15,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019190440] [2024-11-10 00:00:15,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:15,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:15,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:15,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019190440] [2024-11-10 00:00:15,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019190440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:15,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:15,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:15,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985204275] [2024-11-10 00:00:15,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:15,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:00:15,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:15,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:00:15,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:00:15,195 INFO L87 Difference]: Start difference. First operand 300 states and 407 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:15,282 INFO L93 Difference]: Finished difference Result 814 states and 1149 transitions. [2024-11-10 00:00:15,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:00:15,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:00:15,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:15,285 INFO L225 Difference]: With dead ends: 814 [2024-11-10 00:00:15,285 INFO L226 Difference]: Without dead ends: 700 [2024-11-10 00:00:15,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:00:15,286 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 635 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:15,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 722 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:00:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-10 00:00:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 468. [2024-11-10 00:00:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.3940042826552463) internal successors, (651), 467 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 651 transitions. [2024-11-10 00:00:15,298 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 651 transitions. Word has length 94 [2024-11-10 00:00:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:15,298 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 651 transitions. [2024-11-10 00:00:15,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 651 transitions. [2024-11-10 00:00:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:00:15,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:15,299 INFO L215 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] [2024-11-10 00:00:15,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 00:00:15,301 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:15,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash 27298775, now seen corresponding path program 1 times [2024-11-10 00:00:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:15,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56110249] [2024-11-10 00:00:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:15,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:15,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56110249] [2024-11-10 00:00:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56110249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:15,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:15,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:15,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161402327] [2024-11-10 00:00:15,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:15,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:00:15,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:15,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:00:15,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:00:15,449 INFO L87 Difference]: Start difference. First operand 468 states and 651 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:15,535 INFO L93 Difference]: Finished difference Result 926 states and 1312 transitions. [2024-11-10 00:00:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:00:15,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:00:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:15,539 INFO L225 Difference]: With dead ends: 926 [2024-11-10 00:00:15,539 INFO L226 Difference]: Without dead ends: 812 [2024-11-10 00:00:15,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:00:15,541 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 613 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:15,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 757 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:00:15,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-11-10 00:00:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 580. [2024-11-10 00:00:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.4058721934369602) internal successors, (814), 579 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 814 transitions. [2024-11-10 00:00:15,557 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 814 transitions. Word has length 94 [2024-11-10 00:00:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:15,558 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 814 transitions. [2024-11-10 00:00:15,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,558 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 814 transitions. [2024-11-10 00:00:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 00:00:15,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:15,559 INFO L215 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] [2024-11-10 00:00:15,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 00:00:15,560 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:15,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1110146772, now seen corresponding path program 1 times [2024-11-10 00:00:15,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:15,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19990374] [2024-11-10 00:00:15,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:15,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:15,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:15,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19990374] [2024-11-10 00:00:15,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19990374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:15,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:15,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:15,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367984708] [2024-11-10 00:00:15,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:15,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:00:15,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:15,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:00:15,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:00:15,773 INFO L87 Difference]: Start difference. First operand 580 states and 814 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:15,859 INFO L93 Difference]: Finished difference Result 1088 states and 1550 transitions. [2024-11-10 00:00:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:00:15,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-10 00:00:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:15,862 INFO L225 Difference]: With dead ends: 1088 [2024-11-10 00:00:15,862 INFO L226 Difference]: Without dead ends: 582 [2024-11-10 00:00:15,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:00:15,863 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 213 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:15,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 400 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-10 00:00:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2024-11-10 00:00:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.3972366148531952) internal successors, (809), 579 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 809 transitions. [2024-11-10 00:00:15,874 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 809 transitions. Word has length 95 [2024-11-10 00:00:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:15,874 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 809 transitions. [2024-11-10 00:00:15,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 809 transitions. [2024-11-10 00:00:15,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 00:00:15,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:15,876 INFO L215 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] [2024-11-10 00:00:15,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 00:00:15,876 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:15,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:15,877 INFO L85 PathProgramCache]: Analyzing trace with hash -273513079, now seen corresponding path program 1 times [2024-11-10 00:00:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:15,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789770] [2024-11-10 00:00:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:15,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:15,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789770] [2024-11-10 00:00:15,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:15,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:15,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:15,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975730155] [2024-11-10 00:00:15,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:15,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:15,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:15,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:15,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:15,944 INFO L87 Difference]: Start difference. First operand 580 states and 809 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:15,971 INFO L93 Difference]: Finished difference Result 1530 states and 2168 transitions. [2024-11-10 00:00:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:15,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-10 00:00:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:15,975 INFO L225 Difference]: With dead ends: 1530 [2024-11-10 00:00:15,975 INFO L226 Difference]: Without dead ends: 1024 [2024-11-10 00:00:15,976 INFO L431 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 [2024-11-10 00:00:15,977 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 111 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:15,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 266 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2024-11-10 00:00:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1013. [2024-11-10 00:00:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.3883399209486167) internal successors, (1405), 1012 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1405 transitions. [2024-11-10 00:00:15,998 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1405 transitions. Word has length 95 [2024-11-10 00:00:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:15,998 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1405 transitions. [2024-11-10 00:00:15,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1405 transitions. [2024-11-10 00:00:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 00:00:16,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:16,000 INFO L215 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] [2024-11-10 00:00:16,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 00:00:16,000 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:16,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash -132964469, now seen corresponding path program 1 times [2024-11-10 00:00:16,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:16,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348318462] [2024-11-10 00:00:16,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:16,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:16,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348318462] [2024-11-10 00:00:16,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348318462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:16,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:16,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:16,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080999717] [2024-11-10 00:00:16,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:16,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:00:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:00:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:00:16,126 INFO L87 Difference]: Start difference. First operand 1013 states and 1405 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:16,216 INFO L93 Difference]: Finished difference Result 1855 states and 2594 transitions. [2024-11-10 00:00:16,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:00:16,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-10 00:00:16,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:16,222 INFO L225 Difference]: With dead ends: 1855 [2024-11-10 00:00:16,223 INFO L226 Difference]: Without dead ends: 1645 [2024-11-10 00:00:16,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:00:16,224 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 586 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:16,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 871 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:00:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2024-11-10 00:00:16,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1221. [2024-11-10 00:00:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.3926229508196721) internal successors, (1699), 1220 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1699 transitions. [2024-11-10 00:00:16,255 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1699 transitions. Word has length 95 [2024-11-10 00:00:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:16,255 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1699 transitions. [2024-11-10 00:00:16,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1699 transitions. [2024-11-10 00:00:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:00:16,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:16,257 INFO L215 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] [2024-11-10 00:00:16,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 00:00:16,257 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:16,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2039331438, now seen corresponding path program 1 times [2024-11-10 00:00:16,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:16,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742713436] [2024-11-10 00:00:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:16,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:16,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742713436] [2024-11-10 00:00:16,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742713436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:16,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:16,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466232802] [2024-11-10 00:00:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:16,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:00:16,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:16,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:00:16,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:00:16,396 INFO L87 Difference]: Start difference. First operand 1221 states and 1699 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:16,690 INFO L93 Difference]: Finished difference Result 4131 states and 5884 transitions. [2024-11-10 00:00:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:00:16,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-10 00:00:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:16,702 INFO L225 Difference]: With dead ends: 4131 [2024-11-10 00:00:16,702 INFO L226 Difference]: Without dead ends: 2984 [2024-11-10 00:00:16,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:00:16,706 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 686 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:16,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 409 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:00:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2024-11-10 00:00:16,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2157. [2024-11-10 00:00:16,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 2156 states have (on average 1.3956400742115027) internal successors, (3009), 2156 states have internal predecessors, (3009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3009 transitions. [2024-11-10 00:00:16,760 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 3009 transitions. Word has length 96 [2024-11-10 00:00:16,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:16,760 INFO L471 AbstractCegarLoop]: Abstraction has 2157 states and 3009 transitions. [2024-11-10 00:00:16,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 3009 transitions. [2024-11-10 00:00:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:00:16,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:16,762 INFO L215 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] [2024-11-10 00:00:16,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 00:00:16,763 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:16,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1066734350, now seen corresponding path program 1 times [2024-11-10 00:00:16,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:16,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830645215] [2024-11-10 00:00:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:16,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:16,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:16,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830645215] [2024-11-10 00:00:16,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830645215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:16,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:16,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:16,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930229467] [2024-11-10 00:00:16,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:16,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:00:16,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:16,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:00:16,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:00:16,895 INFO L87 Difference]: Start difference. First operand 2157 states and 3009 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:17,129 INFO L93 Difference]: Finished difference Result 7643 states and 10849 transitions. [2024-11-10 00:00:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:00:17,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-10 00:00:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:17,148 INFO L225 Difference]: With dead ends: 7643 [2024-11-10 00:00:17,149 INFO L226 Difference]: Without dead ends: 5560 [2024-11-10 00:00:17,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:00:17,155 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 872 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:17,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 317 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:00:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states. [2024-11-10 00:00:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 4568. [2024-11-10 00:00:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4568 states, 4567 states have (on average 1.4013575651412307) internal successors, (6400), 4567 states have internal predecessors, (6400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4568 states to 4568 states and 6400 transitions. [2024-11-10 00:00:17,253 INFO L78 Accepts]: Start accepts. Automaton has 4568 states and 6400 transitions. Word has length 96 [2024-11-10 00:00:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:17,253 INFO L471 AbstractCegarLoop]: Abstraction has 4568 states and 6400 transitions. [2024-11-10 00:00:17,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4568 states and 6400 transitions. [2024-11-10 00:00:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 00:00:17,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:17,255 INFO L215 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] [2024-11-10 00:00:17,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-10 00:00:17,256 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:17,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:17,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1814613128, now seen corresponding path program 1 times [2024-11-10 00:00:17,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:17,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334749294] [2024-11-10 00:00:17,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:17,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:17,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:17,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334749294] [2024-11-10 00:00:17,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334749294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:17,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:17,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687150380] [2024-11-10 00:00:17,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:17,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:00:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:17,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:00:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:00:17,395 INFO L87 Difference]: Start difference. First operand 4568 states and 6400 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:17,601 INFO L93 Difference]: Finished difference Result 14876 states and 21022 transitions. [2024-11-10 00:00:17,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:00:17,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-10 00:00:17,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:17,636 INFO L225 Difference]: With dead ends: 14876 [2024-11-10 00:00:17,636 INFO L226 Difference]: Without dead ends: 10382 [2024-11-10 00:00:17,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:00:17,648 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 785 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:17,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 316 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:00:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10382 states. [2024-11-10 00:00:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10382 to 9720. [2024-11-10 00:00:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9720 states, 9719 states have (on average 1.4038481325239223) internal successors, (13644), 9719 states have internal predecessors, (13644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9720 states to 9720 states and 13644 transitions. [2024-11-10 00:00:17,831 INFO L78 Accepts]: Start accepts. Automaton has 9720 states and 13644 transitions. Word has length 97 [2024-11-10 00:00:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:17,831 INFO L471 AbstractCegarLoop]: Abstraction has 9720 states and 13644 transitions. [2024-11-10 00:00:17,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 9720 states and 13644 transitions. [2024-11-10 00:00:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 00:00:17,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:17,833 INFO L215 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] [2024-11-10 00:00:17,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 00:00:17,834 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:17,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1967561232, now seen corresponding path program 1 times [2024-11-10 00:00:17,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:17,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87023535] [2024-11-10 00:00:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:17,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:17,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:17,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87023535] [2024-11-10 00:00:17,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87023535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:17,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:17,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:17,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185464187] [2024-11-10 00:00:17,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:17,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:17,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:17,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:17,989 INFO L87 Difference]: Start difference. First operand 9720 states and 13644 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:18,051 INFO L93 Difference]: Finished difference Result 18576 states and 26022 transitions. [2024-11-10 00:00:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:18,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-10 00:00:18,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:18,077 INFO L225 Difference]: With dead ends: 18576 [2024-11-10 00:00:18,077 INFO L226 Difference]: Without dead ends: 8930 [2024-11-10 00:00:18,090 INFO L431 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 [2024-11-10 00:00:18,091 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 76 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 340 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 [2024-11-10 00:00:18,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 340 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8930 states. [2024-11-10 00:00:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8930 to 7210. [2024-11-10 00:00:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7210 states, 7209 states have (on average 1.382716049382716) internal successors, (9968), 7209 states have internal predecessors, (9968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7210 states to 7210 states and 9968 transitions. [2024-11-10 00:00:18,213 INFO L78 Accepts]: Start accepts. Automaton has 7210 states and 9968 transitions. Word has length 98 [2024-11-10 00:00:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:18,214 INFO L471 AbstractCegarLoop]: Abstraction has 7210 states and 9968 transitions. [2024-11-10 00:00:18,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 7210 states and 9968 transitions. [2024-11-10 00:00:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 00:00:18,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:18,216 INFO L215 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] [2024-11-10 00:00:18,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-10 00:00:18,216 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:18,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:18,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1730616448, now seen corresponding path program 1 times [2024-11-10 00:00:18,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:18,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991713034] [2024-11-10 00:00:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:18,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:18,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:18,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991713034] [2024-11-10 00:00:18,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991713034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:18,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:18,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:18,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911332946] [2024-11-10 00:00:18,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:18,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:18,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:18,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:18,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:18,343 INFO L87 Difference]: Start difference. First operand 7210 states and 9968 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:18,392 INFO L93 Difference]: Finished difference Result 13754 states and 18956 transitions. [2024-11-10 00:00:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:18,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-10 00:00:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:18,405 INFO L225 Difference]: With dead ends: 13754 [2024-11-10 00:00:18,405 INFO L226 Difference]: Without dead ends: 6618 [2024-11-10 00:00:18,415 INFO L431 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 [2024-11-10 00:00:18,417 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 69 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 342 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 [2024-11-10 00:00:18,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 342 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6618 states. [2024-11-10 00:00:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6618 to 6418. [2024-11-10 00:00:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6418 states, 6417 states have (on average 1.363098020882032) internal successors, (8747), 6417 states have internal predecessors, (8747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6418 states to 6418 states and 8747 transitions. [2024-11-10 00:00:18,510 INFO L78 Accepts]: Start accepts. Automaton has 6418 states and 8747 transitions. Word has length 99 [2024-11-10 00:00:18,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:18,510 INFO L471 AbstractCegarLoop]: Abstraction has 6418 states and 8747 transitions. [2024-11-10 00:00:18,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6418 states and 8747 transitions. [2024-11-10 00:00:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 00:00:18,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:18,512 INFO L215 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] [2024-11-10 00:00:18,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-10 00:00:18,512 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:18,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:18,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1534770747, now seen corresponding path program 1 times [2024-11-10 00:00:18,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:18,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670627630] [2024-11-10 00:00:18,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:18,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670627630] [2024-11-10 00:00:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670627630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:18,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517405219] [2024-11-10 00:00:18,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:18,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:18,627 INFO L87 Difference]: Start difference. First operand 6418 states and 8747 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:18,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:18,685 INFO L93 Difference]: Finished difference Result 18501 states and 25093 transitions. [2024-11-10 00:00:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:18,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-10 00:00:18,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:18,710 INFO L225 Difference]: With dead ends: 18501 [2024-11-10 00:00:18,711 INFO L226 Difference]: Without dead ends: 12157 [2024-11-10 00:00:18,721 INFO L431 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 [2024-11-10 00:00:18,722 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 59 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:18,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 344 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:18,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12157 states. [2024-11-10 00:00:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12157 to 11385. [2024-11-10 00:00:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11385 states, 11384 states have (on average 1.3460997891777935) internal successors, (15324), 11384 states have internal predecessors, (15324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11385 states to 11385 states and 15324 transitions. [2024-11-10 00:00:18,955 INFO L78 Accepts]: Start accepts. Automaton has 11385 states and 15324 transitions. Word has length 100 [2024-11-10 00:00:18,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:18,955 INFO L471 AbstractCegarLoop]: Abstraction has 11385 states and 15324 transitions. [2024-11-10 00:00:18,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 11385 states and 15324 transitions. [2024-11-10 00:00:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 00:00:18,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:18,957 INFO L215 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] [2024-11-10 00:00:18,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-10 00:00:18,957 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:18,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1810411890, now seen corresponding path program 1 times [2024-11-10 00:00:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:18,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757633308] [2024-11-10 00:00:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:18,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:19,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:19,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757633308] [2024-11-10 00:00:19,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757633308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:19,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:19,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:19,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377492751] [2024-11-10 00:00:19,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:19,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:00:19,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:19,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:00:19,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:00:19,240 INFO L87 Difference]: Start difference. First operand 11385 states and 15324 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:19,296 INFO L93 Difference]: Finished difference Result 11927 states and 15985 transitions. [2024-11-10 00:00:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:00:19,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-10 00:00:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:19,320 INFO L225 Difference]: With dead ends: 11927 [2024-11-10 00:00:19,320 INFO L226 Difference]: Without dead ends: 11925 [2024-11-10 00:00:19,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:00:19,327 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:19,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 784 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11925 states. [2024-11-10 00:00:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11925 to 11925. [2024-11-10 00:00:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11925 states, 11924 states have (on average 1.3243877893324387) internal successors, (15792), 11924 states have internal predecessors, (15792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11925 states to 11925 states and 15792 transitions. [2024-11-10 00:00:19,495 INFO L78 Accepts]: Start accepts. Automaton has 11925 states and 15792 transitions. Word has length 101 [2024-11-10 00:00:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:19,496 INFO L471 AbstractCegarLoop]: Abstraction has 11925 states and 15792 transitions. [2024-11-10 00:00:19,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 11925 states and 15792 transitions. [2024-11-10 00:00:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 00:00:19,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:19,497 INFO L215 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] [2024-11-10 00:00:19,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-10 00:00:19,498 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:19,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:19,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1208098682, now seen corresponding path program 1 times [2024-11-10 00:00:19,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:19,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676751230] [2024-11-10 00:00:19,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:19,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:19,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:19,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676751230] [2024-11-10 00:00:19,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676751230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:19,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:19,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:00:19,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802086327] [2024-11-10 00:00:19,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:19,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:00:19,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:19,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:00:19,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:00:19,625 INFO L87 Difference]: Start difference. First operand 11925 states and 15792 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:19,884 INFO L93 Difference]: Finished difference Result 24757 states and 32837 transitions. [2024-11-10 00:00:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:00:19,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-10 00:00:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:19,907 INFO L225 Difference]: With dead ends: 24757 [2024-11-10 00:00:19,907 INFO L226 Difference]: Without dead ends: 12906 [2024-11-10 00:00:19,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:00:19,925 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 633 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:19,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 353 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:00:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12906 states. [2024-11-10 00:00:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12906 to 11925. [2024-11-10 00:00:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11925 states, 11924 states have (on average 1.3133176786313319) internal successors, (15660), 11924 states have internal predecessors, (15660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11925 states to 11925 states and 15660 transitions. [2024-11-10 00:00:20,152 INFO L78 Accepts]: Start accepts. Automaton has 11925 states and 15660 transitions. Word has length 101 [2024-11-10 00:00:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:20,154 INFO L471 AbstractCegarLoop]: Abstraction has 11925 states and 15660 transitions. [2024-11-10 00:00:20,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 11925 states and 15660 transitions. [2024-11-10 00:00:20,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 00:00:20,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:20,156 INFO L215 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] [2024-11-10 00:00:20,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-10 00:00:20,156 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:20,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:20,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1422625988, now seen corresponding path program 1 times [2024-11-10 00:00:20,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:20,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346930176] [2024-11-10 00:00:20,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:20,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346930176] [2024-11-10 00:00:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346930176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262333802] [2024-11-10 00:00:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:20,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:20,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:20,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:20,269 INFO L87 Difference]: Start difference. First operand 11925 states and 15660 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:20,349 INFO L93 Difference]: Finished difference Result 25821 states and 33866 transitions. [2024-11-10 00:00:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:20,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-10 00:00:20,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:20,371 INFO L225 Difference]: With dead ends: 25821 [2024-11-10 00:00:20,372 INFO L226 Difference]: Without dead ends: 13970 [2024-11-10 00:00:20,388 INFO L431 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 [2024-11-10 00:00:20,389 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 80 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 348 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 [2024-11-10 00:00:20,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 348 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13970 states. [2024-11-10 00:00:20,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13970 to 13616. [2024-11-10 00:00:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13616 states, 13615 states have (on average 1.2976863753213368) internal successors, (17668), 13615 states have internal predecessors, (17668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13616 states to 13616 states and 17668 transitions. [2024-11-10 00:00:20,587 INFO L78 Accepts]: Start accepts. Automaton has 13616 states and 17668 transitions. Word has length 102 [2024-11-10 00:00:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:20,588 INFO L471 AbstractCegarLoop]: Abstraction has 13616 states and 17668 transitions. [2024-11-10 00:00:20,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 13616 states and 17668 transitions. [2024-11-10 00:00:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 00:00:20,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:20,591 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:20,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-10 00:00:20,592 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:20,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:20,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1300018212, now seen corresponding path program 1 times [2024-11-10 00:00:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:20,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180061058] [2024-11-10 00:00:20,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:20,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:20,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:20,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180061058] [2024-11-10 00:00:20,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180061058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:20,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:20,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:20,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015713830] [2024-11-10 00:00:20,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:20,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:20,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:20,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:20,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:20,705 INFO L87 Difference]: Start difference. First operand 13616 states and 17668 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:20,781 INFO L93 Difference]: Finished difference Result 26368 states and 34026 transitions. [2024-11-10 00:00:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-11-10 00:00:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:20,799 INFO L225 Difference]: With dead ends: 26368 [2024-11-10 00:00:20,799 INFO L226 Difference]: Without dead ends: 12826 [2024-11-10 00:00:20,816 INFO L431 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 [2024-11-10 00:00:20,817 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 67 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:20,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 315 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:20,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12826 states. [2024-11-10 00:00:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12826 to 12824. [2024-11-10 00:00:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12824 states, 12823 states have (on average 1.2680340014037277) internal successors, (16260), 12823 states have internal predecessors, (16260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12824 states to 12824 states and 16260 transitions. [2024-11-10 00:00:21,079 INFO L78 Accepts]: Start accepts. Automaton has 12824 states and 16260 transitions. Word has length 129 [2024-11-10 00:00:21,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:21,079 INFO L471 AbstractCegarLoop]: Abstraction has 12824 states and 16260 transitions. [2024-11-10 00:00:21,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:00:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 12824 states and 16260 transitions. [2024-11-10 00:00:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 00:00:21,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:21,083 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:21,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-10 00:00:21,083 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-10 00:00:21,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1149231331, now seen corresponding path program 1 times [2024-11-10 00:00:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:21,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89724485] [2024-11-10 00:00:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:21,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:21,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:21,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89724485] [2024-11-10 00:00:21,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89724485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:00:21,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403807170] [2024-11-10 00:00:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:21,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:00:21,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:00:21,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:00:21,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:00:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:22,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 00:00:22,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:00:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:23,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:00:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:00:24,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403807170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:00:24,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:00:24,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 32 [2024-11-10 00:00:24,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852004139] [2024-11-10 00:00:24,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:00:24,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-10 00:00:24,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:24,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-10 00:00:24,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 00:00:24,817 INFO L87 Difference]: Start difference. First operand 12824 states and 16260 transitions. Second operand has 33 states, 33 states have (on average 10.818181818181818) internal successors, (357), 32 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)